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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:39:07,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:39:07,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:39:07,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:39:07,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:39:07,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:39:07,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:39:07,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:39:07,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:39:07,920 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:39:07,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:39:07,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:39:07,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:39:07,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:39:07,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:39:07,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:39:07,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:39:07,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:39:07,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:39:07,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:39:07,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:39:07,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:39:07,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:39:07,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:39:07,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:39:07,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:39:07,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:39:07,965 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:39:07,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:39:07,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:39:07,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:39:07,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:39:07,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:39:07,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:39:07,984 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:39:07,984 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:39:07,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:39:07,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:39:07,984 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:39:07,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:39:07,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:39:07,986 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:39:07,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:39:07,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:39:07,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:39:07,987 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:39:07,987 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:39:07,987 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:39:07,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:39:07,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:39:07,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:39:07,988 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:39:07,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:39:07,988 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:39:07,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:39:07,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:39:07,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:39:07,989 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:39:07,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:39:07,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:39:07,990 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:39:07,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:39:07,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:39:07,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:39:07,991 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:39:07,991 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:39:08,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:39:08,063 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:39:08,068 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:39:08,069 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:39:08,070 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:39:08,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-31 09:39:08,217 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:39:08,226 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:39:08,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:39:08,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:39:08,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:39:08,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d782bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08, skipping insertion in model container [2018-01-31 09:39:08,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,259 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:39:08,280 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:39:08,445 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:39:08,467 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:39:08,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08 WrapperNode [2018-01-31 09:39:08,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:39:08,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:39:08,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:39:08,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:39:08,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (1/1) ... [2018-01-31 09:39:08,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:39:08,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:39:08,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:39:08,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:39:08,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (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-31 09:39:08,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:39:08,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:39:08,583 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:39:08,583 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:39:08,584 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:39:08,584 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:39:08,584 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:39:08,584 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:39:08,584 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:39:08,584 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:39:08,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:39:08,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:39:08,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:39:09,047 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:39:09,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:39:09 BoogieIcfgContainer [2018-01-31 09:39:09,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:39:09,048 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:39:09,048 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:39:09,050 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:39:09,053 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:39:09" (1/1) ... [2018-01-31 09:39:09,063 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:39:09,063 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:39:09,064 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:39:09,108 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:39:09,139 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:39:09,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:39:25,466 INFO L314 AbstractInterpreter]: Visited 73 different actions 505 times. Merged at 47 different actions 273 times. Widened at 1 different actions 1 times. Found 32 fixpoints after 10 different actions. Largest state had 39 variables. [2018-01-31 09:39:25,475 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:39:25,490 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-31 09:39:25,491 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:39:25,491 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:39:25,492 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L16')) [2018-01-31 09:39:25,498 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:39:25,498 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:39:25,498 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:39:25,498 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:39:25,498 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:39:25,499 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:39:25,499 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:39:25,499 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:39:25,500 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:39:25,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:39:25 BasicIcfg [2018-01-31 09:39:25,525 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:39:25,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:39:25,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:39:25,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:39:25,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:39:08" (1/4) ... [2018-01-31 09:39:25,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a365a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:39:25, skipping insertion in model container [2018-01-31 09:39:25,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:39:08" (2/4) ... [2018-01-31 09:39:25,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a365a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:39:25, skipping insertion in model container [2018-01-31 09:39:25,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:39:09" (3/4) ... [2018-01-31 09:39:25,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a365a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:39:25, skipping insertion in model container [2018-01-31 09:39:25,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:39:25" (4/4) ... [2018-01-31 09:39:25,534 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:39:25,542 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:39:25,549 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 09:39:25,699 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:39:25,700 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:39:25,700 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:39:25,700 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:39:25,700 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:39:25,700 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:39:25,700 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:39:25,701 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:39:25,701 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:39:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-31 09:39:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-31 09:39:25,722 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:25,723 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:25,724 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash -289603045, now seen corresponding path program 1 times [2018-01-31 09:39:25,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:25,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:25,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:25,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:25,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:25,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:26,019 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-31 09:39:26,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:39:26,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:39:26,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:39:26,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:39:26,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:39:26,037 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-01-31 09:39:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:26,410 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2018-01-31 09:39:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:39:26,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-31 09:39:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:26,425 INFO L225 Difference]: With dead ends: 138 [2018-01-31 09:39:26,426 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 09:39:26,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:39:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 09:39:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-01-31 09:39:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 09:39:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-31 09:39:26,482 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 12 [2018-01-31 09:39:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:26,483 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-31 09:39:26,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:39:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-31 09:39:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:39:26,484 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:26,485 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:26,485 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1129209722, now seen corresponding path program 1 times [2018-01-31 09:39:26,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:26,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:26,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:26,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:26,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:26,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:26,791 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-31 09:39:26,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:39:26,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:39:26,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:39:26,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:39:26,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:39:26,838 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 6 states. [2018-01-31 09:39:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:27,134 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-31 09:39:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:39:27,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-31 09:39:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:27,137 INFO L225 Difference]: With dead ends: 144 [2018-01-31 09:39:27,137 INFO L226 Difference]: Without dead ends: 92 [2018-01-31 09:39:27,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:39:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-31 09:39:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-01-31 09:39:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 09:39:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-31 09:39:27,147 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 21 [2018-01-31 09:39:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:27,148 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-31 09:39:27,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:39:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-31 09:39:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:39:27,149 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:27,149 INFO L351 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-31 09:39:27,149 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash 823290080, now seen corresponding path program 1 times [2018-01-31 09:39:27,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:27,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:27,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:27,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:27,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:27,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:27,257 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-31 09:39:27,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:27,258 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 09:39:27,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:27,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:27,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:39:27,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-31 09:39:27,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:39:27,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:39:27,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:39:27,530 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-31 09:39:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:27,815 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-31 09:39:27,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:39:27,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-31 09:39:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:27,818 INFO L225 Difference]: With dead ends: 117 [2018-01-31 09:39:27,818 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 09:39:27,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:39:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 09:39:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-01-31 09:39:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 09:39:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-31 09:39:27,838 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 23 [2018-01-31 09:39:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:27,838 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-31 09:39:27,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:39:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-31 09:39:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:39:27,840 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:27,840 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:27,840 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash 271566421, now seen corresponding path program 1 times [2018-01-31 09:39:27,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:27,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:27,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:27,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:27,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:27,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:28,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:28,137 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:28,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:28,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 09:39:28,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:39:28,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2018-01-31 09:39:28,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:39:28,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:39:28,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:39:28,247 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 9 states. [2018-01-31 09:39:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:28,675 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-01-31 09:39:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:39:28,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-31 09:39:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:28,680 INFO L225 Difference]: With dead ends: 149 [2018-01-31 09:39:28,680 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 09:39:28,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:39:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 09:39:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 89. [2018-01-31 09:39:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 09:39:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-31 09:39:28,691 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 32 [2018-01-31 09:39:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:28,692 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-31 09:39:28,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:39:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-31 09:39:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:39:28,693 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:28,694 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:28,694 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:28,694 INFO L82 PathProgramCache]: Analyzing trace with hash -171375060, now seen corresponding path program 1 times [2018-01-31 09:39:28,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:28,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:28,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:28,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:28,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:28,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:39:28,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:28,771 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 09:39:28,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:28,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:28,843 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-31 09:39:28,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:39:28,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:39:28,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 09:39:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:39:28,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:28,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-31 09:39:28,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:39:28,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:39:28,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:39:28,979 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 6 states. [2018-01-31 09:39:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:29,067 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-01-31 09:39:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:39:29,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-31 09:39:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:29,068 INFO L225 Difference]: With dead ends: 89 [2018-01-31 09:39:29,068 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 09:39:29,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:39:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 09:39:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-31 09:39:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:39:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-31 09:39:29,078 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 33 [2018-01-31 09:39:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:29,079 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-31 09:39:29,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:39:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-31 09:39:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:39:29,080 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:29,081 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:29,081 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash -171375058, now seen corresponding path program 1 times [2018-01-31 09:39:29,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:29,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:29,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:29,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:29,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:29,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:29,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:29,457 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 09:39:29,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:29,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:29,519 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-31 09:39:29,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:39:29,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:39:29,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:39:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:39:29,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:29,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2018-01-31 09:39:29,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:39:29,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:39:29,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:39:29,690 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 15 states. [2018-01-31 09:39:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:30,453 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-01-31 09:39:30,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:39:30,453 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-31 09:39:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:30,455 INFO L225 Difference]: With dead ends: 143 [2018-01-31 09:39:30,455 INFO L226 Difference]: Without dead ends: 142 [2018-01-31 09:39:30,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-01-31 09:39:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-31 09:39:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 89. [2018-01-31 09:39:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 09:39:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-31 09:39:30,475 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 33 [2018-01-31 09:39:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:30,475 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-31 09:39:30,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:39:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-31 09:39:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 09:39:30,476 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:30,477 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:30,477 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1928557588, now seen corresponding path program 1 times [2018-01-31 09:39:30,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:30,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:30,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:30,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:30,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:30,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:30,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:30,644 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 09:39:30,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:30,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:30,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:30,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-31 09:39:30,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:39:30,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:39:30,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:39:30,742 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 15 states. [2018-01-31 09:39:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:31,114 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2018-01-31 09:39:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 09:39:31,115 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-31 09:39:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:31,116 INFO L225 Difference]: With dead ends: 181 [2018-01-31 09:39:31,116 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 09:39:31,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-01-31 09:39:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 09:39:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-01-31 09:39:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 09:39:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-01-31 09:39:31,130 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 41 [2018-01-31 09:39:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:31,130 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-01-31 09:39:31,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:39:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-01-31 09:39:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 09:39:31,132 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:31,132 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:31,132 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash 853161830, now seen corresponding path program 1 times [2018-01-31 09:39:31,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:31,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:31,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:31,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:31,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:31,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:31,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:31,194 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:31,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:31,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:31,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:31,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 09:39:31,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:39:31,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:39:31,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:39:31,416 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 9 states. [2018-01-31 09:39:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:31,516 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-01-31 09:39:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:39:31,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-31 09:39:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:31,518 INFO L225 Difference]: With dead ends: 155 [2018-01-31 09:39:31,518 INFO L226 Difference]: Without dead ends: 135 [2018-01-31 09:39:31,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:39:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-31 09:39:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2018-01-31 09:39:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 09:39:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-01-31 09:39:31,536 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 41 [2018-01-31 09:39:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:31,536 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-01-31 09:39:31,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:39:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-01-31 09:39:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 09:39:31,538 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:31,539 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:31,539 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1107304593, now seen corresponding path program 2 times [2018-01-31 09:39:31,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:31,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:31,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:31,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:31,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:31,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-31 09:39:31,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:31,753 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 09:39:31,760 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:39:31,770 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:31,775 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:31,777 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:39:31,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:31,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:31,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12] total 14 [2018-01-31 09:39:31,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:39:31,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:39:31,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:39:31,940 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 15 states. [2018-01-31 09:39:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:32,288 INFO L93 Difference]: Finished difference Result 194 states and 209 transitions. [2018-01-31 09:39:32,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:39:32,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-01-31 09:39:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:32,290 INFO L225 Difference]: With dead ends: 194 [2018-01-31 09:39:32,290 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 09:39:32,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2018-01-31 09:39:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 09:39:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2018-01-31 09:39:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 09:39:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2018-01-31 09:39:32,303 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 52 [2018-01-31 09:39:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:32,303 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2018-01-31 09:39:32,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:39:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2018-01-31 09:39:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 09:39:32,305 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:32,305 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:32,305 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2112266945, now seen corresponding path program 2 times [2018-01-31 09:39:32,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:32,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:32,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:32,307 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:39:32,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:32,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:32,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:32,408 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:32,416 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:39:32,424 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:32,427 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:39:32,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-31 09:39:32,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:39:32,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-31 09:39:32,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:39:32,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:39:32,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-31 09:39:32,641 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand 12 states. [2018-01-31 09:39:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:33,199 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2018-01-31 09:39:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:39:33,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-01-31 09:39:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:33,201 INFO L225 Difference]: With dead ends: 193 [2018-01-31 09:39:33,201 INFO L226 Difference]: Without dead ends: 162 [2018-01-31 09:39:33,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-31 09:39:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-31 09:39:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2018-01-31 09:39:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 09:39:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2018-01-31 09:39:33,219 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 52 [2018-01-31 09:39:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:33,219 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2018-01-31 09:39:33,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:39:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2018-01-31 09:39:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 09:39:33,220 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:33,221 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:33,221 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:33,221 INFO L82 PathProgramCache]: Analyzing trace with hash 33296468, now seen corresponding path program 1 times [2018-01-31 09:39:33,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:33,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:33,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:33,222 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:39:33,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:33,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 09:39:33,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:33,445 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 09:39:33,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:33,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:33,495 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-31 09:39:33,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:39:33,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:39:33,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:39:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 09:39:33,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:33,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-31 09:39:33,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:39:33,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:39:33,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:39:33,567 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 10 states. [2018-01-31 09:39:34,108 WARN L143 SmtUtils]: Spent 196ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-31 09:39:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:34,388 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-01-31 09:39:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:39:34,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-01-31 09:39:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:34,390 INFO L225 Difference]: With dead ends: 185 [2018-01-31 09:39:34,390 INFO L226 Difference]: Without dead ends: 184 [2018-01-31 09:39:34,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:39:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-31 09:39:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2018-01-31 09:39:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-31 09:39:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2018-01-31 09:39:34,404 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 53 [2018-01-31 09:39:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:34,404 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2018-01-31 09:39:34,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:39:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2018-01-31 09:39:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 09:39:34,405 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:34,406 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:34,406 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 167383273, now seen corresponding path program 2 times [2018-01-31 09:39:34,406 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:34,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:34,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:34,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:34,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:34,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 09:39:34,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:34,856 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:34,869 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:39:34,877 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:34,882 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:34,883 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:39:34,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:39:35,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:35,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-01-31 09:39:35,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 09:39:35,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 09:39:35,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:39:35,155 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 26 states. [2018-01-31 09:39:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:36,636 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2018-01-31 09:39:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-31 09:39:36,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-01-31 09:39:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:36,638 INFO L225 Difference]: With dead ends: 255 [2018-01-31 09:39:36,638 INFO L226 Difference]: Without dead ends: 180 [2018-01-31 09:39:36,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=471, Invalid=3069, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 09:39:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-31 09:39:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2018-01-31 09:39:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-31 09:39:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2018-01-31 09:39:36,656 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 62 [2018-01-31 09:39:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:36,657 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2018-01-31 09:39:36,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 09:39:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2018-01-31 09:39:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 09:39:36,659 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:36,659 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:36,659 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash 296475714, now seen corresponding path program 1 times [2018-01-31 09:39:36,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:36,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:36,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:36,661 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:39:36,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:36,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-01-31 09:39:36,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:36,761 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:36,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:36,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:39:36,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:36,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-31 09:39:36,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:39:36,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:39:36,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:39:36,882 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand 15 states. [2018-01-31 09:39:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:37,199 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2018-01-31 09:39:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:39:37,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-01-31 09:39:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:37,218 INFO L225 Difference]: With dead ends: 198 [2018-01-31 09:39:37,218 INFO L226 Difference]: Without dead ends: 186 [2018-01-31 09:39:37,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:39:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-31 09:39:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2018-01-31 09:39:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-31 09:39:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2018-01-31 09:39:37,232 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 65 [2018-01-31 09:39:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:37,232 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2018-01-31 09:39:37,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:39:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2018-01-31 09:39:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 09:39:37,234 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:37,234 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:37,235 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 11347989, now seen corresponding path program 3 times [2018-01-31 09:39:37,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:37,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:37,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:37,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:39:37,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:37,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-31 09:39:37,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:37,350 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:37,357 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:39:37,365 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:39:37,368 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:39:37,369 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:39:37,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-31 09:39:37,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:37,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-31 09:39:37,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 09:39:37,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 09:39:37,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:39:37,833 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand 20 states. [2018-01-31 09:39:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:38,149 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-01-31 09:39:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 09:39:38,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-01-31 09:39:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:38,150 INFO L225 Difference]: With dead ends: 195 [2018-01-31 09:39:38,150 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 09:39:38,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-01-31 09:39:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 09:39:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2018-01-31 09:39:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-31 09:39:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-01-31 09:39:38,164 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 72 [2018-01-31 09:39:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:38,165 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-01-31 09:39:38,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 09:39:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-01-31 09:39:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-31 09:39:38,166 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:39:38,166 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:39:38,166 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:39:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1585457444, now seen corresponding path program 2 times [2018-01-31 09:39:38,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:39:38,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:39:38,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:38,168 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:39:38,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:39:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:39:38,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:39:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 09:39:38,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:39:38,274 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:39:38,286 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:39:38,293 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:38,302 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:39:38,303 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:39:38,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:39:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 09:39:38,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:39:38,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-31 09:39:38,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:39:38,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:39:38,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:39:38,480 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 19 states. [2018-01-31 09:39:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:39:38,749 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-01-31 09:39:38,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:39:38,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-01-31 09:39:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:39:38,751 INFO L225 Difference]: With dead ends: 202 [2018-01-31 09:39:38,751 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 09:39:38,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:39:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 09:39:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 09:39:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 09:39:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 09:39:38,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-01-31 09:39:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:39:38,753 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 09:39:38,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:39:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 09:39:38,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 09:39:38,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 09:39:39,444 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 42 DAG size of output 30 [2018-01-31 09:39:39,721 WARN L146 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 65 DAG size of output 34 [2018-01-31 09:39:41,997 WARN L146 SmtUtils]: Spent 2245ms on a formula simplification. DAG size of input: 98 DAG size of output 64 [2018-01-31 09:39:42,389 WARN L146 SmtUtils]: Spent 390ms on a formula simplification. DAG size of input: 40 DAG size of output 30 [2018-01-31 09:39:42,391 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,391 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,391 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L395 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse4 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse5 (< 0 |foo_#in~b.offset|)) (.cse6 (< |foo_#in~b.offset| 0)) (.cse7 (not (= 32 (select |#length| |foo_#in~b.base|))))) (let ((.cse2 (= 1 foo_~i~1)) (.cse1 (= 0 foo_~i~1)) (.cse3 (or .cse4 .cse5 .cse6 .cse7))) (and (let ((.cse0 (<= foo_~size 1))) (or (< 1 |foo_#in~size|) (and .cse0 .cse1) (and .cse0 .cse2) .cse3)) (or .cse4 (not (= 0 |foo_#in~size|)) (and (= foo_~size 0) (= foo_~i~1 0)) .cse5 .cse6 .cse7) (or (<= foo_~size 2) (< 2 |foo_#in~size|) .cse3) (let ((.cse12 (= 1 (select |#valid| foo_~b.base))) (.cse14 (<= foo_~b.offset 0)) (.cse13 (select |#length| foo_~b.base))) (let ((.cse11 (<= 0 foo_~b.offset)) (.cse9 (<= foo_~size 31)) (.cse8 (+ foo_~i~1 foo_~b.offset)) (.cse10 (and .cse12 .cse14 (= 32 .cse13)))) (or (and .cse2 (<= 1 .cse8) .cse9 .cse10) (and .cse11 (and .cse12 (= .cse13 32)) .cse1 .cse14 .cse9) (and .cse11 .cse9 (<= 2 .cse8) .cse10) .cse3 (< 31 (+ |foo_#in~b.offset| |foo_#in~size|)))))))) [2018-01-31 09:39:42,392 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-01-31 09:39:42,392 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-31 09:39:42,393 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-31 09:39:42,393 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-31 09:39:42,394 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-31 09:39:42,395 INFO L399 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-01-31 09:39:42,395 INFO L399 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-31 09:39:42,395 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-31 09:39:42,395 INFO L399 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-01-31 09:39:42,395 INFO L395 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 |main_~#mask~3.offset|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (<= |main_~#mask~3.offset| 0))) (or (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3 .cse4) (and (<= 1 main_~i~3) (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 (<= main_~c~3.offset 0) .cse2 (= 32 (select |#length| main_~c~3.base)) .cse3 .cse4 (<= 0 main_~c~3.offset)))) [2018-01-31 09:39:42,395 INFO L395 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse7 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse8 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse5 (<= |main_~#mask~3.offset| 0)) (.cse6 (<= 0 main_~c~3.offset)) (.cse3 (<= main_~c~3.offset 0)) (.cse4 (<= 0 |main_~#mask~3.offset|)) (.cse2 (select |#length| main_~c~3.base))) (or (and (and (<= 1 main_~i~3) .cse0 .cse1 (= .cse2 32) .cse3 .cse4 .cse5 .cse6 (<= main_~i~3 31)) .cse7 .cse8) (and .cse0 .cse1 .cse7 .cse8 .cse5 .cse6 (= 0 main_~i~3) .cse3 .cse4 (= 32 .cse2)))) [2018-01-31 09:39:42,395 INFO L399 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-01-31 09:39:42,395 INFO L399 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-31 09:39:42,396 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-31 09:39:42,397 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:39:42,397 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-31 09:39:42,397 INFO L399 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-01-31 09:39:42,397 INFO L399 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-31 09:39:42,397 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-31 09:39:42,397 INFO L399 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-01-31 09:39:42,397 INFO L395 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 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (<= |main_~#mask~3.offset| 0)) (.cse5 (<= 0 main_~c~3.offset)) (.cse6 (<= main_~c~3.offset 0)) (.cse7 (<= 0 |main_~#mask~3.offset|)) (.cse8 (= 32 (select |#length| main_~c~3.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 main_~i~3) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 main_~i~3) .cse6 .cse7 .cse8))) [2018-01-31 09:39:42,398 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-31 09:39:42,398 INFO L399 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-31 09:39:42,404 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,405 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,408 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,409 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,415 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,422 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,422 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,422 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,422 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,430 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:39:42 BasicIcfg [2018-01-31 09:39:42,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:39:42,433 INFO L168 Benchmark]: Toolchain (without parser) took 34215.33 ms. Allocated memory was 309.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 270.1 MB in the beginning and 309.6 MB in the end (delta: -39.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-31 09:39:42,434 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:39:42,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.31 ms. Allocated memory is still 309.3 MB. Free memory was 269.1 MB in the beginning and 261.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:39:42,434 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 309.3 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:39:42,435 INFO L168 Benchmark]: RCFGBuilder took 530.24 ms. Allocated memory is still 309.3 MB. Free memory was 259.1 MB in the beginning and 241.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:39:42,436 INFO L168 Benchmark]: IcfgTransformer took 16476.68 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 241.1 MB in the beginning and 687.7 MB in the end (delta: -446.6 MB). Peak memory consumption was 573.7 MB. Max. memory is 5.3 GB. [2018-01-31 09:39:42,436 INFO L168 Benchmark]: TraceAbstraction took 16906.35 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 252.2 MB). Free memory was 687.7 MB in the beginning and 309.6 MB in the end (delta: 378.1 MB). Peak memory consumption was 630.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:39:42,438 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.17 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.31 ms. Allocated memory is still 309.3 MB. Free memory was 269.1 MB in the beginning and 261.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 309.3 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 530.24 ms. Allocated memory is still 309.3 MB. Free memory was 259.1 MB in the beginning and 241.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 16476.68 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 241.1 MB in the beginning and 687.7 MB in the end (delta: -446.6 MB). Peak memory consumption was 573.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16906.35 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 252.2 MB). Free memory was 687.7 MB in the beginning and 309.6 MB in the end (delta: 378.1 MB). Peak memory consumption was 630.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 62 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1076 LocStat_NO_SUPPORTING_DISEQUALITIES : 479 LocStat_NO_DISJUNCTIONS : -124 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 104 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 83 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.719528 RENAME_VARIABLES(MILLISECONDS) : 0.263074 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.690247 PROJECTAWAY(MILLISECONDS) : 0.424641 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.073684 DISJOIN(MILLISECONDS) : 0.457416 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.291318 ADD_EQUALITY(MILLISECONDS) : 0.025392 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022410 #CONJOIN_DISJUNCTIVE : 780 #RENAME_VARIABLES : 1718 #UNFREEZE : 0 #CONJOIN : 1069 #PROJECTAWAY : 1005 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 210 #RENAME_VARIABLES_DISJUNCTIVE : 1699 #ADD_EQUALITY : 104 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * 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 - 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: 25]: Loop Invariant [2018-01-31 09:39:42,449 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,450 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && 0 <= mask) && i == 0) && 0 == \old(\valid)[mask]) && mask <= 0) || (((((((((1 <= i && 1 == \valid[c]) && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && c <= 0) && 0 <= mask) && 32 == unknown-#length-unknown[c]) && 0 == \old(\valid)[mask]) && mask <= 0) && 0 <= c) - InvariantResult [Line: 15]: Loop Invariant [2018-01-31 09:39:42,464 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 < \old(size) || (size <= 1 && 0 == i)) || (size <= 1 && 1 == i)) || ((!(\valid[b] == 1) || 0 < b) || b < 0) || !(32 == unknown-#length-unknown[b])) && (((((!(\valid[b] == 1) || !(0 == \old(size))) || (size == 0 && i == 0)) || 0 < b) || b < 0) || !(32 == unknown-#length-unknown[b]))) && ((size <= 2 || 2 < \old(size)) || ((!(\valid[b] == 1) || 0 < b) || b < 0) || !(32 == unknown-#length-unknown[b]))) && (((((((1 == i && 1 <= i + b) && size <= 31) && (1 == \valid[b] && b <= 0) && 32 == unknown-#length-unknown[b]) || ((((0 <= b && 1 == \valid[b] && unknown-#length-unknown[b] == 32) && 0 == i) && b <= 0) && size <= 31)) || (((0 <= b && size <= 31) && 2 <= i + b) && (1 == \valid[b] && b <= 0) && 32 == unknown-#length-unknown[b])) || ((!(\valid[b] == 1) || 0 < b) || b < 0) || !(32 == unknown-#length-unknown[b])) || 31 < b + \old(size)) - InvariantResult [Line: 29]: Loop Invariant [2018-01-31 09:39:42,474 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,475 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,475 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,475 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,476 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:39:42,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && mask <= 0) && 0 <= c) && 1 <= i) && c <= 0) && 0 <= mask) && 32 == unknown-#length-unknown[c]) || (((((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && mask <= 0) && 0 <= c) && 0 == i) && c <= 0) && 0 <= mask) && 32 == unknown-#length-unknown[c]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 16.7s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 793 SDtfs, 1728 SDslu, 4967 SDs, 0 SdLazy, 3166 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 885 GetRequests, 573 SyntacticMatches, 11 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 323 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 52 NumberOfFragments, 458 HoareAnnotationTreeSize, 29 FomulaSimplifications, 1825 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4861 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1317 NumberOfCodeBlocks, 1253 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1289 ConstructedInterpolants, 2 QuantifiedInterpolants, 314225 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 464/882 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-39-42-483.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-39-42-483.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-39-42-483.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-39-42-483.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-39-42-483.csv Received shutdown request...