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/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:20:36,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:20:36,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:20:36,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:20:36,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:20:36,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:20:36,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:20:36,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:20:36,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:20:36,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:20:36,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:20:36,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:20:36,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:20:36,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:20:36,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:20:36,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:20:36,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:20:36,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:20:36,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:20:36,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:20:36,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:20:36,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:20:36,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:20:36,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:20:36,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:20:36,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:20:36,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:20:36,340 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:20:36,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:20:36,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:20:36,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:20:36,341 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:36,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:20:36,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:20:36,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:20:36,351 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:20:36,351 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:20:36,351 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:20:36,351 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:20:36,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:20:36,352 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:20:36,352 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:20:36,352 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:20:36,352 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:20:36,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:20:36,353 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:20:36,353 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:20:36,353 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:20:36,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:20:36,353 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:20:36,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:20:36,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:20:36,354 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:20:36,354 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:20:36,354 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:20:36,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:20:36,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:20:36,355 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:20:36,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:20:36,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:20:36,355 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:20:36,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:20:36,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:20:36,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:20:36,356 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:20:36,357 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:20:36,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:20:36,400 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:20:36,403 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:20:36,404 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:20:36,405 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:20:36,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-24 13:20:36,512 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:20:36,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:20:36,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:36,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:20:36,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:20:36,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:36" (1/1) ... [2018-01-24 13:20:36,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a5aa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:36, skipping insertion in model container [2018-01-24 13:20:36,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:36" (1/1) ... [2018-01-24 13:20:36,539 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:36,553 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:36,668 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:36,685 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:36,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:36 WrapperNode [2018-01-24 13:20:36,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:36,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:20:36,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:20:36,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:20:36,704 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:36" (1/1) ... [2018-01-24 13:20:36,704 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:36" (1/1) ... [2018-01-24 13:20:36,713 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:36" (1/1) ... [2018-01-24 13:20:36,713 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:36" (1/1) ... [2018-01-24 13:20:36,716 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:36" (1/1) ... [2018-01-24 13:20:36,720 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:36" (1/1) ... [2018-01-24 13:20:36,722 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:36" (1/1) ... [2018-01-24 13:20:36,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:20:36,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:20:36,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:20:36,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:20:36,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:36" (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:36,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:20:36,771 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:20:36,771 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:20:36,771 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:20:36,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:20:36,771 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:20:36,772 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:20:36,947 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:20:36,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:36 BoogieIcfgContainer [2018-01-24 13:20:36,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:20:36,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:20:36,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:20:36,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:20:36,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:20:36" (1/3) ... [2018-01-24 13:20:36,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144c967b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:36, skipping insertion in model container [2018-01-24 13:20:36,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:36" (2/3) ... [2018-01-24 13:20:36,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144c967b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:36, skipping insertion in model container [2018-01-24 13:20:36,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:36" (3/3) ... [2018-01-24 13:20:36,953 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-01-24 13:20:36,960 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:20:36,967 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 13:20:37,011 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:20:37,011 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:20:37,011 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:20:37,011 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:20:37,012 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:20:37,012 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:20:37,012 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:20:37,012 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:20:37,013 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:20:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 13:20:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 13:20:37,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:37,041 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:37,041 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 13:20:37,048 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:37,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:37,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:37,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:37,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:37,147 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:37,217 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:37,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:37,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:20:37,220 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:37,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:20:37,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:20:37,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:37,239 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 13:20:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:37,333 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 13:20:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:20:37,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 13:20:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:37,345 INFO L225 Difference]: With dead ends: 101 [2018-01-24 13:20:37,345 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 13:20:37,348 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:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 13:20:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 13:20:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 13:20:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 13:20:37,443 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 13:20:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:37,444 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 13:20:37,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:20:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 13:20:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:20:37,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:37,445 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:37,445 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 13:20:37,445 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:37,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:37,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:37,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:37,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:37,464 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:37,541 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:37,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:37,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:20:37,542 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:37,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:37,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:37,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:37,544 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 13:20:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:37,686 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-01-24 13:20:37,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:20:37,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 13:20:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:37,689 INFO L225 Difference]: With dead ends: 95 [2018-01-24 13:20:37,689 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 13:20:37,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 13:20:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-24 13:20:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 13:20:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 13:20:37,698 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 16 [2018-01-24 13:20:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:37,698 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 13:20:37,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 13:20:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:20:37,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:37,700 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:37,700 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 13:20:37,700 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:37,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:37,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:37,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:37,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:37,715 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:37,832 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:37,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:37,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:20:37,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:37,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:37,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:37,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:37,868 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 6 states. [2018-01-24 13:20:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:37,988 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 13:20:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:20:37,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 13:20:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:37,990 INFO L225 Difference]: With dead ends: 57 [2018-01-24 13:20:37,990 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 13:20:37,990 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 13:20:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-24 13:20:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 13:20:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-24 13:20:37,998 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-01-24 13:20:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:37,999 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-24 13:20:37,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-24 13:20:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:20:38,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:38,000 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:38,000 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 13:20:38,000 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:38,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:38,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:38,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:38,002 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:38,009 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:38,038 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:38,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:38,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:20:38,039 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:38,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:38,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:38,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:38,039 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-01-24 13:20:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:38,102 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-01-24 13:20:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:38,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 13:20:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:38,104 INFO L225 Difference]: With dead ends: 53 [2018-01-24 13:20:38,104 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 13:20:38,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:20:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 13:20:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 13:20:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 13:20:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 13:20:38,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 17 [2018-01-24 13:20:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:38,113 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 13:20:38,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 13:20:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:20:38,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:38,114 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:38,114 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 13:20:38,115 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:38,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:38,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:38,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:38,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:38,128 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:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:38,251 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:38,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:38,264 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:38,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,325 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:38,418 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:38,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:38,422 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:38,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,453 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:38,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3, 3, 3] total 12 [2018-01-24 13:20:38,463 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:38,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:20:38,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:20:38,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:20:38,464 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 11 states. [2018-01-24 13:20:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:38,640 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 13:20:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:20:38,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 13:20:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:38,641 INFO L225 Difference]: With dead ends: 103 [2018-01-24 13:20:38,641 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 13:20:38,642 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:20:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 13:20:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-01-24 13:20:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 13:20:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 13:20:38,651 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2018-01-24 13:20:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:38,652 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 13:20:38,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:20:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 13:20:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:20:38,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:38,653 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] [2018-01-24 13:20:38,653 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash 180123030, now seen corresponding path program 1 times [2018-01-24 13:20:38,654 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:38,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:38,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:38,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:38,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:38,668 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:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:38,883 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:38,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:38,889 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:38,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:38,929 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:38,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:38,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:38,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:38,977 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:39,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:39,132 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:39,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:39,138 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:39,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:39,162 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:39,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:39,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:39,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:39,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:39,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:39,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:39,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 6] total 16 [2018-01-24 13:20:39,206 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:39,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:20:39,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:20:39,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:20:39,207 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 12 states. [2018-01-24 13:20:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:39,422 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 13:20:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:20:39,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-01-24 13:20:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:39,423 INFO L225 Difference]: With dead ends: 61 [2018-01-24 13:20:39,423 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 13:20:39,423 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:20:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 13:20:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 13:20:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 13:20:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-24 13:20:39,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 23 [2018-01-24 13:20:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:39,430 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-24 13:20:39,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:20:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-24 13:20:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:20:39,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:39,432 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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:39,432 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:39,432 INFO L82 PathProgramCache]: Analyzing trace with hash 687601263, now seen corresponding path program 1 times [2018-01-24 13:20:39,432 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:39,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:39,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:39,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:39,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:39,448 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:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:39,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:39,565 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:39,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:39,572 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:39,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:39,669 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:39,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:39,783 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:39,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:39,786 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:39,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 13:20:39,838 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 13:20:39,868 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-24 13:20:39,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 22 [2018-01-24 13:20:39,869 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:39,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:39,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:39,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:20:39,870 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2018-01-24 13:20:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:39,902 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-24 13:20:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:39,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-24 13:20:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:39,903 INFO L225 Difference]: With dead ends: 72 [2018-01-24 13:20:39,903 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 13:20:39,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:20:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 13:20:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-01-24 13:20:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 13:20:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 13:20:39,909 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 41 [2018-01-24 13:20:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:39,910 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 13:20:39,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 13:20:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 13:20:39,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:39,911 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-01-24 13:20:39,911 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1072164206, now seen corresponding path program 1 times [2018-01-24 13:20:39,911 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:39,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:39,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:39,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:39,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:39,924 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:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:40,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:40,098 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:40,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:40,112 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:40,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:40,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:40,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:40,397 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:40,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:40,405 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:40,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 13:20:40,490 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 13:20:40,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:40,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 4, 4] total 21 [2018-01-24 13:20:40,523 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:40,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:20:40,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:20:40,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:20:40,524 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 12 states. [2018-01-24 13:20:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:40,652 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-01-24 13:20:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:20:40,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-01-24 13:20:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:40,653 INFO L225 Difference]: With dead ends: 115 [2018-01-24 13:20:40,653 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 13:20:40,654 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:20:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 13:20:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-01-24 13:20:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 13:20:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-24 13:20:40,662 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 49 [2018-01-24 13:20:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:40,663 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-24 13:20:40,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:20:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-24 13:20:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 13:20:40,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:40,664 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2018-01-24 13:20:40,664 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 13:20:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1829333686, now seen corresponding path program 2 times [2018-01-24 13:20:40,665 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:40,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:40,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:40,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:40,666 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:40,679 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:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:40,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:40,827 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:40,835 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:40,836 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:40,844 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:40,845 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:40,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:40,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:40,870 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:40,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:40,872 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:40,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:40,926 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:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 13:20:40,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:40,965 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_12| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_~#mask~3.base_12| 0)) (not (= (select |c_#valid| |v_main_~#mask~3.base_12|) 0)))) is different from false [2018-01-24 13:20:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 13:20:41,009 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:41,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [8] total 14 [2018-01-24 13:20:41,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:41,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:41,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:41,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2018-01-24 13:20:41,011 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-01-24 13:20:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:41,090 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-01-24 13:20:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:41,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-24 13:20:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:41,091 INFO L225 Difference]: With dead ends: 63 [2018-01-24 13:20:41,091 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 13:20:41,092 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=144, Unknown=2, NotChecked=50, Total=240 [2018-01-24 13:20:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 13:20:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 13:20:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 13:20:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 13:20:41,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-01-24 13:20:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:41,093 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 13:20:41,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 13:20:41,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 13:20:41,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 13:20:41,407 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 50 DAG size of output 34 [2018-01-24 13:20:41,446 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:41,446 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:41,446 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:41,446 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 13:20:41,446 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 13:20:41,446 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 13:20:41,446 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 13:20:41,446 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse2 (= foo_~size 32)) (.cse1 (select |#length| foo_~b.base)) (.cse0 (= 1 (select |#valid| foo_~b.base))) (.cse3 (= foo_~b.offset 0))) (or (not (= 0 |foo_#in~b.offset|)) (and .cse0 (= .cse1 32) .cse2 .cse3 (<= 1 foo_~i~1)) (not (= (select |#valid| |foo_#in~b.base|) 1)) (not (= 32 |foo_#in~size|)) (and .cse2 (= 32 .cse1) .cse0 .cse3 (= foo_~i~1 0)) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 13:20:41,447 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 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) (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 (= 32 (select |#length| main_~c~3.base)) .cse2 .cse3 (= 0 main_~c~3.offset)) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (and (= 1 (select |#valid| main_~c~3.base)) (= 32 (select |#length| |main_~#mask~3.base|)) (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|) (<= 0 main_~i~3) (= 32 (select |#length| main_~c~3.base)) (= 0 (select |old(#valid)| |main_~#mask~3.base|)) (= 0 |main_~#mask~3.offset|) (= 0 main_~c~3.offset)) [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse3 (= 32 (select |#length| main_~c~3.base))) (.cse4 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse5 (= 0 |main_~#mask~3.offset|)) (.cse6 (= 0 main_~c~3.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~3 0) .cse4 .cse5 .cse6) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 28) no Hoare annotation was computed. [2018-01-24 13:20:41,448 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 28) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 13:20:41,449 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 13:20:41,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,461 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,467 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,468 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,469 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,469 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,470 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:20:41 BoogieIcfgContainer [2018-01-24 13:20:41,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:20:41,474 INFO L168 Benchmark]: Toolchain (without parser) took 4961.52 ms. Allocated memory was 300.4 MB in the beginning and 509.6 MB in the end (delta: 209.2 MB). Free memory was 261.4 MB in the beginning and 345.0 MB in the end (delta: -83.6 MB). Peak memory consumption was 125.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:41,476 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:20:41,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.42 ms. Allocated memory is still 300.4 MB. Free memory was 260.5 MB in the beginning and 252.4 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:41,476 INFO L168 Benchmark]: Boogie Preprocessor took 30.97 ms. Allocated memory is still 300.4 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:41,477 INFO L168 Benchmark]: RCFGBuilder took 222.83 ms. Allocated memory is still 300.4 MB. Free memory was 250.4 MB in the beginning and 234.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:41,477 INFO L168 Benchmark]: TraceAbstraction took 4525.01 ms. Allocated memory was 300.4 MB in the beginning and 509.6 MB in the end (delta: 209.2 MB). Free memory was 234.9 MB in the beginning and 345.0 MB in the end (delta: -110.2 MB). Peak memory consumption was 99.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:41,479 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.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.42 ms. Allocated memory is still 300.4 MB. Free memory was 260.5 MB in the beginning and 252.4 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.97 ms. Allocated memory is still 300.4 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 222.83 ms. Allocated memory is still 300.4 MB. Free memory was 250.4 MB in the beginning and 234.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4525.01 ms. Allocated memory was 300.4 MB in the beginning and 509.6 MB in the end (delta: 209.2 MB). Free memory was 234.9 MB in the beginning and 345.0 MB in the end (delta: -110.2 MB). Peak memory consumption was 99.0 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 - 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: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 13:20:41,484 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,485 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,485 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,485 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,487 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,487 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,487 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,487 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) || (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) - InvariantResult [Line: 15]: Loop Invariant [2018-01-24 13:20:41,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,489 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,489 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,489 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == b) || ((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size == 32) && b == 0) && 1 <= i)) || !(\valid[b] == 1)) || !(32 == \old(size))) || ((((size == 32 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && b == 0) && i == 0)) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 13:20:41,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:41,492 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) || ((((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.4s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 340 SDtfs, 477 SDslu, 1046 SDs, 0 SdLazy, 464 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 719 GetRequests, 601 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 17 PreInvPairs, 26 NumberOfFragments, 240 HoareAnnotationTreeSize, 17 FomulaSimplifications, 143 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 242 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 576 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 874 ConstructedInterpolants, 34 QuantifiedInterpolants, 160100 SizeOfPredicates, 16 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 213/438 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/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-20-41-498.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-20-41-498.csv Received shutdown request...