java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:20:51,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:20:51,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:20:51,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:20:51,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:20:51,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:20:51,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:20:51,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:20:51,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:20:51,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:20:51,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:20:51,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:20:51,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:20:51,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:20:51,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:20:51,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:20:51,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:20:51,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:20:51,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:20:51,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:20:51,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:20:51,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:20:51,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:20:51,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:20:51,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:20:51,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:20:51,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:20:51,496 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:20:51,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:20:51,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:20:51,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:20:51,497 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:20:51,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:20:51,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:20:51,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:20:51,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:20:51,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:20:51,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:20:51,507 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:20:51,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:20:51,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:20:51,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:20:51,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:20:51,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:20:51,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:20:51,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:20:51,509 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:20:51,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:20:51,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:20:51,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:20:51,510 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:20:51,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:20:51,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:20:51,510 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:20:51,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:20:51,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:20:51,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:20:51,511 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:20:51,512 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:20:51,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:20:51,553 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:20:51,557 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:20:51,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:20:51,558 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:20:51,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-24 13:20:51,658 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:20:51,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:20:51,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:51,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:20:51,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:20:51,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671819ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51, skipping insertion in model container [2018-01-24 13:20:51,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,686 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:51,699 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:51,810 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:51,825 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:51,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51 WrapperNode [2018-01-24 13:20:51,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:51,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:20:51,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:20:51,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:20:51,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... [2018-01-24 13:20:51,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:20:51,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:20:51,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:20:51,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:20:51,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:20:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:20:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:20:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:20:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:20:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:20:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:20:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:20:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:20:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:20:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:20:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:20:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:20:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:20:52,081 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:20:52,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:52 BoogieIcfgContainer [2018-01-24 13:20:52,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:20:52,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:20:52,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:20:52,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:20:52,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:20:51" (1/3) ... [2018-01-24 13:20:52,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a41bda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:52, skipping insertion in model container [2018-01-24 13:20:52,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:51" (2/3) ... [2018-01-24 13:20:52,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a41bda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:52, skipping insertion in model container [2018-01-24 13:20:52,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:52" (3/3) ... [2018-01-24 13:20:52,088 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-24 13:20:52,094 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:20:52,099 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 13:20:52,144 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:20:52,145 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:20:52,145 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:20:52,145 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:20:52,145 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:20:52,145 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:20:52,145 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:20:52,146 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:20:52,146 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:20:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 13:20:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 13:20:52,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:52,175 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:52,175 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 13:20:52,183 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:52,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:52,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:52,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:52,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:52,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:52,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:52,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:20:52,381 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:52,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:20:52,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:20:52,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:52,398 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 13:20:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:52,479 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 13:20:52,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:20:52,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 13:20:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:52,489 INFO L225 Difference]: With dead ends: 101 [2018-01-24 13:20:52,489 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 13:20:52,491 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 13:20:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 13:20:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 13:20:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 13:20:52,586 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 13:20:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:52,586 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 13:20:52,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:20:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 13:20:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:20:52,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:52,587 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:52,587 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 13:20:52,588 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:52,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:52,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:52,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:52,589 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:52,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:52,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:52,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:20:52,698 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:52,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:52,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:52,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:52,700 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 13:20:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:52,879 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-24 13:20:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:52,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 13:20:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:52,883 INFO L225 Difference]: With dead ends: 129 [2018-01-24 13:20:52,883 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 13:20:52,885 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 13:20:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-01-24 13:20:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 13:20:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-01-24 13:20:52,893 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-01-24 13:20:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:52,893 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-01-24 13:20:52,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-01-24 13:20:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:20:52,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:52,894 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:52,894 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 13:20:52,895 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:52,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:52,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:52,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:52,896 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:52,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:52,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:52,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:20:52,994 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:52,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:52,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:52,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:52,995 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2018-01-24 13:20:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:53,112 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-24 13:20:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:53,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:20:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:53,114 INFO L225 Difference]: With dead ends: 77 [2018-01-24 13:20:53,114 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 13:20:53,114 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-24 13:20:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 13:20:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-01-24 13:20:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 13:20:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-01-24 13:20:53,123 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 17 [2018-01-24 13:20:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:53,123 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-01-24 13:20:53,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-01-24 13:20:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:20:53,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:53,124 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:53,124 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 13:20:53,124 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:53,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:53,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:53,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:20:53,161 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:53,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:53,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:53,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:53,162 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2018-01-24 13:20:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:53,208 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 13:20:53,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:53,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:20:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:53,210 INFO L225 Difference]: With dead ends: 68 [2018-01-24 13:20:53,210 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 13:20:53,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-24 13:20:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 13:20:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 13:20:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 13:20:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-24 13:20:53,254 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 17 [2018-01-24 13:20:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:53,254 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-24 13:20:53,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-24 13:20:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:20:53,255 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:53,256 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:53,256 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 13:20:53,256 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:53,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,257 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:53,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:53,354 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:53,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,363 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:53,466 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:53,541 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:53,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 14 [2018-01-24 13:20:53,541 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:53,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:53,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:53,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:20:53,542 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-24 13:20:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:53,623 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-24 13:20:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:53,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 13:20:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:53,624 INFO L225 Difference]: With dead ends: 124 [2018-01-24 13:20:53,625 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:20:53,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:20:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:20:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2018-01-24 13:20:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 13:20:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 13:20:53,634 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 22 [2018-01-24 13:20:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:53,634 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 13:20:53,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 13:20:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:20:53,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:53,636 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:53,636 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-01-24 13:20:53,636 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:53,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:53,699 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:53,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,704 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,734 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,786 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:53,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2018-01-24 13:20:53,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:53,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:53,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:53,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:53,787 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2018-01-24 13:20:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:53,835 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 13:20:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:53,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 13:20:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:53,836 INFO L225 Difference]: With dead ends: 76 [2018-01-24 13:20:53,837 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 13:20:53,837 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 13:20:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2018-01-24 13:20:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 13:20:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-24 13:20:53,845 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 29 [2018-01-24 13:20:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:53,845 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-24 13:20:53,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-24 13:20:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 13:20:53,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:53,846 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:53,846 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-01-24 13:20:53,847 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:53,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:53,848 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:53,893 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:20:53,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,898 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,926 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:53,960 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:53,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:53,963 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:53,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:53,995 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:20:54,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:54,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-24 13:20:54,014 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:54,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:54,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:54,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:54,015 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2018-01-24 13:20:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:54,119 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-01-24 13:20:54,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:20:54,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 13:20:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:54,120 INFO L225 Difference]: With dead ends: 104 [2018-01-24 13:20:54,120 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 13:20:54,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 13:20:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2018-01-24 13:20:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 13:20:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-24 13:20:54,130 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 37 [2018-01-24 13:20:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:54,130 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-24 13:20:54,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-24 13:20:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 13:20:54,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:54,132 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:54,132 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 1 times [2018-01-24 13:20:54,133 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:54,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:54,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:54,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:54,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:54,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:20:54,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:54,279 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 13:20:54,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:54,288 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:54,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:20:54,371 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:20:54,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:54,414 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:54,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:54,418 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:54,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:20:54,453 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 13:20:54,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:54,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3, 3, 3] total 12 [2018-01-24 13:20:54,464 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:54,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:20:54,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:20:54,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:20:54,465 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 11 states. [2018-01-24 13:20:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:54,644 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 13:20:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:20:54,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-01-24 13:20:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:54,645 INFO L225 Difference]: With dead ends: 91 [2018-01-24 13:20:54,645 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 13:20:54,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:20:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 13:20:54,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-24 13:20:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 13:20:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-24 13:20:54,655 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2018-01-24 13:20:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:54,655 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-24 13:20:54,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:20:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-24 13:20:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:20:54,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:54,657 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:54,658 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1556698143, now seen corresponding path program 1 times [2018-01-24 13:20:54,658 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:54,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:54,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:54,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:54,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:54,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:20:54,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:54,881 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:54,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:54,887 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:54,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:54,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:54,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:54,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:54,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:54,997 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:55,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:55,094 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:55,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:55,098 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:55,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:55,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:20:55,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:55,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:55,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:55,167 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:55,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:55,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 16 [2018-01-24 13:20:55,202 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:55,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:20:55,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:20:55,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:20:55,204 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 13 states. [2018-01-24 13:20:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:55,517 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-24 13:20:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:20:55,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-01-24 13:20:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:55,518 INFO L225 Difference]: With dead ends: 89 [2018-01-24 13:20:55,518 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 13:20:55,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:20:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 13:20:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-01-24 13:20:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 13:20:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 13:20:55,523 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 41 [2018-01-24 13:20:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:55,524 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 13:20:55,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:20:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 13:20:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 13:20:55,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:55,525 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2018-01-24 13:20:55,525 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-01-24 13:20:55,525 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:55,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:55,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:55,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:55,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:55,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:20:55,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:55,594 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:20:55,607 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:55,607 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:55,618 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:55,619 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:55,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:55,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:55,641 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-01-24 13:20:55,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:55,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:20:55,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:55,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:55,666 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-01-24 13:20:55,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:55,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:20:55,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:55,684 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 13:20:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:55,691 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:55,711 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_13| Int)) (or (not (= (select |c_#valid| |v_main_~#mask~3.base_13|) 0)) (= (store |c_#valid| |v_main_~#mask~3.base_13| 0) |c_old(#valid)|))) is different from false [2018-01-24 13:20:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 13:20:55,760 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:55,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-01-24 13:20:55,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:55,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:55,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:55,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2018-01-24 13:20:55,761 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-01-24 13:20:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:55,842 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 13:20:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:55,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-24 13:20:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:55,842 INFO L225 Difference]: With dead ends: 66 [2018-01-24 13:20:55,843 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 13:20:55,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2018-01-24 13:20:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 13:20:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 13:20:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 13:20:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 13:20:55,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-24 13:20:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:55,844 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 13:20:55,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 13:20:55,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 13:20:55,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 13:20:56,154 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 67 DAG size of output 46 [2018-01-24 13:20:56,281 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-24 13:20:56,281 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:56,281 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-24 13:20:56,281 INFO L401 ceAbstractionStarter]: For program point L17''''(lines 17 19) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 14 21) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 14 21) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L397 ceAbstractionStarter]: At program point L17'''(lines 17 19) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse6 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse5 (= foo_~i~1 0)) (.cse7 (not (= 32 (select |#length| |foo_#in~b.base|))))) (and (or (< 31 |foo_#in~size|) .cse0 (let ((.cse1 (= 1 (select |#valid| foo_~b.base))) (.cse2 (select |#length| foo_~b.base)) (.cse3 (<= foo_~size 31)) (.cse4 (= foo_~b.offset 0))) (or (and .cse1 (= 32 .cse2) .cse3 .cse4 .cse5) (and (and .cse1 (<= 1 foo_~i~1)) (= .cse2 32) .cse3 .cse4))) .cse6 .cse7) (or .cse0 (and (<= foo_~size 0) (= 1 foo_~i~1)) .cse6 (not (= 0 |foo_#in~size|)) (and (= foo_~size 0) .cse5) .cse7))) [2018-01-24 13:20:56,282 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 14 21) the Hoare annotation is: true [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point L17''(lines 17 19) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 18) no Hoare annotation was computed. [2018-01-24 13:20:56,282 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 23 35) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 (<= main_~i~3 31)) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 13:20:56,283 INFO L401 ceAbstractionStarter]: For program point L25'(line 25) no Hoare annotation was computed. [2018-01-24 13:20:56,283 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L26''''(lines 26 28) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L25''(line 25) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 23 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:56,284 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:56,285 INFO L401 ceAbstractionStarter]: For program point L26''(lines 26 28) no Hoare annotation was computed. [2018-01-24 13:20:56,285 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 13:20:56,285 INFO L397 ceAbstractionStarter]: At program point L26'''(lines 26 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 13:20:56,285 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 13:20:56,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,304 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,304 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:20:56 BoogieIcfgContainer [2018-01-24 13:20:56,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:20:56,307 INFO L168 Benchmark]: Toolchain (without parser) took 4647.69 ms. Allocated memory was 304.6 MB in the beginning and 515.9 MB in the end (delta: 211.3 MB). Free memory was 265.5 MB in the beginning and 409.7 MB in the end (delta: -144.2 MB). Peak memory consumption was 161.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:56,308 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:20:56,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.33 ms. Allocated memory is still 304.6 MB. Free memory was 264.5 MB in the beginning and 256.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:56,308 INFO L168 Benchmark]: Boogie Preprocessor took 30.14 ms. Allocated memory is still 304.6 MB. Free memory was 256.5 MB in the beginning and 254.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:56,309 INFO L168 Benchmark]: RCFGBuilder took 218.53 ms. Allocated memory is still 304.6 MB. Free memory was 254.4 MB in the beginning and 239.2 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:56,309 INFO L168 Benchmark]: TraceAbstraction took 4223.25 ms. Allocated memory was 304.6 MB in the beginning and 515.9 MB in the end (delta: 211.3 MB). Free memory was 238.2 MB in the beginning and 409.7 MB in the end (delta: -171.5 MB). Peak memory consumption was 134.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:56,311 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 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.33 ms. Allocated memory is still 304.6 MB. Free memory was 264.5 MB in the beginning and 256.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.14 ms. Allocated memory is still 304.6 MB. Free memory was 256.5 MB in the beginning and 254.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 218.53 ms. Allocated memory is still 304.6 MB. Free memory was 254.4 MB in the beginning and 239.2 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4223.25 ms. Allocated memory was 304.6 MB in the beginning and 515.9 MB in the end (delta: 211.3 MB). Free memory was 238.2 MB in the beginning and 409.7 MB in the end (delta: -171.5 MB). Peak memory consumption was 134.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2018-01-24 13:20:56,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,319 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((31 < \old(size) || !(0 == b)) || ((((1 == \valid[b] && 32 == unknown-#length-unknown[b]) && size <= 31) && b == 0) && i == 0) || ((((1 == \valid[b] && 1 <= i) && unknown-#length-unknown[b] == 32) && size <= 31) && b == 0)) || !(\valid[b] == 1)) || !(32 == unknown-#length-unknown[b])) && (((((!(0 == b) || (size <= 0 && 1 == i)) || !(\valid[b] == 1)) || !(0 == \old(size))) || (size == 0 && i == 0)) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 13:20:56,320 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 26]: Loop Invariant [2018-01-24 13:20:56,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:56,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 4.1s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 358 SDtfs, 532 SDslu, 830 SDs, 0 SdLazy, 633 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 733 GetRequests, 638 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 124 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 252 HoareAnnotationTreeSize, 17 FomulaSimplifications, 301 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 506 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 615 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 923 ConstructedInterpolants, 46 QuantifiedInterpolants, 133687 SizeOfPredicates, 12 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 286/344 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-20-56-330.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-20-56-330.csv Received shutdown request...