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_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memsetNonZero_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-07 02:27:56,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-07 02:27:56,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-07 02:27:57,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-07 02:27:57,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-07 02:27:57,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-07 02:27:57,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-07 02:27:57,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-07 02:27:57,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-07 02:27:57,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-07 02:27:57,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-07 02:27:57,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-07 02:27:57,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-07 02:27:57,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-07 02:27:57,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-07 02:27:57,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-07 02:27:57,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-07 02:27:57,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-07 02:27:57,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-07 02:27:57,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-07 02:27:57,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-07 02:27:57,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-07 02:27:57,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-07 02:27:57,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-07 02:27:57,040 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-07 02:27:57,041 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-07 02:27:57,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-07 02:27:57,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-07 02:27:57,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-07 02:27:57,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-07 02:27:57,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-07 02:27:57,044 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-07 02:27:57,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-07 02:27:57,069 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-07 02:27:57,070 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-07 02:27:57,070 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-07 02:27:57,071 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-07 02:27:57,071 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-07 02:27:57,071 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-07 02:27:57,071 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-07 02:27:57,071 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-07 02:27:57,072 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-07 02:27:57,072 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-07 02:27:57,072 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-07 02:27:57,073 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-07 02:27:57,073 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-07 02:27:57,073 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-07 02:27:57,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-07 02:27:57,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-07 02:27:57,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-07 02:27:57,074 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-07 02:27:57,074 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-07 02:27:57,074 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-07 02:27:57,074 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-07 02:27:57,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-07 02:27:57,075 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-07 02:27:57,075 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-07 02:27:57,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-07 02:27:57,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-07 02:27:57,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-07 02:27:57,076 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-07 02:27:57,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-07 02:27:57,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-07 02:27:57,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-07 02:27:57,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:27:57,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-07 02:27:57,077 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-07 02:27:57,078 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-07 02:27:57,078 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-07 02:27:57,078 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-07 02:27:57,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-07 02:27:57,127 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-07 02:27:57,132 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-07 02:27:57,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-07 02:27:57,134 INFO L276 PluginConnector]: CDTParser initialized [2018-04-07 02:27:57,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memsetNonZero_true-valid-memsafety_true-termination.c [2018-04-07 02:27:57,502 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb4980832f [2018-04-07 02:27:57,621 INFO L287 CDTParser]: IsIndexed: true [2018-04-07 02:27:57,621 INFO L288 CDTParser]: Found 1 translation units. [2018-04-07 02:27:57,622 INFO L168 CDTParser]: Scanning memsetNonZero_true-valid-memsafety_true-termination.c [2018-04-07 02:27:57,623 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-07 02:27:57,624 INFO L215 ultiparseSymbolTable]: [2018-04-07 02:27:57,624 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-07 02:27:57,624 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in memsetNonZero_true-valid-memsafety_true-termination.c [2018-04-07 02:27:57,624 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-07 02:27:57,624 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fmemsetNonZero_true_valid_memsafety_true_termination_c__size_t in memsetNonZero_true-valid-memsafety_true-termination.c [2018-04-07 02:27:57,624 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fmemsetNonZero_true_valid_memsafety_true_termination_c____kernel_size_t in memsetNonZero_true-valid-memsafety_true-termination.c [2018-04-07 02:27:57,624 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fmemsetNonZero_true_valid_memsafety_true_termination_c____u32 in memsetNonZero_true-valid-memsafety_true-termination.c [2018-04-07 02:27:57,639 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb4980832f [2018-04-07 02:27:57,644 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-07 02:27:57,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-07 02:27:57,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-07 02:27:57,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-07 02:27:57,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-07 02:27:57,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55860da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57, skipping insertion in model container [2018-04-07 02:27:57,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,676 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:27:57,688 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-07 02:27:57,813 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:27:57,843 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-07 02:27:57,853 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 7 non ball SCCs. Number of states in SCCs 7. [2018-04-07 02:27:57,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57 WrapperNode [2018-04-07 02:27:57,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-07 02:27:57,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-07 02:27:57,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-07 02:27:57,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-07 02:27:57,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (1/1) ... [2018-04-07 02:27:57,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-07 02:27:57,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-07 02:27:57,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-07 02:27:57,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-07 02:27:57,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (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-04-07 02:27:57,988 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-07 02:27:57,988 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-07 02:27:57,988 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-07 02:27:57,988 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-04-07 02:27:57,988 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-04-07 02:27:57,989 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-07 02:27:57,989 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-07 02:27:57,989 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-04-07 02:27:57,989 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-07 02:27:57,989 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-07 02:27:57,989 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-07 02:27:58,170 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-07 02:27:58,251 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-07 02:27:58,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:27:58 BoogieIcfgContainer [2018-04-07 02:27:58,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-07 02:27:58,252 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-07 02:27:58,252 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-07 02:27:58,254 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-07 02:27:58,257 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:27:58" (1/1) ... [2018-04-07 02:27:58,278 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-07 02:27:58,278 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [] [2018-04-07 02:27:58,316 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-07 02:27:58,329 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 7 non ball SCCs. Number of states in SCCs 7. [2018-04-07 02:27:58,330 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 0 location literals (each corresponds to one heap write) [2018-04-07 02:27:58,335 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 7 non ball SCCs. Number of states in SCCs 7. [2018-04-07 02:27:58,339 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-07 02:27:58,339 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: [2018-04-07 02:27:58,341 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: [2018-04-07 02:27:58,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-07 02:27:58,888 INFO L314 AbstractInterpreter]: Visited 27 different actions 32 times. Merged at 4 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 15 variables. [2018-04-07 02:27:58,890 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-07 02:27:58,898 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-07 02:27:58,899 INFO L435 apSepIcfgTransformer]: array groups: Set: [2018-04-07 02:27:58,899 INFO L437 apSepIcfgTransformer]: select infos: Set: [2018-04-07 02:27:58,901 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-07 02:27:58,902 INFO L131 ransitionTransformer]: executing heap partitioning transformation [2018-04-07 02:27:58,906 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,906 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,906 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,907 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,907 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,907 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,907 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,908 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,908 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,908 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] [2018-04-07 02:27:58,908 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,908 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,909 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,909 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,909 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,909 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,909 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,910 DEBUG L281 ransitionTransformer]: Formula: (and (not (= |v_main_~#cstats~0.base_1| 0)) (= (store |v_#length_5| |v_main_~#cstats~0.base_1| 80) |v_#length_4|) (= |v_#valid_8| (store |v_#valid_9| |v_main_~#cstats~0.base_1| 1)) (= 0 (select |v_#valid_9| |v_main_~#cstats~0.base_1|)) (= |v_main_~#cstats~0.offset_1| 0)) InVars {#length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{main_~#cstats~0.base=|v_main_~#cstats~0.base_1|, #length=|v_#length_4|, main_~#cstats~0.offset=|v_main_~#cstats~0.offset_1|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, main_~#cstats~0.base, #length, main_~#cstats~0.offset] [2018-04-07 02:27:58,910 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,910 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,910 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,910 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_1| (store |v_#valid_2| 0 0)) InVars {#valid=|v_#valid_2|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:27:58,910 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,910 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,911 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,911 DEBUG L281 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_11| |v_main_~#cstats~0.base_3|))) InVars {main_~#cstats~0.base=|v_main_~#cstats~0.base_3|, #valid=|v_#valid_11|} OutVars{main_~#cstats~0.base=|v_main_~#cstats~0.base_3|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,911 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,911 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,912 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,912 DEBUG L281 ransitionTransformer]: Formula: (or (not (<= (+ |v_main_~#cstats~0.offset_3| 80) (select |v_#length_7| |v_main_~#cstats~0.base_4|))) (not (<= 0 |v_main_~#cstats~0.offset_3|))) InVars {main_~#cstats~0.base=|v_main_~#cstats~0.base_4|, #length=|v_#length_7|, main_~#cstats~0.offset=|v_main_~#cstats~0.offset_3|} OutVars{main_~#cstats~0.base=|v_main_~#cstats~0.base_4|, #length=|v_#length_7|, main_~#cstats~0.offset=|v_main_~#cstats~0.offset_3|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,912 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,912 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,913 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,913 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_#Ultimate.C_memset_#amountInParam_1| 80) (= |v_#Ultimate.C_memset_#valueInParam_1| 10) (= |v_#Ultimate.C_memset_#ptr.offsetInParam_1| |v_main_~#cstats~0.offset_6|) (= |v_#Ultimate.C_memset_#ptr.baseInParam_1| |v_main_~#cstats~0.base_7|)) InVars {main_~#cstats~0.base=|v_main_~#cstats~0.base_7|, main_~#cstats~0.offset=|v_main_~#cstats~0.offset_6|} OutVars{#Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amountInParam_1|, #Ultimate.C_memset_#value=|v_#Ultimate.C_memset_#valueInParam_1|, #Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.baseInParam_1|, #Ultimate.C_memset_#ptr.offset=|v_#Ultimate.C_memset_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[#Ultimate.C_memset_#amount, #Ultimate.C_memset_#value, #Ultimate.C_memset_#ptr.base, #Ultimate.C_memset_#ptr.offset] [2018-04-07 02:27:58,913 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,913 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,914 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,914 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,914 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,914 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,914 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,915 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~memset3.offset=|v_main_#t~memset3.offset_2|, main_#t~memset3.base=|v_main_#t~memset3.base_2|} AuxVars[] AssignedVars[main_#t~memset3.offset, main_#t~memset3.base] [2018-04-07 02:27:58,915 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,915 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,915 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,916 DEBUG L281 ransitionTransformer]: Formula: (= 1 (select |v_#valid_3| |v_#Ultimate.C_memset_#ptr.base_1|)) InVars {#Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.base_1|, #valid=|v_#valid_3|} OutVars{#Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.base_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,916 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,916 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,916 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,917 DEBUG L281 ransitionTransformer]: Formula: (= |v_main_#res_1| 0) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-07 02:27:58,917 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,917 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,917 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,918 DEBUG L281 ransitionTransformer]: Formula: (and (<= (+ |v_#Ultimate.C_memset_#ptr.offset_1| |v_#Ultimate.C_memset_#amount_1|) (select |v_#length_1| |v_#Ultimate.C_memset_#ptr.base_2|)) (<= 0 |v_#Ultimate.C_memset_#ptr.offset_1|)) InVars {#length=|v_#length_1|, #Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amount_1|, #Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.base_2|, #Ultimate.C_memset_#ptr.offset=|v_#Ultimate.C_memset_#ptr.offset_1|} OutVars{#length=|v_#length_1|, #Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amount_1|, #Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.base_2|, #Ultimate.C_memset_#ptr.offset=|v_#Ultimate.C_memset_#ptr.offset_1|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,918 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,918 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,918 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,918 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_12| (store |v_#valid_13| |v_main_~#cstats~0.base_5| 0)) InVars {main_~#cstats~0.base=|v_main_~#cstats~0.base_5|, #valid=|v_#valid_13|} OutVars{main_~#cstats~0.base=|v_main_~#cstats~0.base_5|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#valid] [2018-04-07 02:27:58,919 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,919 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,919 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,919 DEBUG L281 ransitionTransformer]: Formula: (= |v_#Ultimate.C_memset_#t~loopctr5_1| 0) InVars {} OutVars{#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_1|} AuxVars[] AssignedVars[#Ultimate.C_memset_#t~loopctr5] [2018-04-07 02:27:58,919 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,920 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,920 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,920 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#cstats~0.base=|v_main_~#cstats~0.base_6|, main_~#cstats~0.offset=|v_main_~#cstats~0.offset_5|} AuxVars[] AssignedVars[main_~#cstats~0.base, main_~#cstats~0.offset] [2018-04-07 02:27:58,921 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,921 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,921 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,921 DEBUG L281 ransitionTransformer]: Formula: (< |v_#Ultimate.C_memset_#t~loopctr5_2| |v_#Ultimate.C_memset_#amount_2|) InVars {#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_2|, #Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amount_2|} OutVars{#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_2|, #Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amount_2|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,922 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,922 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,922 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,922 DEBUG L281 ransitionTransformer]: Formula: (not (< |v_#Ultimate.C_memset_#t~loopctr5_5| |v_#Ultimate.C_memset_#amount_3|)) InVars {#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_5|, #Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amount_3|} OutVars{#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_5|, #Ultimate.C_memset_#amount=|v_#Ultimate.C_memset_#amount_3|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,923 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,923 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,923 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,924 DEBUG L281 ransitionTransformer]: Formula: (= |v_#valid_14| |old(#valid)|) InVars {#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_14|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,924 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,924 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,924 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,925 DEBUG L281 ransitionTransformer]: Formula: (not (= |v_#valid_15| |old(#valid)|)) InVars {#valid=|v_#valid_15|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_15|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,925 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,925 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,925 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,926 DEBUG L281 ransitionTransformer]: Formula: (= |v_#Ultimate.C_memset_#t~loopctr5_3| (+ |v_#Ultimate.C_memset_#t~loopctr5_4| 1)) InVars {#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_4|} OutVars{#Ultimate.C_memset_#t~loopctr5=|v_#Ultimate.C_memset_#t~loopctr5_3|} AuxVars[] AssignedVars[#Ultimate.C_memset_#t~loopctr5] [2018-04-07 02:27:58,926 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,926 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,926 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,927 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_#Ultimate.C_memset_#res.base_1| |v_#Ultimate.C_memset_#ptr.base_3|) (= |v_#Ultimate.C_memset_#ptr.offset_2| |v_#Ultimate.C_memset_#res.offset_1|)) InVars {#Ultimate.C_memset_#res.base=|v_#Ultimate.C_memset_#res.base_1|, #Ultimate.C_memset_#res.offset=|v_#Ultimate.C_memset_#res.offset_1|, #Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.base_3|, #Ultimate.C_memset_#ptr.offset=|v_#Ultimate.C_memset_#ptr.offset_2|} OutVars{#Ultimate.C_memset_#res.base=|v_#Ultimate.C_memset_#res.base_1|, #Ultimate.C_memset_#res.offset=|v_#Ultimate.C_memset_#res.offset_1|, #Ultimate.C_memset_#ptr.base=|v_#Ultimate.C_memset_#ptr.base_3|, #Ultimate.C_memset_#ptr.offset=|v_#Ultimate.C_memset_#ptr.offset_2|} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,927 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,927 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,927 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,927 DEBUG L281 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-07 02:27:58,928 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,928 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,928 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,928 DEBUG L281 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret4_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret4=|v_ULTIMATE.start_#t~ret4_2|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret4] [2018-04-07 02:27:58,928 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,929 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,929 DEBUG L280 ransitionTransformer]: transformed transition [2018-04-07 02:27:58,929 DEBUG L281 ransitionTransformer]: Formula: (and (= |v_main_#t~memset3.offset_3| |v_#Ultimate.C_memset_#res.offsetOutParam_1|) (= |v_main_#t~memset3.base_3| |v_#Ultimate.C_memset_#res.baseOutParam_1|)) InVars {#Ultimate.C_memset_#res.base=|v_#Ultimate.C_memset_#res.baseOutParam_1|, #Ultimate.C_memset_#res.offset=|v_#Ultimate.C_memset_#res.offsetOutParam_1|} OutVars{main_#t~memset3.offset=|v_main_#t~memset3.offset_3|, main_#t~memset3.base=|v_main_#t~memset3.base_3|} AuxVars[] AssignedVars[main_#t~memset3.offset, main_#t~memset3.base] [2018-04-07 02:27:58,929 DEBUG L284 ransitionTransformer]: transformula unchanged [2018-04-07 02:27:58,930 DEBUG L310 ransitionTransformer]: [2018-04-07 02:27:58,930 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 7 non ball SCCs. Number of states in SCCs 7. [2018-04-07 02:27:58,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:27:58 BasicIcfg [2018-04-07 02:27:58,931 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-07 02:27:58,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-07 02:27:58,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-07 02:27:58,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-07 02:27:58,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:27:57" (1/4) ... [2018-04-07 02:27:58,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756c9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:27:58, skipping insertion in model container [2018-04-07 02:27:58,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:27:57" (2/4) ... [2018-04-07 02:27:58,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756c9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:27:58, skipping insertion in model container [2018-04-07 02:27:58,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:27:58" (3/4) ... [2018-04-07 02:27:58,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756c9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:27:58, skipping insertion in model container [2018-04-07 02:27:58,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 02:27:58" (4/4) ... [2018-04-07 02:27:58,940 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-07 02:27:58,950 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-07 02:27:58,959 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-04-07 02:27:58,995 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-07 02:27:58,996 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-07 02:27:58,996 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-07 02:27:58,996 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-07 02:27:58,996 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-07 02:27:58,997 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-07 02:27:58,997 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-07 02:27:58,997 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-07 02:27:58,997 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-07 02:27:58,998 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-07 02:27:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-04-07 02:27:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-07 02:27:59,014 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:27:59,015 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:27:59,015 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:27:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -639658125, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:27:59,031 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:27:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:27:59,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:27:59,104 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-04-07 02:27:59,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:27:59,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:27:59,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-07 02:27:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,123 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:27:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,155 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:27:59,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-07 02:27:59,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-07 02:27:59,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-07 02:27:59,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-07 02:27:59,166 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-04-07 02:27:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:27:59,198 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-04-07 02:27:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-07 02:27:59,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-04-07 02:27:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:27:59,208 INFO L225 Difference]: With dead ends: 26 [2018-04-07 02:27:59,208 INFO L226 Difference]: Without dead ends: 22 [2018-04-07 02:27:59,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-07 02:27:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-04-07 02:27:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-04-07 02:27:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-04-07 02:27:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-04-07 02:27:59,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 8 [2018-04-07 02:27:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:27:59,241 INFO L459 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-04-07 02:27:59,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-07 02:27:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-04-07 02:27:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-07 02:27:59,242 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:27:59,242 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:27:59,243 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:27:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash -639658124, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:27:59,249 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:27:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:27:59,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:27:59,271 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-04-07 02:27:59,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:27:59,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-07 02:27:59,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-07 02:27:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,292 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:27:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,336 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:27:59,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-04-07 02:27:59,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-07 02:27:59,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-07 02:27:59,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:27:59,338 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2018-04-07 02:27:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:27:59,353 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-04-07 02:27:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-07 02:27:59,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-07 02:27:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:27:59,355 INFO L225 Difference]: With dead ends: 22 [2018-04-07 02:27:59,355 INFO L226 Difference]: Without dead ends: 21 [2018-04-07 02:27:59,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-07 02:27:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-04-07 02:27:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-04-07 02:27:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-04-07 02:27:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-04-07 02:27:59,359 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2018-04-07 02:27:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:27:59,359 INFO L459 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-04-07 02:27:59,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-07 02:27:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-04-07 02:27:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-07 02:27:59,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:27:59,360 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:27:59,360 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:27:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1331501896, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:27:59,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:27:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:27:59,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:27:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,432 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:27:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,564 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:27:59,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-07 02:27:59,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-07 02:27:59,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-07 02:27:59,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-07 02:27:59,565 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2018-04-07 02:27:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:27:59,594 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-04-07 02:27:59,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-07 02:27:59,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-07 02:27:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:27:59,596 INFO L225 Difference]: With dead ends: 34 [2018-04-07 02:27:59,596 INFO L226 Difference]: Without dead ends: 24 [2018-04-07 02:27:59,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-07 02:27:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-04-07 02:27:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-04-07 02:27:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-04-07 02:27:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-04-07 02:27:59,600 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2018-04-07 02:27:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:27:59,600 INFO L459 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-04-07 02:27:59,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-07 02:27:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-04-07 02:27:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-07 02:27:59,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:27:59,601 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:27:59,601 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:27:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash 516113744, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:27:59,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:27:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:27:59,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:27:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,650 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:27:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:27:59,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:27:59,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-07 02:27:59,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-07 02:27:59,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-07 02:27:59,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-07 02:27:59,832 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 10 states. [2018-04-07 02:27:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:27:59,890 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-04-07 02:27:59,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-07 02:27:59,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-07 02:27:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:27:59,891 INFO L225 Difference]: With dead ends: 42 [2018-04-07 02:27:59,891 INFO L226 Difference]: Without dead ends: 32 [2018-04-07 02:27:59,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-07 02:27:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-04-07 02:27:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-04-07 02:27:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-04-07 02:27:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-04-07 02:27:59,896 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-04-07 02:27:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:27:59,896 INFO L459 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-04-07 02:27:59,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-07 02:27:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-04-07 02:27:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-07 02:27:59,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:27:59,897 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:27:59,897 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:27:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash 20237664, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:27:59,903 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:27:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:27:59,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:28:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:00,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:28:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:00,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:28:00,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-07 02:28:00,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-07 02:28:00,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-07 02:28:00,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-04-07 02:28:00,333 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states. [2018-04-07 02:28:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:28:00,414 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-04-07 02:28:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-07 02:28:00,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-04-07 02:28:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:28:00,415 INFO L225 Difference]: With dead ends: 58 [2018-04-07 02:28:00,415 INFO L226 Difference]: Without dead ends: 48 [2018-04-07 02:28:00,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=191, Unknown=0, NotChecked=0, Total=342 [2018-04-07 02:28:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-07 02:28:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-07 02:28:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-07 02:28:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-04-07 02:28:00,421 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 31 [2018-04-07 02:28:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:28:00,421 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-04-07 02:28:00,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-07 02:28:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-04-07 02:28:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-07 02:28:00,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:28:00,423 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:28:00,423 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:28:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1427853952, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:28:00,430 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:28:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:28:00,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:28:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:00,627 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:28:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:01,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:28:01,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-04-07 02:28:01,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-07 02:28:01,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-07 02:28:01,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-04-07 02:28:01,118 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 34 states. [2018-04-07 02:28:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:28:01,357 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-04-07 02:28:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-07 02:28:01,358 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 47 [2018-04-07 02:28:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:28:01,360 INFO L225 Difference]: With dead ends: 90 [2018-04-07 02:28:01,360 INFO L226 Difference]: Without dead ends: 80 [2018-04-07 02:28:01,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=551, Invalid=639, Unknown=0, NotChecked=0, Total=1190 [2018-04-07 02:28:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-07 02:28:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-07 02:28:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-07 02:28:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-04-07 02:28:01,372 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 47 [2018-04-07 02:28:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:28:01,372 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-04-07 02:28:01,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-07 02:28:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-04-07 02:28:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-07 02:28:01,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:28:01,379 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:28:01,379 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:28:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2067246528, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:28:01,388 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:28:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:28:01,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:28:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:01,907 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:28:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:03,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:28:03,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-04-07 02:28:03,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-07 02:28:03,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-07 02:28:03,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-04-07 02:28:03,451 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 66 states. [2018-04-07 02:28:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:28:03,859 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2018-04-07 02:28:03,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-07 02:28:03,859 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 79 [2018-04-07 02:28:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:28:03,860 INFO L225 Difference]: With dead ends: 154 [2018-04-07 02:28:03,861 INFO L226 Difference]: Without dead ends: 144 [2018-04-07 02:28:03,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2119, Invalid=2303, Unknown=0, NotChecked=0, Total=4422 [2018-04-07 02:28:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-07 02:28:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-04-07 02:28:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-07 02:28:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-04-07 02:28:03,876 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 79 [2018-04-07 02:28:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:28:03,876 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-04-07 02:28:03,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-07 02:28:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-04-07 02:28:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-04-07 02:28:03,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:28:03,880 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:28:03,880 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:28:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash -576016832, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:28:03,886 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:28:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:28:03,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:28:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:05,391 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:28:05,621 WARN L148 SmtUtils]: Spent 225ms on a formula simplification that was a NOOP. DAG size: 194 [2018-04-07 02:28:05,923 WARN L148 SmtUtils]: Spent 297ms on a formula simplification that was a NOOP. DAG size: 194 [2018-04-07 02:28:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-07 02:28:09,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-07 02:28:09,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 130 [2018-04-07 02:28:09,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-07 02:28:09,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-07 02:28:09,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7224, Invalid=9546, Unknown=0, NotChecked=0, Total=16770 [2018-04-07 02:28:09,486 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 130 states. [2018-04-07 02:28:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:28:10,024 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2018-04-07 02:28:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-07 02:28:10,025 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 143 [2018-04-07 02:28:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:28:10,027 INFO L225 Difference]: With dead ends: 190 [2018-04-07 02:28:10,027 INFO L226 Difference]: Without dead ends: 180 [2018-04-07 02:28:10,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7292, Invalid=9738, Unknown=0, NotChecked=0, Total=17030 [2018-04-07 02:28:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-07 02:28:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-04-07 02:28:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-07 02:28:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-04-07 02:28:10,052 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 143 [2018-04-07 02:28:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:28:10,053 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-04-07 02:28:10,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-07 02:28:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-04-07 02:28:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-07 02:28:10,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-07 02:28:10,055 INFO L355 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-07 02:28:10,055 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-07 02:28:10,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1665432712, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-07 02:28:10,067 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-07 02:28:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-07 02:28:10,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-07 02:28:10,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-07 02:28:10,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-07 02:28:10,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-07 02:28:10,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-07 02:28:10,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-07 02:28:10,260 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#cstats~0.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#cstats~0.base| 0)) (= 0 (select |c_old(#valid)| |main_~#cstats~0.base|)))) is different from true [2018-04-07 02:28:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2018-04-07 02:28:10,362 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-07 02:28:10,394 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_~#cstats~0.base_19| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_~#cstats~0.base_19| 0)) (not (= 0 (select |c_#valid| |v_main_~#cstats~0.base_19|))))) is different from false [2018-04-07 02:28:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2018-04-07 02:28:10,455 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-07 02:28:10,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2018-04-07 02:28:10,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-07 02:28:10,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-07 02:28:10,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-04-07 02:28:10,456 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 8 states. [2018-04-07 02:28:10,464 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_~#cstats~0.base_19| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_~#cstats~0.base_19| 0)) (not (= 0 (select |c_#valid| |v_main_~#cstats~0.base_19|)))))) is different from false [2018-04-07 02:28:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-07 02:28:10,663 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-04-07 02:28:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-07 02:28:10,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-04-07 02:28:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-07 02:28:10,665 INFO L225 Difference]: With dead ends: 180 [2018-04-07 02:28:10,665 INFO L226 Difference]: Without dead ends: 0 [2018-04-07 02:28:10,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=52, Unknown=3, NotChecked=48, Total=132 [2018-04-07 02:28:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-07 02:28:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-07 02:28:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-07 02:28:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-07 02:28:10,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 179 [2018-04-07 02:28:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-07 02:28:10,667 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-07 02:28:10,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-07 02:28:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-07 02:28:10,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-07 02:28:10,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-04-07 02:28:10,853 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 311 DAG size of output 9 [2018-04-07 02:28:10,916 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,916 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,917 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-04-07 02:28:10,917 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,917 INFO L419 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-04-07 02:28:10,917 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,917 INFO L419 ceAbstractionStarter]: At program point L-1''(line -1) the Hoare annotation is: true [2018-04-07 02:28:10,917 INFO L416 ceAbstractionStarter]: For program point L-1'(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,917 INFO L416 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,918 INFO L416 ceAbstractionStarter]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,918 INFO L416 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,918 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-04-07 02:28:10,918 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-04-07 02:28:10,918 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,918 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-04-07 02:28:10,918 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 25 29) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-04-07 02:28:10,918 INFO L416 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L412 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (= 80 (select |#length| |main_~#cstats~0.base|)) (= |#valid| (store |old(#valid)| |main_~#cstats~0.base| 1)) (= 0 (select |old(#valid)| |main_~#cstats~0.base|)) (= 0 |main_~#cstats~0.offset|)) [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point mainErr1RequiresViolation(line 27) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 25 29) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point mainErr0RequiresViolation(line 27) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 25 29) no Hoare annotation was computed. [2018-04-07 02:28:10,919 INFO L416 ceAbstractionStarter]: For program point mainErr2EnsuresViolationMEMORY_LEAK(lines 25 29) no Hoare annotation was computed. [2018-04-07 02:28:10,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:28:10 BasicIcfg [2018-04-07 02:28:10,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-07 02:28:10,926 INFO L168 Benchmark]: Toolchain (without parser) took 13281.75 ms. Allocated memory was 307.8 MB in the beginning and 572.5 MB in the end (delta: 264.8 MB). Free memory was 252.8 MB in the beginning and 434.4 MB in the end (delta: -181.5 MB). Peak memory consumption was 83.2 MB. Max. memory is 5.3 GB. [2018-04-07 02:28:10,927 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 307.8 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-07 02:28:10,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.19 ms. Allocated memory is still 307.8 MB. Free memory was 252.8 MB in the beginning and 242.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-07 02:28:10,928 INFO L168 Benchmark]: Boogie Preprocessor took 36.85 ms. Allocated memory is still 307.8 MB. Free memory was 242.2 MB in the beginning and 241.2 MB in the end (delta: 997.2 kB). Peak memory consumption was 997.2 kB. Max. memory is 5.3 GB. [2018-04-07 02:28:10,928 INFO L168 Benchmark]: RCFGBuilder took 351.30 ms. Allocated memory was 307.8 MB in the beginning and 454.6 MB in the end (delta: 146.8 MB). Free memory was 241.2 MB in the beginning and 426.0 MB in the end (delta: -184.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-04-07 02:28:10,929 INFO L168 Benchmark]: IcfgTransformer took 679.16 ms. Allocated memory is still 454.6 MB. Free memory was 426.0 MB in the beginning and 368.7 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 5.3 GB. [2018-04-07 02:28:10,929 INFO L168 Benchmark]: TraceAbstraction took 11992.68 ms. Allocated memory was 454.6 MB in the beginning and 572.5 MB in the end (delta: 118.0 MB). Free memory was 368.7 MB in the beginning and 434.4 MB in the end (delta: -65.7 MB). Peak memory consumption was 52.3 MB. Max. memory is 5.3 GB. [2018-04-07 02:28:10,932 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.23 ms. Allocated memory is still 307.8 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.19 ms. Allocated memory is still 307.8 MB. Free memory was 252.8 MB in the beginning and 242.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.85 ms. Allocated memory is still 307.8 MB. Free memory was 242.2 MB in the beginning and 241.2 MB in the end (delta: 997.2 kB). Peak memory consumption was 997.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 351.30 ms. Allocated memory was 307.8 MB in the beginning and 454.6 MB in the end (delta: 146.8 MB). Free memory was 241.2 MB in the beginning and 426.0 MB in the end (delta: -184.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 679.16 ms. Allocated memory is still 454.6 MB. Free memory was 426.0 MB in the beginning and 368.7 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11992.68 ms. Allocated memory was 454.6 MB in the beginning and 572.5 MB in the end (delta: 118.0 MB). Free memory was 368.7 MB in the beginning and 434.4 MB in the end (delta: -65.7 MB). Peak memory consumption was 52.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 148 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 35 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 97.47 RENAME_VARIABLES(MILLISECONDS) : 30.12 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 95.06 PROJECTAWAY(MILLISECONDS) : 196.97 ADD_WEAK_EQUALITY(MILLISECONDS) : 5.55 DISJOIN(MILLISECONDS) : 4.70 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 33.72 ADD_EQUALITY(MILLISECONDS) : 8.73 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.16 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 83 #UNFREEZE : 0 #CONJOIN : 72 #PROJECTAWAY : 84 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 82 #ADD_EQUALITY : 35 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 111.51 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 93.09 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 5.45 JOIN(MILLISECONDS) : 4.24 RENAMEVARS(MILLISECONDS) : 28.58 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 23.90 ISLABELSTRONGERTHAN(MILLISECONDS) : 11.28 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 0.03 UNFREEZE(MILLISECONDS) : 7.38 REPORTCONTAINS(MILLISECONDS) : 0.00 PROJECTAWAY(MILLISECONDS) : 182.82 MEETEDGELABELS(MILLISECONDS) : 11.74 REPORTEQUALITY(MILLISECONDS) : 21.88 ADDALLNODES(MILLISECONDS) : 25.41 REPORTDISEQUALITY(MILLISECONDS) : 0.36 WEQGRAPHJOIN(MILLISECONDS) : 1.36 #FREEZE : 219 #ADDNODE : 0 #MEET : 50 #FILTERREDUNDANT : 0 #REPORTWEQ : 4 #JOIN : 1 #RENAMEVARS : 83 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 19 #ISLABELSTRONGERTHAN : 344 #ISWEQGRAPHSTRONGERTHAN : 8 #UNFREEZE : 240 #REPORTCONTAINS : 0 #PROJECTAWAY : 107 #MEETEDGELABELS : 83 #REPORTEQUALITY : 243 #ADDALLNODES : 50 #REPORTDISEQUALITY : 48 #WEQGRAPHJOIN : 1 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 63.01 REPORT_EQUALITY(MILLISECONDS) : 18.56 FILTERREDUNDANT(MILLISECONDS) : 46.49 ADD_ALL_ELEMENTS(MILLISECONDS) : 6.68 JOIN(MILLISECONDS) : 1.41 ALIGN_ELEMENTS(MILLISECONDS) : 4.21 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 7.83 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 120.26 REPORTCONTAINS(MILLISECONDS) : 0.00 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 13.97 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 34.54 #ADDNODE : 0 #MEET : 242 #REPORT_EQUALITY : 1178 #FILTERREDUNDANT : 1079 #ADD_ALL_ELEMENTS : 307 #JOIN : 1 #ALIGN_ELEMENTS : 32 #COPY : 0 #REPORT_DISEQUALITY : 509 #UNFREEZE : 0 #OVERALL : 4360 #REPORTCONTAINS : 0 #IS_STRONGER_THAN_NO_CACHING : 815 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 197 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 3 error locations. SAFE Result, 11.9s OverallTime, 9 OverallIterations, 80 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 487 SDslu, 394 SDs, 0 SdLazy, 597 SolverSat, 903 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 797 SyntacticMatches, 7 SemanticMatches, 271 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3023 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 87 NumberOfFragments, 30 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1644 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 54 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1056 ConstructedInterpolants, 169 QuantifiedInterpolants, 536292 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1089 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 12800/22760 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/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-07_02-28-10-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-07_02-28-10-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-07_02-28-10-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-07_02-28-10-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-07_02-28-10-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-07_02-28-10-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-07_02-28-10-948.csv Received shutdown request...