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_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:36:31,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:36:31,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:36:31,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:36:31,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:36:31,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:36:31,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:36:31,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:36:31,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:36:31,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:36:31,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:36:31,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:36:31,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:36:31,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:36:31,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:36:31,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:36:31,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:36:31,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:36:31,439 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:36:31,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:36:31,442 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:36:31,442 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:36:31,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:36:31,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:36:31,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:36:31,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:36:31,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:36:31,445 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:36:31,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:36:31,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:36:31,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:36:31,446 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:36:31,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:36:31,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:36:31,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:36:31,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:36:31,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:36:31,458 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:36:31,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:36:31,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:36:31,459 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:36:31,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:36:31,459 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:36:31,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:36:31,496 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:36:31,498 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:36:31,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:36:31,500 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:36:31,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-02-04 13:36:31,603 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:36:31,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:36:31,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:36:31,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:36:31,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:36:31,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69de7289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31, skipping insertion in model container [2018-02-04 13:36:31,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,629 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:36:31,642 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:36:31,720 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:36:31,732 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:36:31,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31 WrapperNode [2018-02-04 13:36:31,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:36:31,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:36:31,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:36:31,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:36:31,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (1/1) ... [2018-02-04 13:36:31,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:36:31,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:36:31,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:36:31,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:36:31,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (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 13:36:31,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:36:31,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:36:31,793 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 13:36:31,793 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:36:31,793 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:36:31,793 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:36:31,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:36:31,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:36:31,794 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:36:31,794 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 13:36:31,794 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:36:31,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:36:31,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:36:31,930 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:36:31,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:36:31 BoogieIcfgContainer [2018-02-04 13:36:31,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:36:31,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:36:31,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:36:31,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:36:31,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:36:31" (1/3) ... [2018-02-04 13:36:31,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c1622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:36:31, skipping insertion in model container [2018-02-04 13:36:31,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:36:31" (2/3) ... [2018-02-04 13:36:31,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c1622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:36:31, skipping insertion in model container [2018-02-04 13:36:31,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:36:31" (3/3) ... [2018-02-04 13:36:31,936 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-02-04 13:36:31,944 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:36:31,952 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-02-04 13:36:31,982 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:36:31,982 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:36:31,982 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:36:31,982 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:36:31,982 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:36:31,982 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:36:31,982 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:36:31,983 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:36:31,983 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:36:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-04 13:36:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 13:36:32,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,005 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,005 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-02-04 13:36:32,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,053 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,108 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 13:36:32,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:32,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:36:32,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 13:36:32,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 13:36:32,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 13:36:32,122 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-02-04 13:36:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:32,133 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-04 13:36:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 13:36:32,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 13:36:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:32,140 INFO L225 Difference]: With dead ends: 49 [2018-02-04 13:36:32,140 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 13:36:32,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 13:36:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 13:36:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 13:36:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 13:36:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 13:36:32,164 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-02-04 13:36:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:32,165 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 13:36:32,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 13:36:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 13:36:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:36:32,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,165 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,165 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-02-04 13:36:32,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,167 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,200 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 13:36:32,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:32,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:36:32,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:36:32,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:36:32,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:36:32,202 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-02-04 13:36:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:32,248 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 13:36:32,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:36:32,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 13:36:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:32,250 INFO L225 Difference]: With dead ends: 67 [2018-02-04 13:36:32,250 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 13:36:32,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:36:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 13:36:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-02-04 13:36:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 13:36:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 13:36:32,302 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-02-04 13:36:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:32,302 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 13:36:32,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:36:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 13:36:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:36:32,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,303 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-02-04 13:36:32,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,372 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 13:36:32,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:32,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:36:32,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:36:32,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:36:32,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:36:32,374 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-02-04 13:36:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:32,476 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-02-04 13:36:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:36:32,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 13:36:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:32,477 INFO L225 Difference]: With dead ends: 73 [2018-02-04 13:36:32,477 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 13:36:32,477 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 13:36:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 13:36:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-02-04 13:36:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 13:36:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 13:36:32,483 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-02-04 13:36:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:32,483 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 13:36:32,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:36:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 13:36:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:36:32,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,484 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,484 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-02-04 13:36:32,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,527 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 13:36:32,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:32,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:36:32,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:36:32,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:36:32,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:36:32,529 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-02-04 13:36:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:32,545 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 13:36:32,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:36:32,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-02-04 13:36:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:32,547 INFO L225 Difference]: With dead ends: 55 [2018-02-04 13:36:32,547 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 13:36:32,548 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 13:36:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 13:36:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 13:36:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 13:36:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 13:36:32,552 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-02-04 13:36:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:32,553 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 13:36:32,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:36:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 13:36:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 13:36:32,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,553 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,554 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-02-04 13:36:32,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,625 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 13:36:32,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:32,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:36:32,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:36:32,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:36:32,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:36:32,626 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-02-04 13:36:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:32,691 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 13:36:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:36:32,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 13:36:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:32,693 INFO L225 Difference]: With dead ends: 65 [2018-02-04 13:36:32,693 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 13:36:32,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:36:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 13:36:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-02-04 13:36:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 13:36:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 13:36:32,697 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-02-04 13:36:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:32,698 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 13:36:32,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:36:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 13:36:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:36:32,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,699 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,699 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-02-04 13:36:32,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:36:32,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:32,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:36:32,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:36:32,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:36:32,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:36:32,754 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-02-04 13:36:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:32,795 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 13:36:32,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:36:32,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 13:36:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:32,796 INFO L225 Difference]: With dead ends: 69 [2018-02-04 13:36:32,796 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 13:36:32,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:36:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 13:36:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-02-04 13:36:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 13:36:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 13:36:32,801 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-02-04 13:36:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:32,801 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 13:36:32,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:36:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 13:36:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:36:32,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:32,802 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:32,802 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-02-04 13:36:32,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:32,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:32,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:32,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:36:32,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:36:32,925 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-02-04 13:36:32,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:36:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:32,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:32,998 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 13:36:33,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:36:33,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:36:33,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:36:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:36:33,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:36:33,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-02-04 13:36:33,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:36:33,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:36:33,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:36:33,074 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 11 states. [2018-02-04 13:36:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:33,232 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-04 13:36:33,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:36:33,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 13:36:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:33,233 INFO L225 Difference]: With dead ends: 74 [2018-02-04 13:36:33,233 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 13:36:33,233 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:36:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 13:36:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-02-04 13:36:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 13:36:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 13:36:33,236 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-02-04 13:36:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:33,236 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 13:36:33,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:36:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 13:36:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:36:33,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:33,237 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:33,237 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-02-04 13:36:33,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:33,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:33,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:36:33,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:33,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:36:33,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:36:33,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:36:33,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:36:33,279 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-02-04 13:36:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:33,316 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 13:36:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:36:33,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-04 13:36:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:33,317 INFO L225 Difference]: With dead ends: 59 [2018-02-04 13:36:33,317 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 13:36:33,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:36:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 13:36:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 13:36:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 13:36:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-04 13:36:33,321 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-02-04 13:36:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:33,321 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-04 13:36:33,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:36:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-04 13:36:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:36:33,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:33,322 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:33,322 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-02-04 13:36:33,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:33,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:33,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:36:33,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:36:33,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:36:33,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:36:33,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:36:33,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:36:33,423 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-02-04 13:36:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:33,486 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 13:36:33,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:36:33,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 13:36:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:33,487 INFO L225 Difference]: With dead ends: 64 [2018-02-04 13:36:33,487 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 13:36:33,487 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:36:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 13:36:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-02-04 13:36:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:36:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 13:36:33,493 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-02-04 13:36:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:33,494 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 13:36:33,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:36:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 13:36:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:36:33,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:33,495 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:33,495 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-02-04 13:36:33,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:33,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:33,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:33,535 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 13:36:33,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:36:33,535 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:36:33,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:33,567 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 13:36:33,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:36:33,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-04 13:36:33,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:36:33,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:36:33,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:36:33,598 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-02-04 13:36:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:33,632 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-02-04 13:36:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:36:33,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 13:36:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:33,633 INFO L225 Difference]: With dead ends: 83 [2018-02-04 13:36:33,633 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 13:36:33,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:36:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 13:36:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-02-04 13:36:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 13:36:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 13:36:33,635 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-04 13:36:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:33,636 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 13:36:33,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:36:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 13:36:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:36:33,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:33,636 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:33,636 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-02-04 13:36:33,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:33,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:33,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:36:33,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:36:33,683 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:36:33,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:36:33,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:36:33,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-02-04 13:36:33,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:36:33,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:36:33,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:36:33,782 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 11 states. [2018-02-04 13:36:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:33,904 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-04 13:36:33,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:36:33,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-04 13:36:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:33,905 INFO L225 Difference]: With dead ends: 98 [2018-02-04 13:36:33,905 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 13:36:33,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:36:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 13:36:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2018-02-04 13:36:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:36:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-02-04 13:36:33,908 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-02-04 13:36:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:33,908 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-02-04 13:36:33,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:36:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-02-04 13:36:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 13:36:33,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:33,909 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:33,909 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-02-04 13:36:33,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:33,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:33,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:36:33,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:33,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 13:36:33,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:36:33,977 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:36:33,989 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:36:34,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 13:36:34,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:36:34,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:34,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:36:34,030 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 13:36:34,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:36:34,033 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 13:36:34,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 13:36:34,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:36:34,075 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 13:36:34,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:36:34,076 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 13:36:34,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 13:36:34,095 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (store |c_old(#valid)| |main_~#b~0.base| 0) |c_#valid|))) is different from true [2018-02-04 13:36:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 13:36:34,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:36:34,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-02-04 13:36:34,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:36:34,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:36:34,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-02-04 13:36:34,116 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 9 states. [2018-02-04 13:36:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:34,250 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-04 13:36:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:36:34,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 13:36:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:34,252 INFO L225 Difference]: With dead ends: 109 [2018-02-04 13:36:34,252 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 13:36:34,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 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 13:36:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 13:36:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-02-04 13:36:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 13:36:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 13:36:34,256 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2018-02-04 13:36:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:34,256 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 13:36:34,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:36:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 13:36:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:36:34,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:34,257 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:34,257 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-02-04 13:36:34,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:34,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:34,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:34,258 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:36:34,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:34,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:36:34,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:36:34,340 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:36:34,350 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:36:34,367 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:36:34,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:36:34,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:36:34,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:36:34,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2018-02-04 13:36:34,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:36:34,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:36:34,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:36:34,435 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 14 states. [2018-02-04 13:36:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:34,614 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-02-04 13:36:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:36:34,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-04 13:36:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:34,615 INFO L225 Difference]: With dead ends: 70 [2018-02-04 13:36:34,616 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 13:36:34,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:36:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 13:36:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-02-04 13:36:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 13:36:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-04 13:36:34,620 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 47 [2018-02-04 13:36:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:34,620 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-04 13:36:34,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:36:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-04 13:36:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 13:36:34,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:36:34,624 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:36:34,624 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 13:36:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-02-04 13:36:34,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:36:34,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:36:34,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:34,627 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:36:34,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:36:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:36:34,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:36:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 13:36:34,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:36:34,687 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:36:34,693 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:36:34,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 13:36:34,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:36:34,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:36:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 13:36:34,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:36:34,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-02-04 13:36:34,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:36:34,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:36:34,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:36:34,734 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 7 states. [2018-02-04 13:36:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:36:34,776 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-02-04 13:36:34,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:36:34,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-02-04 13:36:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:36:34,777 INFO L225 Difference]: With dead ends: 59 [2018-02-04 13:36:34,777 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 13:36:34,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:36:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 13:36:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 13:36:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 13:36:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 13:36:34,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-02-04 13:36:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:36:34,778 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 13:36:34,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:36:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 13:36:34,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 13:36:34,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:36:34 BoogieIcfgContainer [2018-02-04 13:36:34,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:36:34,781 INFO L168 Benchmark]: Toolchain (without parser) took 3178.33 ms. Allocated memory was 402.1 MB in the beginning and 660.1 MB in the end (delta: 257.9 MB). Free memory was 360.1 MB in the beginning and 523.4 MB in the end (delta: -163.4 MB). Peak memory consumption was 94.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:34,782 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:36:34,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.65 ms. Allocated memory is still 402.1 MB. Free memory was 360.1 MB in the beginning and 352.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:34,782 INFO L168 Benchmark]: Boogie Preprocessor took 21.26 ms. Allocated memory is still 402.1 MB. Free memory was 352.0 MB in the beginning and 350.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:34,783 INFO L168 Benchmark]: RCFGBuilder took 172.95 ms. Allocated memory is still 402.1 MB. Free memory was 350.6 MB in the beginning and 332.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:34,783 INFO L168 Benchmark]: TraceAbstraction took 2849.53 ms. Allocated memory was 402.1 MB in the beginning and 660.1 MB in the end (delta: 257.9 MB). Free memory was 332.1 MB in the beginning and 523.4 MB in the end (delta: -191.3 MB). Peak memory consumption was 66.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:36:34,784 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.11 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 131.65 ms. Allocated memory is still 402.1 MB. Free memory was 360.1 MB in the beginning and 352.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.26 ms. Allocated memory is still 402.1 MB. Free memory was 352.0 MB in the beginning and 350.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.95 ms. Allocated memory is still 402.1 MB. Free memory was 350.6 MB in the beginning and 332.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2849.53 ms. Allocated memory was 402.1 MB in the beginning and 660.1 MB in the end (delta: 257.9 MB). Free memory was 332.1 MB in the beginning and 523.4 MB in the end (delta: -191.3 MB). Peak memory consumption was 66.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 2.8s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 471 SDtfs, 645 SDslu, 958 SDs, 0 SdLazy, 899 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 244 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 128 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 649 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 629 ConstructedInterpolants, 20 QuantifiedInterpolants, 72655 SizeOfPredicates, 13 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 217/249 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-36-34-788.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-36-34-788.csv Received shutdown request...