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-a74eeac-m [2018-02-02 21:05:56,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:05:56,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:05:56,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:05:56,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:05:56,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:05:56,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:05:56,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:05:56,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:05:56,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:05:56,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:05:56,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:05:56,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:05:56,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:05:56,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:05:56,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:05:56,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:05:56,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:05:56,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:05:56,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:05:56,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:05:56,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:05:56,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:05:56,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:05:56,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:05:56,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:05:56,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:05:56,759 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:05:56,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:05:56,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:05:56,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:05:56,761 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-02 21:05:56,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:05:56,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:05:56,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:05:56,771 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:05:56,771 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:05:56,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:05:56,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:05:56,772 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:05:56,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:05:56,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:05:56,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:05:56,773 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:05:56,773 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:05:56,773 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:05:56,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:05:56,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:05:56,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:05:56,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:05:56,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:05:56,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:05:56,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:05:56,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:05:56,774 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:05:56,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:05:56,775 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:05:56,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:05:56,811 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:05:56,813 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:05:56,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:05:56,814 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:05:56,815 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-02 21:05:56,915 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:05:56,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:05:56,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:05:56,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:05:56,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:05:56,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:05:56" (1/1) ... [2018-02-02 21:05:56,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648881c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:56, skipping insertion in model container [2018-02-02 21:05:56,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:05:56" (1/1) ... [2018-02-02 21:05:56,943 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:05:56,959 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:05:57,060 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:05:57,074 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:05:57,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57 WrapperNode [2018-02-02 21:05:57,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:05:57,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:05:57,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:05:57,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:05:57,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (1/1) ... [2018-02-02 21:05:57,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:05:57,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:05:57,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:05:57,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:05:57,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (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-02 21:05:57,142 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:05:57,143 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:05:57,143 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 21:05:57,143 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:05:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:05:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:05:57,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:05:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:05:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:05:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 21:05:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:05:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:05:57,144 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:05:57,287 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:05:57,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:05:57 BoogieIcfgContainer [2018-02-02 21:05:57,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:05:57,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:05:57,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:05:57,290 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:05:57,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:05:56" (1/3) ... [2018-02-02 21:05:57,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2294f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:05:57, skipping insertion in model container [2018-02-02 21:05:57,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:57" (2/3) ... [2018-02-02 21:05:57,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2294f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:05:57, skipping insertion in model container [2018-02-02 21:05:57,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:05:57" (3/3) ... [2018-02-02 21:05:57,294 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-02-02 21:05:57,300 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:05:57,307 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-02 21:05:57,343 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:05:57,344 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:05:57,344 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:05:57,344 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:05:57,344 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:05:57,344 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:05:57,344 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:05:57,344 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:05:57,345 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:05:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 21:05:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 21:05:57,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:57,367 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:05:57,367 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-02-02 21:05:57,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:57,372 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:57,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:57,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:57,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:57,517 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-02 21:05:57,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:05:57,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:05:57,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:05:57,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:05:57,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:05:57,531 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 21:05:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:57,592 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 21:05:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:05:57,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 21:05:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:57,598 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:05:57,598 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:05:57,600 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-02 21:05:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:05:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-02-02 21:05:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 21:05:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-02 21:05:57,667 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-02-02 21:05:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:57,667 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-02 21:05:57,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:05:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-02 21:05:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:05:57,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:57,668 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:05:57,668 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-02-02 21:05:57,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:57,669 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:57,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:57,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:57,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:57,747 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-02 21:05:57,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:05:57,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:05:57,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:05:57,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:05:57,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:05:57,749 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-02-02 21:05:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:57,851 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-02 21:05:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:05:57,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 21:05:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:57,852 INFO L225 Difference]: With dead ends: 65 [2018-02-02 21:05:57,853 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 21:05:57,853 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-02 21:05:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 21:05:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-02 21:05:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 21:05:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 21:05:57,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-02-02 21:05:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:57,859 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 21:05:57,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:05:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 21:05:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:05:57,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:57,860 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-02 21:05:57,860 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-02-02 21:05:57,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:57,861 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:57,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:57,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:57,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:57,913 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-02 21:05:57,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:05:57,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:05:57,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:05:57,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:05:57,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:05:57,915 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-02-02 21:05:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:57,964 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-02 21:05:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:05:57,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 21:05:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:57,966 INFO L225 Difference]: With dead ends: 65 [2018-02-02 21:05:57,966 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 21:05:57,967 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-02 21:05:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 21:05:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-02-02 21:05:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 21:05:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-02 21:05:57,973 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2018-02-02 21:05:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:57,973 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-02 21:05:57,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:05:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-02 21:05:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 21:05:57,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:57,974 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-02 21:05:57,974 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-02-02 21:05:57,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:57,975 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:57,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:57,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:57,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:58,012 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-02 21:05:58,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:05:58,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:05:58,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:05:58,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:05:58,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:05:58,013 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-02-02 21:05:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:58,036 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-02 21:05:58,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:05:58,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 21:05:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:58,038 INFO L225 Difference]: With dead ends: 64 [2018-02-02 21:05:58,038 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 21:05:58,039 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-02 21:05:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 21:05:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-02-02 21:05:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 21:05:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-02 21:05:58,043 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-02-02 21:05:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:58,043 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-02 21:05:58,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:05:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-02 21:05:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 21:05:58,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:58,044 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-02 21:05:58,044 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-02-02 21:05:58,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:58,045 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:58,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,045 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:58,158 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-02 21:05:58,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:58,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:58,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:58,236 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-02 21:05:58,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:58,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:58,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:05:58,296 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-02 21:05:58,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:58,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-02 21:05:58,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:05:58,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:05:58,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:05:58,298 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-02-02 21:05:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:58,442 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 21:05:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:05:58,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 21:05:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:58,443 INFO L225 Difference]: With dead ends: 68 [2018-02-02 21:05:58,443 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 21:05:58,444 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-02 21:05:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 21:05:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-02-02 21:05:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 21:05:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-02 21:05:58,446 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 29 [2018-02-02 21:05:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:58,447 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-02 21:05:58,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:05:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-02 21:05:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 21:05:58,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:58,447 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-02 21:05:58,448 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-02-02 21:05:58,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:58,448 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:58,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:58,496 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-02 21:05:58,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:58,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:58,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:58,518 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-02 21:05:58,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:58,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:05:58,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 21:05:58,534 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-02 21:05:58,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:58,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-02-02 21:05:58,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:05:58,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:05:58,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:05:58,535 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 7 states. [2018-02-02 21:05:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:58,571 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-02 21:05:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:05:58,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 21:05:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:58,571 INFO L225 Difference]: With dead ends: 60 [2018-02-02 21:05:58,571 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 21:05:58,572 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-02 21:05:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 21:05:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 21:05:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:05:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 21:05:58,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 29 [2018-02-02 21:05:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:58,575 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 21:05:58,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:05:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 21:05:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 21:05:58,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:58,576 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-02 21:05:58,576 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1474818454, now seen corresponding path program 1 times [2018-02-02 21:05:58,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:58,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:58,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:58,628 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-02 21:05:58,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:58,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:58,629 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:58,656 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-02 21:05:58,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:58,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2018-02-02 21:05:58,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:05:58,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:05:58,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:05:58,657 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 10 states. [2018-02-02 21:05:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:58,803 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-02 21:05:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:05:58,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 21:05:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:58,804 INFO L225 Difference]: With dead ends: 89 [2018-02-02 21:05:58,804 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 21:05:58,804 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-02 21:05:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 21:05:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-02-02 21:05:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 21:05:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 21:05:58,807 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 31 [2018-02-02 21:05:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:58,807 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 21:05:58,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:05:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 21:05:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 21:05:58,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:58,808 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-02 21:05:58,808 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash -193392944, now seen corresponding path program 1 times [2018-02-02 21:05:58,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:58,809 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:58,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,810 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:58,878 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-02 21:05:58,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:58,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:58,879 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:58,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:58,925 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-02 21:05:58,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:58,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-02 21:05:58,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:05:58,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:05:58,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:05:58,926 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 12 states. [2018-02-02 21:05:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:59,051 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-02 21:05:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:05:59,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 21:05:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:59,052 INFO L225 Difference]: With dead ends: 101 [2018-02-02 21:05:59,052 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 21:05:59,052 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-02 21:05:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 21:05:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2018-02-02 21:05:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 21:05:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 21:05:59,056 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-02 21:05:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:59,056 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 21:05:59,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:05:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 21:05:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:05:59,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:59,057 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-02 21:05:59,057 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 2 times [2018-02-02 21:05:59,057 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:59,057 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:59,058 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:59,058 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:05:59,058 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:59,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:59,086 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-02 21:05:59,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:59,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:59,087 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:05:59,097 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 21:05:59,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:59,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:59,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:05:59,117 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-02 21:05:59,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:59,118 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-02 21:05:59,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:05:59,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:05:59,136 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-02 21:05:59,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:05:59,139 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-02 21:05:59,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 21:05:59,172 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-02 21:05:59,177 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-02 21:05:59,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:05:59,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-02-02 21:05:59,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:05:59,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:05:59,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-02-02 21:05:59,178 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-02-02 21:05:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:59,420 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 21:05:59,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:05:59,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-02 21:05:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:59,421 INFO L225 Difference]: With dead ends: 111 [2018-02-02 21:05:59,421 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 21:05:59,421 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-02 21:05:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 21:05:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-02 21:05:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 21:05:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-02-02 21:05:59,426 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2018-02-02 21:05:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:59,427 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-02-02 21:05:59,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:05:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-02-02 21:05:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 21:05:59,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:59,428 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-02 21:05:59,428 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1139004847, now seen corresponding path program 2 times [2018-02-02 21:05:59,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:59,428 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:59,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:59,429 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:59,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:59,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:59,477 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-02 21:05:59,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:05:59,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:05:59,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:05:59,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:05:59,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:05:59,478 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-02-02 21:05:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:59,521 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-02-02 21:05:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:05:59,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-02-02 21:05:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:59,522 INFO L225 Difference]: With dead ends: 68 [2018-02-02 21:05:59,522 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 21:05:59,522 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-02 21:05:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 21:05:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-02 21:05:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 21:05:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-02 21:05:59,526 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 52 [2018-02-02 21:05:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:59,526 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-02 21:05:59,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:05:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-02 21:05:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 21:05:59,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:05:59,528 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-02 21:05:59,528 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-02-02 21:05:59,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2136218585, now seen corresponding path program 3 times [2018-02-02 21:05:59,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:05:59,528 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:05:59,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:59,529 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:05:59,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:05:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:05:59,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:05:59,605 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-02 21:05:59,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:05:59,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:05:59,606 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:05:59,618 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 21:05:59,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:05:59,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:05:59,711 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-02 21:05:59,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:05:59,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-02-02 21:05:59,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:05:59,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:05:59,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:05:59,712 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2018-02-02 21:05:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:05:59,860 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-02-02 21:05:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:05:59,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-02 21:05:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:05:59,860 INFO L225 Difference]: With dead ends: 89 [2018-02-02 21:05:59,860 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 21:05:59,861 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-02 21:05:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 21:05:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 21:05:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 21:05:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 21:05:59,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-02-02 21:05:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:05:59,862 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 21:05:59,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:05:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 21:05:59,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 21:05:59,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:05:59 BoogieIcfgContainer [2018-02-02 21:05:59,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:05:59,866 INFO L168 Benchmark]: Toolchain (without parser) took 2950.57 ms. Allocated memory was 408.4 MB in the beginning and 661.1 MB in the end (delta: 252.7 MB). Free memory was 366.4 MB in the beginning and 549.6 MB in the end (delta: -183.2 MB). Peak memory consumption was 69.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:59,867 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 408.4 MB. Free memory is still 371.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:05:59,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.98 ms. Allocated memory is still 408.4 MB. Free memory was 366.4 MB in the beginning and 358.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:59,868 INFO L168 Benchmark]: Boogie Preprocessor took 23.86 ms. Allocated memory is still 408.4 MB. Free memory was 358.4 MB in the beginning and 355.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:59,868 INFO L168 Benchmark]: RCFGBuilder took 183.67 ms. Allocated memory is still 408.4 MB. Free memory was 355.8 MB in the beginning and 338.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:59,870 INFO L168 Benchmark]: TraceAbstraction took 2577.98 ms. Allocated memory was 408.4 MB in the beginning and 661.1 MB in the end (delta: 252.7 MB). Free memory was 338.3 MB in the beginning and 549.6 MB in the end (delta: -211.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:05:59,871 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 371.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.98 ms. Allocated memory is still 408.4 MB. Free memory was 366.4 MB in the beginning and 358.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.86 ms. Allocated memory is still 408.4 MB. Free memory was 358.4 MB in the beginning and 355.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.67 ms. Allocated memory is still 408.4 MB. Free memory was 355.8 MB in the beginning and 338.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2577.98 ms. Allocated memory was 408.4 MB in the beginning and 661.1 MB in the end (delta: 252.7 MB). Free memory was 338.3 MB in the beginning and 549.6 MB in the end (delta: -211.3 MB). Peak memory consumption was 41.4 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.5s 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.6s 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 92 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s 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-02_21-05-59-876.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-02_21-05-59-876.csv Received shutdown request...