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/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-10 03:04:25,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 03:04:25,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 03:04:25,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 03:04:25,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 03:04:25,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 03:04:25,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 03:04:25,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 03:04:25,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 03:04:25,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 03:04:25,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 03:04:25,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 03:04:25,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 03:04:25,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 03:04:25,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 03:04:25,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 03:04:25,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 03:04:25,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 03:04:25,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 03:04:25,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 03:04:25,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 03:04:25,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 03:04:25,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 03:04:25,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 03:04:25,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 03:04:25,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 03:04:25,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 03:04:25,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 03:04:25,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 03:04:25,477 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 03:04:25,478 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 03:04:25,478 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-10 03:04:25,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 03:04:25,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 03:04:25,539 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-10 03:04:25,539 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-10 03:04:25,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-10 03:04:25,540 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-10 03:04:25,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-10 03:04:25,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-10 03:04:25,541 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-10 03:04:25,541 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-10 03:04:25,542 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-10 03:04:25,542 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-10 03:04:25,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 03:04:25,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 03:04:25,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 03:04:25,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 03:04:25,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 03:04:25,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 03:04:25,543 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 03:04:25,543 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-10 03:04:25,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 03:04:25,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 03:04:25,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 03:04:25,544 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-10 03:04:25,545 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-10 03:04:25,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 03:04:25,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 03:04:25,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 03:04:25,545 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 03:04:25,546 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 03:04:25,546 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-10 03:04:25,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-10 03:04:25,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:25,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-10 03:04:25,547 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-10 03:04:25,547 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-10 03:04:25,548 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-10 03:04:25,548 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-10 03:04:25,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 03:04:25,597 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 03:04:25,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 03:04:25,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 03:04:25,604 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 03:04:25,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 03:04:25,894 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd7c162c9b [2018-04-10 03:04:26,029 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 03:04:26,029 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 03:04:26,029 INFO L168 CDTParser]: Scanning ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 03:04:26,030 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 03:04:26,030 INFO L215 ultiparseSymbolTable]: [2018-04-10 03:04:26,030 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 03:04:26,031 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 03:04:26,031 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 03:04:26,031 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 03:04:26,031 INFO L233 ultiparseSymbolTable]: [2018-04-10 03:04:26,046 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd7c162c9b [2018-04-10 03:04:26,050 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 03:04:26,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-04-10 03:04:26,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 03:04:26,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 03:04:26,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 03:04:26,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a540c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26, skipping insertion in model container [2018-04-10 03:04:26,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,078 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 03:04:26,090 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 03:04:26,249 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 03:04:26,277 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 03:04:26,282 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 03:04:26,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26 WrapperNode [2018-04-10 03:04:26,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 03:04:26,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 03:04:26,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 03:04:26,294 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 03:04:26,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 03:04:26,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 03:04:26,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 03:04:26,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 03:04:26,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (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-10 03:04:26,390 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 03:04:26,390 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 03:04:26,390 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-10 03:04:26,391 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 03:04:26,391 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-10 03:04:26,391 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 03:04:26,391 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 03:04:26,391 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 03:04:26,391 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 03:04:26,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 03:04:26,392 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 03:04:26,392 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 03:04:26,392 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 03:04:26,733 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 03:04:26,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:04:26 BoogieIcfgContainer [2018-04-10 03:04:26,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 03:04:26,734 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-04-10 03:04:26,734 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-04-10 03:04:26,735 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-04-10 03:04:26,738 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:04:26" (1/1) ... [2018-04-10 03:04:26,745 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-04-10 03:04:26,745 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-04-10 03:04:26,762 INFO L299 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-04-10 03:04:26,778 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 03:04:26,779 INFO L332 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 2 location literals (each corresponds to one heap write) [2018-04-10 03:04:26,786 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 03:04:26,789 INFO L412 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-04-10 03:04:26,790 DEBUG L416 apSepIcfgTransformer]: storeIndexInfoToLocLiteral: Map: (Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6))) : |mll_L23''_1| (Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|) : |mll_L23''_0| [2018-04-10 03:04:26,792 DEBUG L418 apSepIcfgTransformer]: edgeToIndexToStoreIndexInfo: NestedMap2: (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') : |v_main_~#b~0.base_3| : (Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|) (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') : (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)) : (Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6))) [2018-04-10 03:04:26,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-04-10 03:04:37,279 INFO L314 AbstractInterpreter]: Visited 71 different actions 382 times. Merged at 48 different actions 196 times. Widened at 1 different actions 1 times. Found 23 fixpoints after 8 different actions. Largest state had 31 variables. [2018-04-10 03:04:37,282 INFO L424 apSepIcfgTransformer]: finished equality analysis [2018-04-10 03:04:37,289 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-04-10 03:04:37,290 INFO L434 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-04-10 03:04:37,291 INFO L435 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-04-10 03:04:37,291 INFO L437 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) (+ |v_main_~#b~0.offset_5| (* 4 v_main_~i~1_13))), at (SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L26)) ((select |v_#memory_int_4| |v_main_~#b~0.base_3|), at (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'')) ((select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) (+ (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6) v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 4, 4); srcloc: L15')) [2018-04-10 03:04:37,317 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_31 [2018-04-10 03:04:37,317 DEBUG L374 HeapPartitionManager]: with contents [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-10 03:04:37,317 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_31 [2018-04-10 03:04:37,318 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) (+ |v_main_~#b~0.offset_5| (* 4 v_main_~i~1_13))), at (SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L26)) [2018-04-10 03:04:37,318 DEBUG L325 HeapPartitionManager]: write locations: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-10 03:04:37,318 DEBUG L373 HeapPartitionManager]: creating LocationBlock locs_32 [2018-04-10 03:04:37,318 DEBUG L374 HeapPartitionManager]: with contents [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-10 03:04:37,318 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_32 [2018-04-10 03:04:37,318 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) (+ |v_main_~#b~0.offset_5| (* 4 v_main_~i~1_13))), at (SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L26)) [2018-04-10 03:04:37,318 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-10 03:04:37,319 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_31 [2018-04-10 03:04:37,319 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select |v_#memory_int_4| |v_main_~#b~0.base_3|), at (SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'')) [2018-04-10 03:04:37,319 DEBUG L325 HeapPartitionManager]: write locations: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-10 03:04:37,319 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_31 [2018-04-10 03:04:37,319 DEBUG L324 HeapPartitionManager]: at dimension 0 for ((select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) (+ (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6) v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 4, 4); srcloc: L15')) [2018-04-10 03:04:37,319 DEBUG L325 HeapPartitionManager]: write locations: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-10 03:04:37,320 DEBUG L323 HeapPartitionManager]: adding LocationBlock locs_32 [2018-04-10 03:04:37,320 DEBUG L324 HeapPartitionManager]: at dimension 1 for ((select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) (+ (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6) v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0 * 4, 4); srcloc: L15')) [2018-04-10 03:04:37,320 DEBUG L325 HeapPartitionManager]: write locations: [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-10 03:04:37,320 INFO L330 HeapPartitionManager]: partitioning result: [2018-04-10 03:04:37,320 INFO L335 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-04-10 03:04:37,320 INFO L344 HeapPartitionManager]: at dimension 0 [2018-04-10 03:04:37,320 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-10 03:04:37,320 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-10 03:04:37,321 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-10 03:04:37,321 DEBUG L356 HeapPartitionManager]: [(Store [0] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with |v_main_~#b~0.base_3|)] [2018-04-10 03:04:37,321 INFO L344 HeapPartitionManager]: at dimension 1 [2018-04-10 03:04:37,321 INFO L345 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-04-10 03:04:37,321 INFO L346 HeapPartitionManager]: # location blocks :1 [2018-04-10 03:04:37,321 DEBUG L353 HeapPartitionManager]: location block contents: [2018-04-10 03:04:37,321 DEBUG L356 HeapPartitionManager]: [(Store [1] at(SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + ~i~1 * 4, 4); srcloc: L23'') with (+ |v_main_~#b~0.offset_3| (* 4 v_main_~i~1_6)))] [2018-04-10 03:04:37,323 INFO L134 ransitionTransformer]: executing heap partitioning transformation [2018-04-10 03:04:37,328 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,329 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,329 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,329 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,330 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,330 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,330 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,330 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,331 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,331 DEBUG L331 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-10 03:04:37,332 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,332 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,332 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,332 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,333 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,333 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,333 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,333 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,334 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,334 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,334 DEBUG L356 ransitionTransformer]: {main_~i~1=v_main_~i~1_1} [2018-04-10 03:04:37,334 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,334 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,334 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,335 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,335 DEBUG L331 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-10 03:04:37,335 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,336 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,336 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,336 DEBUG L331 ransitionTransformer]: Formula: (and (= 0 |v_main_~#b~0.offset_1|) (= |v_#valid_9| (store |v_#valid_10| |v_main_~#b~0.base_1| 1)) (not (= 0 |v_main_~#b~0.base_1|)) (= 0 (select |v_#valid_10| |v_main_~#b~0.base_1|)) (= (store |v_#length_4| |v_main_~#b~0.base_1| 400) |v_#length_3|)) InVars {#length=|v_#length_4|, #valid=|v_#valid_10|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_1|, #length=|v_#length_3|, #valid=|v_#valid_9|, main_~#b~0.offset=|v_main_~#b~0.offset_1|} AuxVars[] AssignedVars[main_~#b~0.base, #valid, #length, main_~#b~0.offset] [2018-04-10 03:04:37,336 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,337 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,337 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,337 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,337 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,338 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,338 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,338 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_2 0) InVars {} OutVars{main_~i~1=v_main_~i~1_2} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 03:04:37,338 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,338 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,339 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,339 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,339 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,339 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,340 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,340 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,340 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,340 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,340 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,341 DEBUG L331 ransitionTransformer]: Formula: (not (< v_main_~i~1_3 100)) InVars {main_~i~1=v_main_~i~1_3} OutVars{main_~i~1=v_main_~i~1_3} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,341 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,341 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,341 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,341 DEBUG L331 ransitionTransformer]: Formula: (< v_main_~i~1_4 100) InVars {main_~i~1=v_main_~i~1_4} OutVars{main_~i~1=v_main_~i~1_4} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,342 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,342 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,342 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,342 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_10 0) InVars {} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 03:04:37,343 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,343 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,343 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,343 DEBUG L331 ransitionTransformer]: Formula: (and (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offsetInParam_1| |v_main_~#b~0.offset_11|) (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~sizeInParam_1| v_main_~i~1_19) (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1| v_main_~i~1_19) (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1| |v_main_~#b~0.base_13|)) InVars {main_~#b~0.base=|v_main_~#b~0.base_13|, main_~i~1=v_main_~i~1_19, main_~#b~0.offset=|v_main_~#b~0.offset_11|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_13|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~sizeInParam_1|, main_~i~1=v_main_~i~1_19, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offsetInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1|, main_~#b~0.offset=|v_main_~#b~0.offset_11|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n] [2018-04-10 03:04:37,344 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,344 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,344 DEBUG L356 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~sizeInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offsetInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1|} [2018-04-10 03:04:37,344 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,344 DEBUG L358 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_13|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~sizeInParam_1|, main_~i~1=v_main_~i~1_19, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offsetInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1|, main_~#b~0.offset=|v_main_~#b~0.offset_11|} [2018-04-10 03:04:37,345 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,345 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,345 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,345 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,345 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,346 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,346 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,346 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,346 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,347 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,347 DEBUG L331 ransitionTransformer]: Formula: (and (<= |v_main_#t~ret3_2| 2147483647) (<= 0 (+ |v_main_#t~ret3_2| 2147483648))) InVars {main_#t~ret3=|v_main_#t~ret3_2|} OutVars{main_#t~ret3=|v_main_#t~ret3_2|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,347 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,347 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,348 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,348 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n_1|) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n] [2018-04-10 03:04:37,348 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,348 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,348 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,349 DEBUG L331 ransitionTransformer]: Formula: (not (< v_main_~i~1_11 100)) InVars {main_~i~1=v_main_~i~1_11} OutVars{main_~i~1=v_main_~i~1_11} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,349 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,349 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,349 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,350 DEBUG L331 ransitionTransformer]: Formula: (< v_main_~i~1_12 100) InVars {main_~i~1=v_main_~i~1_12} OutVars{main_~i~1=v_main_~i~1_12} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,350 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,350 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,350 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,351 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-04-10 03:04:37,351 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,351 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,355 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,356 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_6))) (let ((.cse1 (+ |v_main_~#b~0.offset_3| .cse0))) (and (<= (+ |v_main_~#b~0.offset_3| .cse0 4) (select |v_#length_5| |v_main_~#b~0.base_3|)) (= (store |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3| (store (select |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3|) .cse1 |v_main_#t~ret3_3|)) |v_#memory_int_part_locs_31_locs_32_2|) (<= 0 .cse1) (= 1 (select |v_#valid_11| |v_main_~#b~0.base_3|))))) InVars {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_1|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} OutVars{#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_2|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} AuxVars[] AssignedVars[#memory_int_part_locs_31_locs_32] [2018-04-10 03:04:37,356 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 03:04:37,356 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 03:04:37,356 DEBUG L340 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_6))) (let ((.cse1 (+ |v_main_~#b~0.offset_3| .cse0))) (and (<= (+ |v_main_~#b~0.offset_3| .cse0 4) (select |v_#length_5| |v_main_~#b~0.base_3|)) (= (store |v_#memory_int_4| |v_main_~#b~0.base_3| (store (select |v_#memory_int_4| |v_main_~#b~0.base_3|) .cse1 |v_main_#t~ret3_3|)) |v_#memory_int_3|) (<= 0 .cse1) (= 1 (select |v_#valid_11| |v_main_~#b~0.base_3|))))) [2018-04-10 03:04:37,357 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 03:04:37,357 DEBUG L342 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_6))) (let ((.cse1 (+ |v_main_~#b~0.offset_3| .cse0))) (and (<= (+ |v_main_~#b~0.offset_3| .cse0 4) (select |v_#length_5| |v_main_~#b~0.base_3|)) (= (store |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3| (store (select |v_#memory_int_part_locs_31_locs_32_1| |v_main_~#b~0.base_3|) .cse1 |v_main_#t~ret3_3|)) |v_#memory_int_part_locs_31_locs_32_2|) (<= 0 .cse1) (= 1 (select |v_#valid_11| |v_main_~#b~0.base_3|))))) [2018-04-10 03:04:37,357 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 03:04:37,357 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 03:04:37,357 DEBUG L348 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-10 03:04:37,358 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 03:04:37,358 DEBUG L350 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_1|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-10 03:04:37,358 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,358 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,358 DEBUG L356 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-10 03:04:37,358 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,358 DEBUG L358 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_2|, main_~#b~0.base=|v_main_~#b~0.base_3|, main_#t~ret3=|v_main_#t~ret3_3|, #valid=|v_#valid_11|, main_~i~1=v_main_~i~1_6, #length=|v_#length_5|, main_~#b~0.offset=|v_main_~#b~0.offset_3|} [2018-04-10 03:04:37,359 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,359 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,359 DEBUG L331 ransitionTransformer]: Formula: (not (= (select |v_#valid_12| |v_main_~#b~0.base_4|) 1)) InVars {main_~#b~0.base=|v_main_~#b~0.base_4|, #valid=|v_#valid_12|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_4|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,360 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,360 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,360 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,361 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_7))) (or (not (<= 0 (+ .cse0 |v_main_~#b~0.offset_4|))) (not (<= (+ .cse0 |v_main_~#b~0.offset_4| 4) (select |v_#length_6| |v_main_~#b~0.base_5|))))) InVars {main_~#b~0.base=|v_main_~#b~0.base_5|, main_~i~1=v_main_~i~1_7, #length=|v_#length_6|, main_~#b~0.offset=|v_main_~#b~0.offset_4|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_5|, main_~i~1=v_main_~i~1_7, #length=|v_#length_6|, main_~#b~0.offset=|v_main_~#b~0.offset_4|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,361 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,361 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,361 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,362 DEBUG L331 ransitionTransformer]: Formula: (and (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset_1|) (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base_1|)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_1, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset] [2018-04-10 03:04:37,362 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,362 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,363 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,363 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_13))) (let ((.cse1 (+ |v_main_~#b~0.offset_5| .cse0))) (and (= 1 (select |v_#valid_13| |v_main_~#b~0.base_6|)) (<= (+ |v_main_~#b~0.offset_5| .cse0 4) (select |v_#length_7| |v_main_~#b~0.base_6|)) (<= 0 .cse1) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_part_locs_31_locs_32_3| |v_main_~#b~0.base_6|) .cse1))))) InVars {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} OutVars{#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} AuxVars[] AssignedVars[main_#t~mem5] [2018-04-10 03:04:37,363 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 03:04:37,364 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 03:04:37,364 DEBUG L340 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_13))) (let ((.cse1 (+ |v_main_~#b~0.offset_5| .cse0))) (and (= 1 (select |v_#valid_13| |v_main_~#b~0.base_6|)) (<= (+ |v_main_~#b~0.offset_5| .cse0 4) (select |v_#length_7| |v_main_~#b~0.base_6|)) (<= 0 .cse1) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_5| |v_main_~#b~0.base_6|) .cse1))))) [2018-04-10 03:04:37,364 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 03:04:37,364 DEBUG L342 ransitionTransformer]: (let ((.cse0 (* 4 v_main_~i~1_13))) (let ((.cse1 (+ |v_main_~#b~0.offset_5| .cse0))) (and (= 1 (select |v_#valid_13| |v_main_~#b~0.base_6|)) (<= (+ |v_main_~#b~0.offset_5| .cse0 4) (select |v_#length_7| |v_main_~#b~0.base_6|)) (<= 0 .cse1) (= |v_main_#t~mem5_1| (select (select |v_#memory_int_part_locs_31_locs_32_3| |v_main_~#b~0.base_6|) .cse1))))) [2018-04-10 03:04:37,364 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 03:04:37,365 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 03:04:37,365 DEBUG L348 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, main_~i~1=v_main_~i~1_13, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-10 03:04:37,365 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 03:04:37,365 DEBUG L350 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-10 03:04:37,365 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,365 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,366 DEBUG L356 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, main_~i~1=v_main_~i~1_13, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-10 03:04:37,366 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,366 DEBUG L358 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_3|, main_~#b~0.base=|v_main_~#b~0.base_6|, #valid=|v_#valid_13|, main_~i~1=v_main_~i~1_13, main_#t~mem5=|v_main_#t~mem5_1|, #length=|v_#length_7|, main_~#b~0.offset=|v_main_~#b~0.offset_5|} [2018-04-10 03:04:37,366 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,367 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,367 DEBUG L331 ransitionTransformer]: Formula: (not (= (select |v_#valid_14| |v_main_~#b~0.base_7|) 1)) InVars {main_~#b~0.base=|v_main_~#b~0.base_7|, #valid=|v_#valid_14|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_7|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,367 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,367 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,367 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,368 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v_main_~i~1_14))) (or (not (<= 0 (+ |v_main_~#b~0.offset_6| .cse0))) (not (<= (+ |v_main_~#b~0.offset_6| .cse0 4) (select |v_#length_8| |v_main_~#b~0.base_8|))))) InVars {main_~#b~0.base=|v_main_~#b~0.base_8|, main_~i~1=v_main_~i~1_14, #length=|v_#length_8|, main_~#b~0.offset=|v_main_~#b~0.offset_6|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_8|, main_~i~1=v_main_~i~1_14, #length=|v_#length_8|, main_~#b~0.offset=|v_main_~#b~0.offset_6|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,368 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,368 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,369 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,369 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_17| (store |v_#valid_18| |v_main_~#b~0.base_11| 0)) InVars {main_~#b~0.base=|v_main_~#b~0.base_11|, #valid=|v_#valid_18|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_11|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#valid] [2018-04-10 03:04:37,369 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,369 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,369 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,370 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,370 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,370 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,370 DEBUG L356 ransitionTransformer]: {main_#t~ret3=|v_main_#t~ret3_4|} [2018-04-10 03:04:37,370 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,370 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,370 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,371 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,371 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_1 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size_1|) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size] [2018-04-10 03:04:37,371 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,371 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,372 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,372 DEBUG L331 ransitionTransformer]: Formula: (not (= v_main_~i~1_15 |v_main_#t~mem5_2|)) InVars {main_~i~1=v_main_~i~1_15, main_#t~mem5=|v_main_#t~mem5_2|} OutVars{main_~i~1=v_main_~i~1_15, main_#t~mem5=|v_main_#t~mem5_2|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,372 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,372 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,373 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,373 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_16 |v_main_#t~mem5_4|) InVars {main_~i~1=v_main_~i~1_16, main_#t~mem5=|v_main_#t~mem5_4|} OutVars{main_~i~1=v_main_~i~1_16, main_#t~mem5=|v_main_#t~mem5_4|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,373 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,373 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,373 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,374 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,374 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,374 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,374 DEBUG L356 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_12|, main_~#b~0.offset=|v_main_~#b~0.offset_10|} [2018-04-10 03:04:37,374 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,375 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,375 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,375 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,375 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#t~post2_1| v_main_~i~1_8) InVars {main_~i~1=v_main_~i~1_8} OutVars{main_~i~1=v_main_~i~1_8, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2] [2018-04-10 03:04:37,376 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,376 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,376 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,376 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,376 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,377 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,377 DEBUG L356 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_1} [2018-04-10 03:04:37,377 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,377 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,377 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,378 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,378 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,378 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,378 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,378 DEBUG L356 ransitionTransformer]: {main_#t~mem5=|v_main_#t~mem5_3|} [2018-04-10 03:04:37,379 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,379 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,379 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,379 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,379 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,380 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,380 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,380 DEBUG L356 ransitionTransformer]: {main_#t~mem5=|v_main_#t~mem5_5|} [2018-04-10 03:04:37,380 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,380 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,380 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,381 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,381 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_7| |old(#valid)|) InVars {#valid=|v_#valid_7|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_7|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,381 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,381 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,382 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,382 DEBUG L331 ransitionTransformer]: Formula: (not (= |v_#valid_8| |old(#valid)|)) InVars {#valid=|v_#valid_8|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_8|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,382 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,382 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,383 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,383 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_9 (+ |v_main_#t~post2_2| 1)) InVars {main_#t~post2=|v_main_#t~post2_2|} OutVars{main_~i~1=v_main_~i~1_9, main_#t~post2=|v_main_#t~post2_2|} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 03:04:37,383 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,383 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,383 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,384 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,384 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,384 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,384 DEBUG L356 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_1} [2018-04-10 03:04:37,384 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,384 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,384 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,385 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,385 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-04-10 03:04:37,385 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,385 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,386 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,386 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#t~post4_1| v_main_~i~1_17) InVars {main_~i~1=v_main_~i~1_17} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~1=v_main_~i~1_17} AuxVars[] AssignedVars[main_#t~post4] [2018-04-10 03:04:37,386 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,386 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,387 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,387 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,387 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,387 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,387 DEBUG L356 ransitionTransformer]: {main_#t~post2=|v_main_#t~post2_3|} [2018-04-10 03:04:37,387 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,387 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,388 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,388 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,388 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_2 0) InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_2} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0] [2018-04-10 03:04:37,388 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,389 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,389 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,389 DEBUG L331 ransitionTransformer]: Formula: (= |v_#valid_15| (store |v_#valid_16| |v_main_~#b~0.base_9| 0)) InVars {main_~#b~0.base=|v_main_~#b~0.base_9|, #valid=|v_#valid_16|} OutVars{main_~#b~0.base=|v_main_~#b~0.base_9|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid] [2018-04-10 03:04:37,390 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,390 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,390 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,390 DEBUG L331 ransitionTransformer]: Formula: (= v_main_~i~1_18 (+ |v_main_#t~post4_2| 1)) InVars {main_#t~post4=|v_main_#t~post4_2|} OutVars{main_#t~post4=|v_main_#t~post4_2|, main_~i~1=v_main_~i~1_18} AuxVars[] AssignedVars[main_~i~1] [2018-04-10 03:04:37,391 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,391 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,391 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,391 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,391 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,392 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,392 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,392 DEBUG L331 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,392 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,392 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,393 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,393 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,393 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,393 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,393 DEBUG L356 ransitionTransformer]: {main_~#b~0.base=|v_main_~#b~0.base_10|, main_~#b~0.offset=|v_main_~#b~0.offset_8|} [2018-04-10 03:04:37,393 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,394 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,394 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,394 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,394 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,394 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,394 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,395 DEBUG L356 ransitionTransformer]: {main_#t~post4=|v_main_#t~post4_3|} [2018-04-10 03:04:37,395 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,395 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,395 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,395 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,396 DEBUG L331 ransitionTransformer]: Formula: (not (< v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_3 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_2)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_2, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_3} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_2, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_3} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,396 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,396 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,396 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,397 DEBUG L331 ransitionTransformer]: Formula: (< v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_3) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_3, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_4} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size_3, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_4} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,397 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,397 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,397 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,397 DEBUG L331 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res_1| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_11) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_11} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_11} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res] [2018-04-10 03:04:37,397 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,398 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,398 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,398 DEBUG L331 ransitionTransformer]: Formula: (or (not (<= 0 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5)) (not (< v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_2))) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_2} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_5, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n_2} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,398 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,398 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,399 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,399 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,399 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,399 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,399 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,399 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,400 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,400 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,400 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,401 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse1 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6))) (let ((.cse0 (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2))) (and (= (select (select |v_#memory_int_part_locs_31_locs_32_4| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|) (= 1 (select |v_#valid_19| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2 4) (select |v_#length_9| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= 0 .cse0)))) InVars {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} OutVars{#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1] [2018-04-10 03:04:37,401 DEBUG L338 ransitionTransformer]: formula has changed [2018-04-10 03:04:37,401 DEBUG L339 ransitionTransformer]: old formula: [2018-04-10 03:04:37,401 DEBUG L340 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6))) (let ((.cse0 (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2))) (and (= (select (select |v_#memory_int_6| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|) (= 1 (select |v_#valid_19| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2 4) (select |v_#length_9| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= 0 .cse0)))) [2018-04-10 03:04:37,401 DEBUG L341 ransitionTransformer]: new formula: [2018-04-10 03:04:37,402 DEBUG L342 ransitionTransformer]: (let ((.cse1 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6))) (let ((.cse0 (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2))) (and (= (select (select |v_#memory_int_part_locs_31_locs_32_4| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2) .cse0) |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|) (= 1 (select |v_#valid_19| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= (+ .cse1 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2 4) (select |v_#length_9| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2)) (<= 0 .cse0)))) [2018-04-10 03:04:37,402 DEBUG L346 ransitionTransformer]: invars have changed [2018-04-10 03:04:37,402 DEBUG L347 ransitionTransformer]: old invars: [2018-04-10 03:04:37,402 DEBUG L348 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_6|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-10 03:04:37,402 DEBUG L349 ransitionTransformer]: new invars: [2018-04-10 03:04:37,402 DEBUG L350 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-10 03:04:37,403 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,403 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,403 DEBUG L356 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_6|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-10 03:04:37,403 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,403 DEBUG L358 ransitionTransformer]: {#memory_int_part_locs_31_locs_32=|v_#memory_int_part_locs_31_locs_32_4|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_2, #valid=|v_#valid_19|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_6, #length=|v_#length_9|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_2} [2018-04-10 03:04:37,403 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,404 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,404 DEBUG L331 ransitionTransformer]: Formula: (not (= 1 (select |v_#valid_20| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_3))) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_3, #valid=|v_#valid_20|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_3, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,404 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,404 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,405 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,405 DEBUG L331 ransitionTransformer]: Formula: (let ((.cse0 (* 4 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_7))) (or (not (<= (+ .cse0 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3 4) (select |v_#length_10| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_4))) (not (<= 0 (+ .cse0 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3))))) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_7, #length=|v_#length_10|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_4, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_7, #length=|v_#length_10|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base_4, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset_3} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,405 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,405 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,406 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,406 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_2 (store v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_3 v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_8 |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_2|)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_2|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_3, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_8} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_2|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_2, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_8} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0] [2018-04-10 03:04:37,406 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,406 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,407 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,407 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,407 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,407 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,407 DEBUG L356 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_3|} [2018-04-10 03:04:37,407 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,407 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,408 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,408 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,408 DEBUG L331 ransitionTransformer]: Formula: (= |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_1| v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_9) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_9} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_9} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0] [2018-04-10 03:04:37,408 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,408 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,409 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,409 DEBUG L331 ransitionTransformer]: Formula: (= v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_10 (+ |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_2| 1)) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_2|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_2|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_10} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0] [2018-04-10 03:04:37,409 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,409 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,410 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,410 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,410 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,410 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,410 DEBUG L356 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_3|} [2018-04-10 03:04:37,410 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,410 DEBUG L358 ransitionTransformer]: {} [2018-04-10 03:04:37,411 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,411 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,411 DEBUG L331 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-04-10 03:04:37,411 DEBUG L334 ransitionTransformer]: transformula unchanged [2018-04-10 03:04:37,411 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,412 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,412 DEBUG L331 ransitionTransformer]: Formula: (= |v_ULTIMATE.start_#t~ret6_2| |v_main_#resOutParam_1|) InVars {main_#res=|v_main_#resOutParam_1|} OutVars{ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|, main_#res=|v_main_#resOutParam_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret6] [2018-04-10 03:04:37,412 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,412 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,412 DEBUG L356 ransitionTransformer]: {ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|} [2018-04-10 03:04:37,412 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,412 DEBUG L358 ransitionTransformer]: {ULTIMATE.start_#t~ret6=|v_ULTIMATE.start_#t~ret6_2|, main_#res=|v_main_#resOutParam_1|} [2018-04-10 03:04:37,413 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,413 DEBUG L330 ransitionTransformer]: transformed transition [2018-04-10 03:04:37,413 DEBUG L331 ransitionTransformer]: Formula: (= |v_main_#t~ret3_5| |v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#resOutParam_1|) InVars {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#resOutParam_1|} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#resOutParam_1|, main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-04-10 03:04:37,413 DEBUG L354 ransitionTransformer]: outvars have changed [2018-04-10 03:04:37,413 DEBUG L355 ransitionTransformer]: old outvars: [2018-04-10 03:04:37,414 DEBUG L356 ransitionTransformer]: {main_#t~ret3=|v_main_#t~ret3_5|} [2018-04-10 03:04:37,414 DEBUG L357 ransitionTransformer]: new outvars: [2018-04-10 03:04:37,414 DEBUG L358 ransitionTransformer]: {__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#res=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#resOutParam_1|, main_#t~ret3=|v_main_#t~ret3_5|} [2018-04-10 03:04:37,414 DEBUG L360 ransitionTransformer]: [2018-04-10 03:04:37,414 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 03:04:37,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.04 03:04:37 BasicIcfg [2018-04-10 03:04:37,416 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-04-10 03:04:37,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 03:04:37,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 03:04:37,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 03:04:37,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:04:26" (1/4) ... [2018-04-10 03:04:37,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea6dae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:04:37, skipping insertion in model container [2018-04-10 03:04:37,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:04:26" (2/4) ... [2018-04-10 03:04:37,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea6dae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:04:37, skipping insertion in model container [2018-04-10 03:04:37,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:04:26" (3/4) ... [2018-04-10 03:04:37,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea6dae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:04:37, skipping insertion in model container [2018-04-10 03:04:37,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.04 03:04:37" (4/4) ... [2018-04-10 03:04:37,424 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-04-10 03:04:37,431 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 03:04:37,438 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-04-10 03:04:37,471 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 03:04:37,472 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 03:04:37,472 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-10 03:04:37,472 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 03:04:37,472 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 03:04:37,472 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 03:04:37,472 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 03:04:37,473 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 03:04:37,473 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 03:04:37,473 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 03:04:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-04-10 03:04:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 03:04:37,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:37,490 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:37,490 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1794506128, 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-10 03:04:37,506 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:37,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:37,557 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-10 03:04:37,558 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:37,580 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-10 03:04:37,605 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:37,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-10 03:04:37,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-10 03:04:37,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-10 03:04:37,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-10 03:04:37,617 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-04-10 03:04:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:37,641 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-04-10 03:04:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 03:04:37,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-04-10 03:04:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:37,650 INFO L225 Difference]: With dead ends: 119 [2018-04-10 03:04:37,650 INFO L226 Difference]: Without dead ends: 61 [2018-04-10 03:04:37,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-10 03:04:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-10 03:04:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-04-10 03:04:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-10 03:04:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-04-10 03:04:37,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2018-04-10 03:04:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:37,691 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-04-10 03:04:37,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-10 03:04:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-04-10 03:04:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 03:04:37,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:37,692 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:37,692 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash -235425509, 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-10 03:04:37,700 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:37,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:37,759 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-10 03:04:37,760 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:37,790 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-10 03:04:37,813 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:37,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-10 03:04:37,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 03:04:37,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 03:04:37,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 03:04:37,815 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-04-10 03:04:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:37,894 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-04-10 03:04:37,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 03:04:37,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 03:04:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:37,897 INFO L225 Difference]: With dead ends: 108 [2018-04-10 03:04:37,897 INFO L226 Difference]: Without dead ends: 88 [2018-04-10 03:04:37,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-10 03:04:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-10 03:04:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-04-10 03:04:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 03:04:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-04-10 03:04:37,913 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2018-04-10 03:04:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:37,913 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-04-10 03:04:37,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 03:04:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-04-10 03:04:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 03:04:37,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:37,914 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:37,914 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2036720968, 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-10 03:04:37,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:37,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:37,998 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-10 03:04:37,998 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:38,044 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-10 03:04:38,081 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:38,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-04-10 03:04:38,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 03:04:38,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 03:04:38,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 03:04:38,083 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-04-10 03:04:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:38,320 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-04-10 03:04:38,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 03:04:38,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-10 03:04:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:38,325 INFO L225 Difference]: With dead ends: 151 [2018-04-10 03:04:38,325 INFO L226 Difference]: Without dead ends: 97 [2018-04-10 03:04:38,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-10 03:04:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-10 03:04:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-04-10 03:04:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-10 03:04:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-04-10 03:04:38,345 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 21 [2018-04-10 03:04:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:38,345 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-04-10 03:04:38,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 03:04:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-04-10 03:04:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-10 03:04:38,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:38,347 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:38,347 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash -595808487, 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-10 03:04:38,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:38,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:38,408 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-10 03:04:38,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:38,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:38,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 03:04:38,484 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-10 03:04:38,484 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:38,498 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-10 03:04:38,531 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:38,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2018-04-10 03:04:38,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 03:04:38,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 03:04:38,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 03:04:38,532 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2018-04-10 03:04:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:38,598 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-04-10 03:04:38,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 03:04:38,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-10 03:04:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:38,603 INFO L225 Difference]: With dead ends: 77 [2018-04-10 03:04:38,603 INFO L226 Difference]: Without dead ends: 75 [2018-04-10 03:04:38,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 03:04:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-10 03:04:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-10 03:04:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-10 03:04:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-04-10 03:04:38,620 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2018-04-10 03:04:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:38,620 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-04-10 03:04:38,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 03:04:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-04-10 03:04:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-10 03:04:38,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:38,623 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:38,624 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -595808486, now seen corresponding path program 1 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-10 03:04:38,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:38,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:38,715 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-10 03:04:38,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:38,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:38,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:04:38,880 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-10 03:04:38,880 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:39,081 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-10 03:04:39,116 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:39,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-10 03:04:39,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 03:04:39,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 03:04:39,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 03:04:39,117 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 9 states. [2018-04-10 03:04:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:39,224 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-04-10 03:04:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 03:04:39,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-10 03:04:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:39,225 INFO L225 Difference]: With dead ends: 82 [2018-04-10 03:04:39,225 INFO L226 Difference]: Without dead ends: 80 [2018-04-10 03:04:39,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 03:04:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-10 03:04:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-04-10 03:04:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-10 03:04:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-04-10 03:04:39,232 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2018-04-10 03:04:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:39,232 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-04-10 03:04:39,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 03:04:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-04-10 03:04:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 03:04:39,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:39,233 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:39,233 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 37312857, now seen corresponding path program 1 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-10 03:04:39,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:39,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 03:04:39,334 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 03:04:39,405 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:39,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2018-04-10 03:04:39,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 03:04:39,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 03:04:39,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-10 03:04:39,406 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-04-10 03:04:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:39,577 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-04-10 03:04:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 03:04:39,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-04-10 03:04:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:39,578 INFO L225 Difference]: With dead ends: 107 [2018-04-10 03:04:39,578 INFO L226 Difference]: Without dead ends: 106 [2018-04-10 03:04:39,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-10 03:04:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-10 03:04:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2018-04-10 03:04:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 03:04:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-04-10 03:04:39,589 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2018-04-10 03:04:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:39,589 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-04-10 03:04:39,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 03:04:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-04-10 03:04:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 03:04:39,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:39,590 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:39,590 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1522687287, now seen corresponding path program 1 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-10 03:04:39,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:39,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 03:04:39,642 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 03:04:39,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:39,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-10 03:04:39,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 03:04:39,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 03:04:39,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 03:04:39,696 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 8 states. [2018-04-10 03:04:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:39,825 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-04-10 03:04:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 03:04:39,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-04-10 03:04:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:39,827 INFO L225 Difference]: With dead ends: 137 [2018-04-10 03:04:39,827 INFO L226 Difference]: Without dead ends: 115 [2018-04-10 03:04:39,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-10 03:04:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-10 03:04:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2018-04-10 03:04:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-10 03:04:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-04-10 03:04:39,836 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 41 [2018-04-10 03:04:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:39,836 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-04-10 03:04:39,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 03:04:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-04-10 03:04:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 03:04:39,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:39,839 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:39,840 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1156698799, now seen corresponding path program 1 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-10 03:04:39,849 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:39,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:39,900 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-10 03:04:39,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:39,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:39,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 03:04:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 03:04:39,948 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 03:04:39,982 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:39,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2018-04-10 03:04:39,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 03:04:39,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 03:04:39,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 03:04:39,983 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-04-10 03:04:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:40,024 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-10 03:04:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 03:04:40,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-04-10 03:04:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:40,025 INFO L225 Difference]: With dead ends: 96 [2018-04-10 03:04:40,025 INFO L226 Difference]: Without dead ends: 95 [2018-04-10 03:04:40,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 03:04:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-10 03:04:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-10 03:04:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-10 03:04:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-04-10 03:04:40,032 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 42 [2018-04-10 03:04:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:40,033 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-04-10 03:04:40,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 03:04:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-04-10 03:04:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 03:04:40,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:40,034 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:40,034 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1156698800, now seen corresponding path program 1 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-10 03:04:40,043 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:40,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:40,068 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-10 03:04:40,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:40,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:40,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:04:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 03:04:40,128 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 03:04:40,201 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:40,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2018-04-10 03:04:40,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 03:04:40,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 03:04:40,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-10 03:04:40,202 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 11 states. [2018-04-10 03:04:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:40,310 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-04-10 03:04:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 03:04:40,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-10 03:04:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:40,312 INFO L225 Difference]: With dead ends: 104 [2018-04-10 03:04:40,312 INFO L226 Difference]: Without dead ends: 103 [2018-04-10 03:04:40,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-04-10 03:04:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-10 03:04:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-04-10 03:04:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-10 03:04:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-04-10 03:04:40,321 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 42 [2018-04-10 03:04:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:40,322 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-04-10 03:04:40,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 03:04:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-04-10 03:04:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 03:04:40,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:40,323 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:40,323 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash 660976299, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:40,330 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:40,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 03:04:40,377 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 03:04:40,500 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-10 03:04:40,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2018-04-10 03:04:40,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 03:04:40,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 03:04:40,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-10 03:04:40,501 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 10 states. [2018-04-10 03:04:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:40,617 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-04-10 03:04:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 03:04:40,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-10 03:04:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:40,618 INFO L225 Difference]: With dead ends: 179 [2018-04-10 03:04:40,618 INFO L226 Difference]: Without dead ends: 112 [2018-04-10 03:04:40,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-04-10 03:04:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-10 03:04:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-04-10 03:04:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-10 03:04:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-10 03:04:40,626 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 45 [2018-04-10 03:04:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:40,626 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-10 03:04:40,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 03:04:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-10 03:04:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 03:04:40,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:40,627 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:40,628 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1642959647, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:40,637 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:40,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 03:04:40,713 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 03:04:40,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:40,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-04-10 03:04:40,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 03:04:40,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 03:04:40,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-10 03:04:40,779 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 13 states. [2018-04-10 03:04:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:41,015 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2018-04-10 03:04:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 03:04:41,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-04-10 03:04:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:41,017 INFO L225 Difference]: With dead ends: 191 [2018-04-10 03:04:41,018 INFO L226 Difference]: Without dead ends: 127 [2018-04-10 03:04:41,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-04-10 03:04:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-10 03:04:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2018-04-10 03:04:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-10 03:04:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-04-10 03:04:41,039 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 50 [2018-04-10 03:04:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:41,039 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-04-10 03:04:41,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 03:04:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-04-10 03:04:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 03:04:41,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:41,041 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:41,041 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1106887219, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:41,054 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:41,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:41,084 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-10 03:04:41,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:41,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:41,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:04:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 03:04:41,162 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 03:04:41,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:41,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-04-10 03:04:41,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 03:04:41,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 03:04:41,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-10 03:04:41,253 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 11 states. [2018-04-10 03:04:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:41,450 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-04-10 03:04:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 03:04:41,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-04-10 03:04:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:41,451 INFO L225 Difference]: With dead ends: 134 [2018-04-10 03:04:41,451 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 03:04:41,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-04-10 03:04:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 03:04:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-04-10 03:04:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-10 03:04:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-04-10 03:04:41,460 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 54 [2018-04-10 03:04:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:41,461 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-04-10 03:04:41,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 03:04:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-04-10 03:04:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-10 03:04:41,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:41,463 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:41,463 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1097213976, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:41,472 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:41,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 03:04:41,580 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 03:04:41,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:41,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-04-10 03:04:41,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 03:04:41,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 03:04:41,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-04-10 03:04:41,664 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 15 states. [2018-04-10 03:04:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:41,892 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-04-10 03:04:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 03:04:41,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2018-04-10 03:04:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:41,894 INFO L225 Difference]: With dead ends: 149 [2018-04-10 03:04:41,894 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 03:04:41,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-04-10 03:04:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 03:04:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-04-10 03:04:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-10 03:04:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-04-10 03:04:41,907 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 79 [2018-04-10 03:04:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:41,907 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-04-10 03:04:41,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 03:04:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-04-10 03:04:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 03:04:41,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:41,909 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:41,909 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash 346105345, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:41,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:41,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:41,941 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-10 03:04:41,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:41,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:41,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:04:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-10 03:04:42,045 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-10 03:04:42,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:42,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-04-10 03:04:42,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 03:04:42,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 03:04:42,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-04-10 03:04:42,208 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 15 states. [2018-04-10 03:04:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:42,483 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-04-10 03:04:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 03:04:42,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-04-10 03:04:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:42,485 INFO L225 Difference]: With dead ends: 148 [2018-04-10 03:04:42,485 INFO L226 Difference]: Without dead ends: 147 [2018-04-10 03:04:42,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-04-10 03:04:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-10 03:04:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-10 03:04:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-10 03:04:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-04-10 03:04:42,498 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 80 [2018-04-10 03:04:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:42,499 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-04-10 03:04:42,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 03:04:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-04-10 03:04:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 03:04:42,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:42,500 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:42,500 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:42,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1751506738, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:42,508 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:42,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 03:04:42,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 03:04:42,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:42,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-04-10 03:04:42,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 03:04:42,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 03:04:42,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-04-10 03:04:42,740 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 19 states. [2018-04-10 03:04:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:42,997 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2018-04-10 03:04:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 03:04:42,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-04-10 03:04:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:43,000 INFO L225 Difference]: With dead ends: 258 [2018-04-10 03:04:43,000 INFO L226 Difference]: Without dead ends: 182 [2018-04-10 03:04:43,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-04-10 03:04:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-10 03:04:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2018-04-10 03:04:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 03:04:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-04-10 03:04:43,015 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 88 [2018-04-10 03:04:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:43,015 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-04-10 03:04:43,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 03:04:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-04-10 03:04:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-10 03:04:43,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:43,017 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:43,017 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -895613591, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:43,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:43,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-10 03:04:43,154 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-10 03:04:43,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:43,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-04-10 03:04:43,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 03:04:43,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 03:04:43,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-10 03:04:43,282 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 16 states. [2018-04-10 03:04:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:43,531 INFO L93 Difference]: Finished difference Result 260 states and 272 transitions. [2018-04-10 03:04:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 03:04:43,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2018-04-10 03:04:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:43,533 INFO L225 Difference]: With dead ends: 260 [2018-04-10 03:04:43,533 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 03:04:43,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 177 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-04-10 03:04:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 03:04:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2018-04-10 03:04:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 03:04:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2018-04-10 03:04:43,547 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 99 [2018-04-10 03:04:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:43,547 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2018-04-10 03:04:43,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 03:04:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2018-04-10 03:04:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-10 03:04:43,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:43,549 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:43,549 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1767343027, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:43,559 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:43,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-10 03:04:43,647 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-10 03:04:43,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:43,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-10 03:04:43,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 03:04:43,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 03:04:43,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-10 03:04:43,731 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand 16 states. [2018-04-10 03:04:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:43,926 INFO L93 Difference]: Finished difference Result 242 states and 255 transitions. [2018-04-10 03:04:43,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 03:04:43,927 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-04-10 03:04:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:43,929 INFO L225 Difference]: With dead ends: 242 [2018-04-10 03:04:43,929 INFO L226 Difference]: Without dead ends: 220 [2018-04-10 03:04:43,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-10 03:04:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-10 03:04:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 199. [2018-04-10 03:04:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 03:04:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 210 transitions. [2018-04-10 03:04:43,946 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 210 transitions. Word has length 108 [2018-04-10 03:04:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:43,946 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 210 transitions. [2018-04-10 03:04:43,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 03:04:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 210 transitions. [2018-04-10 03:04:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-04-10 03:04:43,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:43,948 INFO L355 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:43,948 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:43,948 INFO L82 PathProgramCache]: Analyzing trace with hash -471724861, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:43,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:43,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 135 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-10 03:04:44,101 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 135 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-10 03:04:44,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:44,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-04-10 03:04:44,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 03:04:44,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 03:04:44,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-10 03:04:44,254 INFO L87 Difference]: Start difference. First operand 199 states and 210 transitions. Second operand 21 states. [2018-04-10 03:04:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:44,858 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-04-10 03:04:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 03:04:44,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2018-04-10 03:04:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:44,861 INFO L225 Difference]: With dead ends: 219 [2018-04-10 03:04:44,862 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 03:04:44,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 224 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 03:04:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 03:04:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2018-04-10 03:04:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 03:04:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 209 transitions. [2018-04-10 03:04:44,874 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 209 transitions. Word has length 126 [2018-04-10 03:04:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:44,874 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 209 transitions. [2018-04-10 03:04:44,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 03:04:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 209 transitions. [2018-04-10 03:04:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-10 03:04:44,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:44,875 INFO L355 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:44,875 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:44,876 INFO L82 PathProgramCache]: Analyzing trace with hash -716005099, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:44,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:44,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 138 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-10 03:04:45,019 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:45,129 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 20 [2018-04-10 03:04:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 138 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-10 03:04:45,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:45,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-04-10 03:04:45,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 03:04:45,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 03:04:45,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-04-10 03:04:45,302 INFO L87 Difference]: Start difference. First operand 199 states and 209 transitions. Second operand 22 states. [2018-04-10 03:04:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:45,692 INFO L93 Difference]: Finished difference Result 318 states and 339 transitions. [2018-04-10 03:04:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 03:04:45,692 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 130 [2018-04-10 03:04:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:45,694 INFO L225 Difference]: With dead ends: 318 [2018-04-10 03:04:45,694 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 03:04:45,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 231 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 03:04:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 03:04:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-04-10 03:04:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 03:04:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-04-10 03:04:45,707 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 130 [2018-04-10 03:04:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:45,708 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-04-10 03:04:45,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 03:04:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-04-10 03:04:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-04-10 03:04:45,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:45,709 INFO L355 BasicCegarLoop]: trace histogram [10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:45,709 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1712590665, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:45,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:45,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-10 03:04:46,020 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-04-10 03:04:46,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:46,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-04-10 03:04:46,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 03:04:46,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 03:04:46,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-04-10 03:04:46,215 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 25 states. [2018-04-10 03:04:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:46,633 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-04-10 03:04:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 03:04:46,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 135 [2018-04-10 03:04:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:46,636 INFO L225 Difference]: With dead ends: 348 [2018-04-10 03:04:46,636 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 03:04:46,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 237 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 03:04:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 03:04:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2018-04-10 03:04:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-10 03:04:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 245 transitions. [2018-04-10 03:04:46,653 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 245 transitions. Word has length 135 [2018-04-10 03:04:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:46,653 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 245 transitions. [2018-04-10 03:04:46,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 03:04:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 245 transitions. [2018-04-10 03:04:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-10 03:04:46,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:46,655 INFO L355 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:46,655 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:46,655 INFO L82 PathProgramCache]: Analyzing trace with hash -350131447, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:46,667 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:46,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:46,724 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-10 03:04:46,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:46,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:46,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:04:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-10 03:04:47,011 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-10 03:04:47,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:47,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-10 03:04:47,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 03:04:47,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 03:04:47,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-04-10 03:04:47,175 INFO L87 Difference]: Start difference. First operand 237 states and 245 transitions. Second operand 19 states. [2018-04-10 03:04:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:47,815 INFO L93 Difference]: Finished difference Result 255 states and 263 transitions. [2018-04-10 03:04:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 03:04:47,816 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 139 [2018-04-10 03:04:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:47,817 INFO L225 Difference]: With dead ends: 255 [2018-04-10 03:04:47,817 INFO L226 Difference]: Without dead ends: 254 [2018-04-10 03:04:47,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 253 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2018-04-10 03:04:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-10 03:04:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2018-04-10 03:04:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-10 03:04:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 246 transitions. [2018-04-10 03:04:47,829 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 246 transitions. Word has length 139 [2018-04-10 03:04:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:47,829 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 246 transitions. [2018-04-10 03:04:47,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 03:04:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 246 transitions. [2018-04-10 03:04:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-10 03:04:47,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:47,831 INFO L355 BasicCegarLoop]: trace histogram [14, 10, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:47,831 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2125191314, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:47,841 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:47,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 302 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-10 03:04:48,020 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 302 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-10 03:04:48,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:48,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 26 [2018-04-10 03:04:48,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 03:04:48,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 03:04:48,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-04-10 03:04:48,213 INFO L87 Difference]: Start difference. First operand 240 states and 246 transitions. Second operand 27 states. [2018-04-10 03:04:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:48,761 INFO L93 Difference]: Finished difference Result 270 states and 279 transitions. [2018-04-10 03:04:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 03:04:48,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 182 [2018-04-10 03:04:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:48,764 INFO L225 Difference]: With dead ends: 270 [2018-04-10 03:04:48,764 INFO L226 Difference]: Without dead ends: 269 [2018-04-10 03:04:48,765 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 329 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1700, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 03:04:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-10 03:04:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248. [2018-04-10 03:04:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 03:04:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 255 transitions. [2018-04-10 03:04:48,779 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 255 transitions. Word has length 182 [2018-04-10 03:04:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:48,780 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 255 transitions. [2018-04-10 03:04:48,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 03:04:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 255 transitions. [2018-04-10 03:04:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-04-10 03:04:48,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:48,781 INFO L355 BasicCegarLoop]: trace histogram [14, 10, 10, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:48,781 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1456421527, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:48,794 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:48,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:48,846 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-10 03:04:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:04:48,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:04:48,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:04:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 242 proven. 39 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-10 03:04:49,111 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 242 proven. 39 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-04-10 03:04:49,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:49,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-10 03:04:49,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 03:04:49,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 03:04:49,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-04-10 03:04:49,414 INFO L87 Difference]: Start difference. First operand 248 states and 255 transitions. Second operand 23 states. [2018-04-10 03:04:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:50,452 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2018-04-10 03:04:50,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 03:04:50,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 183 [2018-04-10 03:04:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:50,455 INFO L225 Difference]: With dead ends: 295 [2018-04-10 03:04:50,456 INFO L226 Difference]: Without dead ends: 294 [2018-04-10 03:04:50,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 341 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 03:04:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-10 03:04:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 276. [2018-04-10 03:04:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-10 03:04:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 289 transitions. [2018-04-10 03:04:50,473 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 289 transitions. Word has length 183 [2018-04-10 03:04:50,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:50,474 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 289 transitions. [2018-04-10 03:04:50,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 03:04:50,474 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 289 transitions. [2018-04-10 03:04:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-04-10 03:04:50,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:50,475 INFO L355 BasicCegarLoop]: trace histogram [15, 11, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:50,475 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:50,475 INFO L82 PathProgramCache]: Analyzing trace with hash -715588152, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:50,481 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:50,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 364 proven. 66 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-10 03:04:50,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 364 proven. 66 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-04-10 03:04:51,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:51,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-04-10 03:04:51,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 03:04:51,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 03:04:51,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-04-10 03:04:51,016 INFO L87 Difference]: Start difference. First operand 276 states and 289 transitions. Second operand 31 states. [2018-04-10 03:04:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:51,569 INFO L93 Difference]: Finished difference Result 466 states and 493 transitions. [2018-04-10 03:04:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 03:04:51,569 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 191 [2018-04-10 03:04:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:51,571 INFO L225 Difference]: With dead ends: 466 [2018-04-10 03:04:51,571 INFO L226 Difference]: Without dead ends: 336 [2018-04-10 03:04:51,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 341 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=492, Invalid=2264, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 03:04:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-10 03:04:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-04-10 03:04:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 03:04:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 336 transitions. [2018-04-10 03:04:51,591 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 336 transitions. Word has length 191 [2018-04-10 03:04:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:51,592 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 336 transitions. [2018-04-10 03:04:51,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 03:04:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 336 transitions. [2018-04-10 03:04:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-10 03:04:51,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:51,594 INFO L355 BasicCegarLoop]: trace histogram [19, 14, 13, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:51,594 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash 719034531, now seen corresponding path program 8 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:51,601 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:51,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 766 proven. 33 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-04-10 03:04:51,839 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 766 proven. 33 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-04-10 03:04:52,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:52,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-04-10 03:04:52,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 03:04:52,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 03:04:52,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-04-10 03:04:52,130 INFO L87 Difference]: Start difference. First operand 323 states and 336 transitions. Second operand 28 states. [2018-04-10 03:04:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:52,596 INFO L93 Difference]: Finished difference Result 471 states and 497 transitions. [2018-04-10 03:04:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 03:04:52,596 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 238 [2018-04-10 03:04:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:52,598 INFO L225 Difference]: With dead ends: 471 [2018-04-10 03:04:52,598 INFO L226 Difference]: Without dead ends: 335 [2018-04-10 03:04:52,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 439 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=412, Invalid=1844, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 03:04:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-10 03:04:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 323. [2018-04-10 03:04:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 03:04:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 334 transitions. [2018-04-10 03:04:52,612 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 334 transitions. Word has length 238 [2018-04-10 03:04:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:52,612 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 334 transitions. [2018-04-10 03:04:52,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 03:04:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 334 transitions. [2018-04-10 03:04:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-10 03:04:52,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:52,614 INFO L355 BasicCegarLoop]: trace histogram [20, 15, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:52,614 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -384850983, now seen corresponding path program 9 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:52,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:52,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 575 proven. 66 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-10 03:04:52,894 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 575 proven. 66 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-10 03:04:53,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:53,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 32 [2018-04-10 03:04:53,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 03:04:53,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 03:04:53,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 03:04:53,161 INFO L87 Difference]: Start difference. First operand 323 states and 334 transitions. Second operand 33 states. [2018-04-10 03:04:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:53,922 INFO L93 Difference]: Finished difference Result 339 states and 350 transitions. [2018-04-10 03:04:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 03:04:53,923 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 247 [2018-04-10 03:04:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:53,925 INFO L225 Difference]: With dead ends: 339 [2018-04-10 03:04:53,925 INFO L226 Difference]: Without dead ends: 338 [2018-04-10 03:04:53,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 450 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=387, Invalid=2583, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 03:04:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-10 03:04:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2018-04-10 03:04:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 03:04:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-04-10 03:04:53,940 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 247 [2018-04-10 03:04:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:53,940 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-04-10 03:04:53,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 03:04:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-04-10 03:04:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-04-10 03:04:53,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:53,941 INFO L355 BasicCegarLoop]: trace histogram [21, 16, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:53,941 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1734865505, now seen corresponding path program 10 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:53,948 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:54,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 675 proven. 105 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-10 03:04:54,236 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 675 proven. 105 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-04-10 03:04:54,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:54,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 37 [2018-04-10 03:04:54,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 03:04:54,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 03:04:54,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 03:04:54,553 INFO L87 Difference]: Start difference. First operand 323 states and 333 transitions. Second operand 37 states. [2018-04-10 03:04:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:55,222 INFO L93 Difference]: Finished difference Result 513 states and 534 transitions. [2018-04-10 03:04:55,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 03:04:55,222 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 256 [2018-04-10 03:04:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:55,224 INFO L225 Difference]: With dead ends: 513 [2018-04-10 03:04:55,225 INFO L226 Difference]: Without dead ends: 392 [2018-04-10 03:04:55,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 463 SyntacticMatches, 13 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=699, Invalid=3333, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 03:04:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-10 03:04:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 379. [2018-04-10 03:04:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-10 03:04:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 389 transitions. [2018-04-10 03:04:55,241 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 389 transitions. Word has length 256 [2018-04-10 03:04:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:55,241 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 389 transitions. [2018-04-10 03:04:55,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 03:04:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 389 transitions. [2018-04-10 03:04:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-10 03:04:55,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:55,243 INFO L355 BasicCegarLoop]: trace histogram [26, 20, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:55,243 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1507726960, now seen corresponding path program 11 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:55,249 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:55,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1393 proven. 62 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-04-10 03:04:55,630 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:55,767 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-10 03:04:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1393 proven. 62 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-04-10 03:04:56,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:56,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 34 [2018-04-10 03:04:56,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 03:04:56,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 03:04:56,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 03:04:56,194 INFO L87 Difference]: Start difference. First operand 379 states and 389 transitions. Second operand 34 states. [2018-04-10 03:04:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:56,816 INFO L93 Difference]: Finished difference Result 518 states and 537 transitions. [2018-04-10 03:04:56,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 03:04:56,817 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 312 [2018-04-10 03:04:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:56,819 INFO L225 Difference]: With dead ends: 518 [2018-04-10 03:04:56,819 INFO L226 Difference]: Without dead ends: 391 [2018-04-10 03:04:56,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 579 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=605, Invalid=2817, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 03:04:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-04-10 03:04:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 379. [2018-04-10 03:04:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-10 03:04:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 387 transitions. [2018-04-10 03:04:56,846 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 387 transitions. Word has length 312 [2018-04-10 03:04:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:56,847 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 387 transitions. [2018-04-10 03:04:56,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 03:04:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 387 transitions. [2018-04-10 03:04:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-04-10 03:04:56,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:56,850 INFO L355 BasicCegarLoop]: trace histogram [27, 21, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:56,850 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1262475496, now seen corresponding path program 12 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:56,859 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:56,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2376 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-10 03:04:57,254 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2376 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-10 03:04:57,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:57,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 38 [2018-04-10 03:04:57,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 03:04:57,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 03:04:57,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 03:04:57,719 INFO L87 Difference]: Start difference. First operand 379 states and 387 transitions. Second operand 39 states. [2018-04-10 03:04:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:04:58,822 INFO L93 Difference]: Finished difference Result 395 states and 402 transitions. [2018-04-10 03:04:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 03:04:58,822 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 321 [2018-04-10 03:04:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:04:58,824 INFO L225 Difference]: With dead ends: 395 [2018-04-10 03:04:58,824 INFO L226 Difference]: Without dead ends: 394 [2018-04-10 03:04:58,825 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 590 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=510, Invalid=3650, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 03:04:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-10 03:04:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 379. [2018-04-10 03:04:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-04-10 03:04:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 386 transitions. [2018-04-10 03:04:58,841 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 386 transitions. Word has length 321 [2018-04-10 03:04:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:04:58,842 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 386 transitions. [2018-04-10 03:04:58,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 03:04:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 386 transitions. [2018-04-10 03:04:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-04-10 03:04:58,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:04:58,845 INFO L355 BasicCegarLoop]: trace histogram [28, 22, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:04:58,845 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:04:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash -983502, now seen corresponding path program 13 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:04:58,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:04:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:04:58,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:04:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1128 proven. 153 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-10 03:04:59,248 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:04:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1128 proven. 153 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-04-10 03:04:59,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:04:59,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 43 [2018-04-10 03:04:59,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 03:04:59,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 03:04:59,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 03:04:59,589 INFO L87 Difference]: Start difference. First operand 379 states and 386 transitions. Second operand 43 states. [2018-04-10 03:05:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:00,773 INFO L93 Difference]: Finished difference Result 572 states and 587 transitions. [2018-04-10 03:05:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 03:05:00,773 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 330 [2018-04-10 03:05:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:00,776 INFO L225 Difference]: With dead ends: 572 [2018-04-10 03:05:00,776 INFO L226 Difference]: Without dead ends: 460 [2018-04-10 03:05:00,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 603 SyntacticMatches, 15 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=942, Invalid=4608, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 03:05:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-04-10 03:05:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2018-04-10 03:05:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-10 03:05:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 451 transitions. [2018-04-10 03:05:00,804 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 451 transitions. Word has length 330 [2018-04-10 03:05:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:00,805 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 451 transitions. [2018-04-10 03:05:00,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 03:05:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 451 transitions. [2018-04-10 03:05:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-04-10 03:05:00,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:00,808 INFO L355 BasicCegarLoop]: trace histogram [27, 20, 20, 20, 20, 20, 20, 20, 20, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:00,808 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 557418089, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:00,823 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:00,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1016 proven. 100 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2018-04-10 03:05:01,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1016 proven. 100 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2018-04-10 03:05:01,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:01,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 40 [2018-04-10 03:05:01,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 03:05:01,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 03:05:01,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 03:05:01,686 INFO L87 Difference]: Start difference. First operand 444 states and 451 transitions. Second operand 40 states. [2018-04-10 03:05:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:02,374 INFO L93 Difference]: Finished difference Result 574 states and 586 transitions. [2018-04-10 03:05:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 03:05:02,375 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 341 [2018-04-10 03:05:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:02,376 INFO L225 Difference]: With dead ends: 574 [2018-04-10 03:05:02,376 INFO L226 Difference]: Without dead ends: 456 [2018-04-10 03:05:02,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 629 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=835, Invalid=3995, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 03:05:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-10 03:05:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 444. [2018-04-10 03:05:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-10 03:05:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 449 transitions. [2018-04-10 03:05:02,400 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 449 transitions. Word has length 341 [2018-04-10 03:05:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:02,400 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 449 transitions. [2018-04-10 03:05:02,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 03:05:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 449 transitions. [2018-04-10 03:05:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-04-10 03:05:02,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:02,404 INFO L355 BasicCegarLoop]: trace histogram [28, 21, 21, 21, 21, 21, 21, 21, 21, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:02,404 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1394418355, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:02,415 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:02,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-10 03:05:02,688 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-10 03:05:03,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:03,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-10 03:05:03,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 03:05:03,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 03:05:03,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-10 03:05:03,034 INFO L87 Difference]: Start difference. First operand 444 states and 449 transitions. Second operand 32 states. [2018-04-10 03:05:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:03,547 INFO L93 Difference]: Finished difference Result 560 states and 581 transitions. [2018-04-10 03:05:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 03:05:03,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2018-04-10 03:05:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:03,551 INFO L225 Difference]: With dead ends: 560 [2018-04-10 03:05:03,551 INFO L226 Difference]: Without dead ends: 538 [2018-04-10 03:05:03,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 03:05:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-04-10 03:05:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 513. [2018-04-10 03:05:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-10 03:05:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 532 transitions. [2018-04-10 03:05:03,589 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 532 transitions. Word has length 350 [2018-04-10 03:05:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:03,589 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 532 transitions. [2018-04-10 03:05:03,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 03:05:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 532 transitions. [2018-04-10 03:05:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-10 03:05:03,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:03,593 INFO L355 BasicCegarLoop]: trace histogram [35, 28, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:03,593 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash 641806531, now seen corresponding path program 14 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:03,606 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:03,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 1547 proven. 153 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-10 03:05:04,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 1547 proven. 153 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-10 03:05:04,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:04,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 44 [2018-04-10 03:05:04,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 03:05:04,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 03:05:04,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 03:05:04,720 INFO L87 Difference]: Start difference. First operand 513 states and 532 transitions. Second operand 45 states. [2018-04-10 03:05:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:05,842 INFO L93 Difference]: Finished difference Result 533 states and 557 transitions. [2018-04-10 03:05:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 03:05:05,842 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 404 [2018-04-10 03:05:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:05,844 INFO L225 Difference]: With dead ends: 533 [2018-04-10 03:05:05,844 INFO L226 Difference]: Without dead ends: 532 [2018-04-10 03:05:05,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 748 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=649, Invalid=4901, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 03:05:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-04-10 03:05:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 513. [2018-04-10 03:05:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-10 03:05:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 531 transitions. [2018-04-10 03:05:05,870 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 531 transitions. Word has length 404 [2018-04-10 03:05:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:05,871 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 531 transitions. [2018-04-10 03:05:05,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 03:05:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 531 transitions. [2018-04-10 03:05:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-04-10 03:05:05,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:05,877 INFO L355 BasicCegarLoop]: trace histogram [35, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:05,877 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -880818923, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:05,887 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:05,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1540 proven. 147 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2018-04-10 03:05:06,519 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1540 proven. 147 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2018-04-10 03:05:07,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:07,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 46 [2018-04-10 03:05:07,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 03:05:07,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 03:05:07,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1770, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 03:05:07,025 INFO L87 Difference]: Start difference. First operand 513 states and 531 transitions. Second operand 46 states. [2018-04-10 03:05:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:08,110 INFO L93 Difference]: Finished difference Result 704 states and 745 transitions. [2018-04-10 03:05:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 03:05:08,110 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 408 [2018-04-10 03:05:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:08,112 INFO L225 Difference]: With dead ends: 704 [2018-04-10 03:05:08,112 INFO L226 Difference]: Without dead ends: 529 [2018-04-10 03:05:08,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 755 SyntacticMatches, 17 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2354 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1102, Invalid=5378, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 03:05:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-10 03:05:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2018-04-10 03:05:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-10 03:05:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 530 transitions. [2018-04-10 03:05:08,147 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 530 transitions. Word has length 408 [2018-04-10 03:05:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:08,148 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 530 transitions. [2018-04-10 03:05:08,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 03:05:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 530 transitions. [2018-04-10 03:05:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-04-10 03:05:08,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:08,154 INFO L355 BasicCegarLoop]: trace histogram [36, 29, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:08,154 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash -430617417, now seen corresponding path program 15 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:08,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:08,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 1750 proven. 210 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-10 03:05:09,253 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 1750 proven. 210 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-04-10 03:05:09,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:09,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 49 [2018-04-10 03:05:09,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 03:05:09,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 03:05:09,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2031, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 03:05:09,762 INFO L87 Difference]: Start difference. First operand 513 states and 530 transitions. Second operand 49 states. [2018-04-10 03:05:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:11,026 INFO L93 Difference]: Finished difference Result 770 states and 803 transitions. [2018-04-10 03:05:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 03:05:11,027 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 413 [2018-04-10 03:05:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:11,029 INFO L225 Difference]: With dead ends: 770 [2018-04-10 03:05:11,029 INFO L226 Difference]: Without dead ends: 598 [2018-04-10 03:05:11,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 761 SyntacticMatches, 17 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1221, Invalid=6089, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 03:05:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-04-10 03:05:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 587. [2018-04-10 03:05:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-04-10 03:05:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 603 transitions. [2018-04-10 03:05:11,055 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 603 transitions. Word has length 413 [2018-04-10 03:05:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:11,056 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 603 transitions. [2018-04-10 03:05:11,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 03:05:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 603 transitions. [2018-04-10 03:05:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-10 03:05:11,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:11,058 INFO L355 BasicCegarLoop]: trace histogram [36, 28, 28, 28, 28, 28, 28, 28, 28, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:11,058 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash -344144119, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:11,065 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:11,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:11,171 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-10 03:05:11,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:05:11,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:05:11,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:05:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-10 03:05:12,054 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-10 03:05:12,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:12,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-10 03:05:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 03:05:12,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 03:05:12,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 03:05:12,766 INFO L87 Difference]: Start difference. First operand 587 states and 603 transitions. Second operand 35 states. [2018-04-10 03:05:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:14,367 INFO L93 Difference]: Finished difference Result 605 states and 621 transitions. [2018-04-10 03:05:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 03:05:14,367 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 417 [2018-04-10 03:05:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:14,370 INFO L225 Difference]: With dead ends: 605 [2018-04-10 03:05:14,371 INFO L226 Difference]: Without dead ends: 604 [2018-04-10 03:05:14,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 785 SyntacticMatches, 15 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1041, Invalid=2991, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 03:05:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-04-10 03:05:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 590. [2018-04-10 03:05:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-10 03:05:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 600 transitions. [2018-04-10 03:05:14,405 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 600 transitions. Word has length 417 [2018-04-10 03:05:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:14,406 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 600 transitions. [2018-04-10 03:05:14,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 03:05:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 600 transitions. [2018-04-10 03:05:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-04-10 03:05:14,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:14,411 INFO L355 BasicCegarLoop]: trace histogram [44, 36, 35, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:14,411 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1407075858, now seen corresponding path program 16 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:14,426 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:14,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6668 backedges. 2300 proven. 210 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-10 03:05:15,103 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6668 backedges. 2300 proven. 210 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-10 03:05:15,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:15,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 50 [2018-04-10 03:05:15,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 03:05:15,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 03:05:15,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 03:05:15,670 INFO L87 Difference]: Start difference. First operand 590 states and 600 transitions. Second operand 51 states. [2018-04-10 03:05:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:17,095 INFO L93 Difference]: Finished difference Result 620 states and 637 transitions. [2018-04-10 03:05:17,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 03:05:17,095 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 496 [2018-04-10 03:05:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:17,097 INFO L225 Difference]: With dead ends: 620 [2018-04-10 03:05:17,097 INFO L226 Difference]: Without dead ends: 619 [2018-04-10 03:05:17,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 925 SyntacticMatches, 19 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=804, Invalid=6336, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 03:05:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-04-10 03:05:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 598. [2018-04-10 03:05:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-10 03:05:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 609 transitions. [2018-04-10 03:05:17,122 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 609 transitions. Word has length 496 [2018-04-10 03:05:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:17,123 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 609 transitions. [2018-04-10 03:05:17,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 03:05:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 609 transitions. [2018-04-10 03:05:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-10 03:05:17,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:17,127 INFO L355 BasicCegarLoop]: trace histogram [44, 36, 36, 35, 35, 35, 35, 35, 35, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:17,127 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash 669678871, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:17,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:17,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:17,245 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-10 03:05:17,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:05:17,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:05:17,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:05:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6703 backedges. 2052 proven. 217 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2018-04-10 03:05:17,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6703 backedges. 2052 proven. 217 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2018-04-10 03:05:18,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:18,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-10 03:05:18,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 03:05:18,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 03:05:18,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 03:05:18,657 INFO L87 Difference]: Start difference. First operand 598 states and 609 transitions. Second operand 39 states. [2018-04-10 03:05:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:20,832 INFO L93 Difference]: Finished difference Result 697 states and 778 transitions. [2018-04-10 03:05:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 03:05:20,832 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 497 [2018-04-10 03:05:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:20,835 INFO L225 Difference]: With dead ends: 697 [2018-04-10 03:05:20,835 INFO L226 Difference]: Without dead ends: 696 [2018-04-10 03:05:20,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 949 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1158, Invalid=3672, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 03:05:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-10 03:05:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 662. [2018-04-10 03:05:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-10 03:05:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 687 transitions. [2018-04-10 03:05:20,867 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 687 transitions. Word has length 497 [2018-04-10 03:05:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:20,867 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 687 transitions. [2018-04-10 03:05:20,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 03:05:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 687 transitions. [2018-04-10 03:05:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-04-10 03:05:20,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:20,871 INFO L355 BasicCegarLoop]: trace histogram [45, 37, 36, 36, 36, 36, 36, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:20,871 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash 575258696, now seen corresponding path program 17 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:20,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:20,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7002 backedges. 2568 proven. 276 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-10 03:05:21,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7002 backedges. 2568 proven. 276 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-04-10 03:05:22,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:22,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 55 [2018-04-10 03:05:22,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 03:05:22,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 03:05:22,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2573, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 03:05:22,010 INFO L87 Difference]: Start difference. First operand 662 states and 687 transitions. Second operand 55 states. [2018-04-10 03:05:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:23,558 INFO L93 Difference]: Finished difference Result 996 states and 1047 transitions. [2018-04-10 03:05:23,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 03:05:23,558 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 505 [2018-04-10 03:05:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:23,560 INFO L225 Difference]: With dead ends: 996 [2018-04-10 03:05:23,561 INFO L226 Difference]: Without dead ends: 758 [2018-04-10 03:05:23,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1051 GetRequests, 937 SyntacticMatches, 19 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1536, Invalid=7776, Unknown=0, NotChecked=0, Total=9312 [2018-04-10 03:05:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-04-10 03:05:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 745. [2018-04-10 03:05:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-10 03:05:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 770 transitions. [2018-04-10 03:05:23,591 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 770 transitions. Word has length 505 [2018-04-10 03:05:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:23,591 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 770 transitions. [2018-04-10 03:05:23,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 03:05:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 770 transitions. [2018-04-10 03:05:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-04-10 03:05:23,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:23,595 INFO L355 BasicCegarLoop]: trace histogram [53, 44, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:23,595 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2068505821, now seen corresponding path program 18 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:23,602 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:23,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9849 backedges. 5188 proven. 203 refuted. 0 times theorem prover too weak. 4458 trivial. 0 not checked. [2018-04-10 03:05:24,221 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9849 backedges. 5188 proven. 203 refuted. 0 times theorem prover too weak. 4458 trivial. 0 not checked. [2018-04-10 03:05:24,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:24,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 52 [2018-04-10 03:05:24,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 03:05:24,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 03:05:24,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 03:05:24,901 INFO L87 Difference]: Start difference. First operand 745 states and 770 transitions. Second operand 52 states. [2018-04-10 03:05:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:25,900 INFO L93 Difference]: Finished difference Result 1001 states and 1055 transitions. [2018-04-10 03:05:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 03:05:25,900 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 588 [2018-04-10 03:05:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:25,902 INFO L225 Difference]: With dead ends: 1001 [2018-04-10 03:05:25,903 INFO L226 Difference]: Without dead ends: 757 [2018-04-10 03:05:25,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1216 GetRequests, 1107 SyntacticMatches, 19 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1406, Invalid=6966, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 03:05:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-10 03:05:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 745. [2018-04-10 03:05:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-10 03:05:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 768 transitions. [2018-04-10 03:05:25,948 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 768 transitions. Word has length 588 [2018-04-10 03:05:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:25,948 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 768 transitions. [2018-04-10 03:05:25,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 03:05:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 768 transitions. [2018-04-10 03:05:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-04-10 03:05:25,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:25,952 INFO L355 BasicCegarLoop]: trace histogram [54, 45, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:25,952 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash 417011801, now seen corresponding path program 19 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:25,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:26,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 3267 proven. 276 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-10 03:05:26,654 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 3267 proven. 276 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-10 03:05:27,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:27,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 56 [2018-04-10 03:05:27,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 03:05:27,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 03:05:27,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 03:05:27,409 INFO L87 Difference]: Start difference. First operand 745 states and 768 transitions. Second operand 57 states. [2018-04-10 03:05:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:29,123 INFO L93 Difference]: Finished difference Result 761 states and 788 transitions. [2018-04-10 03:05:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 03:05:29,124 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 597 [2018-04-10 03:05:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:29,126 INFO L225 Difference]: With dead ends: 761 [2018-04-10 03:05:29,126 INFO L226 Difference]: Without dead ends: 760 [2018-04-10 03:05:29,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1232 GetRequests, 1118 SyntacticMatches, 21 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=975, Invalid=7955, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 03:05:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-10 03:05:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 745. [2018-04-10 03:05:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-04-10 03:05:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 767 transitions. [2018-04-10 03:05:29,154 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 767 transitions. Word has length 597 [2018-04-10 03:05:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:29,155 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 767 transitions. [2018-04-10 03:05:29,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 03:05:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 767 transitions. [2018-04-10 03:05:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-04-10 03:05:29,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:29,158 INFO L355 BasicCegarLoop]: trace histogram [55, 46, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:29,158 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash 938970593, now seen corresponding path program 20 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:29,165 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:29,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10674 backedges. 3609 proven. 351 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-10 03:05:29,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10674 backedges. 3609 proven. 351 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-04-10 03:05:30,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:30,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 61 [2018-04-10 03:05:30,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 03:05:30,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 03:05:30,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=3179, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 03:05:30,565 INFO L87 Difference]: Start difference. First operand 745 states and 767 transitions. Second operand 61 states. [2018-04-10 03:05:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:32,080 INFO L93 Difference]: Finished difference Result 1079 states and 1124 transitions. [2018-04-10 03:05:32,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 03:05:32,080 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 606 [2018-04-10 03:05:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:32,083 INFO L225 Difference]: With dead ends: 1079 [2018-04-10 03:05:32,083 INFO L226 Difference]: Without dead ends: 850 [2018-04-10 03:05:32,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1258 GetRequests, 1131 SyntacticMatches, 21 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1887, Invalid=9669, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 03:05:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-04-10 03:05:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 837. [2018-04-10 03:05:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-10 03:05:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 859 transitions. [2018-04-10 03:05:32,115 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 859 transitions. Word has length 606 [2018-04-10 03:05:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:32,116 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 859 transitions. [2018-04-10 03:05:32,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 03:05:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 859 transitions. [2018-04-10 03:05:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-04-10 03:05:32,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:32,119 INFO L355 BasicCegarLoop]: trace histogram [64, 54, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:32,119 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1792910448, now seen corresponding path program 21 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:32,126 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:32,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14631 backedges. 7271 proven. 268 refuted. 0 times theorem prover too weak. 7092 trivial. 0 not checked. [2018-04-10 03:05:32,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:33,004 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-10 03:05:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14631 backedges. 7271 proven. 268 refuted. 0 times theorem prover too weak. 7092 trivial. 0 not checked. [2018-04-10 03:05:34,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:34,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 58 [2018-04-10 03:05:34,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 03:05:34,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 03:05:34,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=2850, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 03:05:34,087 INFO L87 Difference]: Start difference. First operand 837 states and 859 transitions. Second operand 58 states. [2018-04-10 03:05:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:35,076 INFO L93 Difference]: Finished difference Result 1084 states and 1131 transitions. [2018-04-10 03:05:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 03:05:35,076 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 698 [2018-04-10 03:05:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:35,078 INFO L225 Difference]: With dead ends: 1084 [2018-04-10 03:05:35,078 INFO L226 Difference]: Without dead ends: 849 [2018-04-10 03:05:35,080 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1441 GetRequests, 1319 SyntacticMatches, 21 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3971 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1747, Invalid=8759, Unknown=0, NotChecked=0, Total=10506 [2018-04-10 03:05:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-04-10 03:05:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 837. [2018-04-10 03:05:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-10 03:05:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 857 transitions. [2018-04-10 03:05:35,109 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 857 transitions. Word has length 698 [2018-04-10 03:05:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:35,110 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 857 transitions. [2018-04-10 03:05:35,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 03:05:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 857 transitions. [2018-04-10 03:05:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-04-10 03:05:35,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:35,113 INFO L355 BasicCegarLoop]: trace histogram [65, 55, 54, 54, 54, 54, 54, 54, 54, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:35,113 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 637649896, now seen corresponding path program 22 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:35,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:35,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 4475 proven. 351 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-10 03:05:35,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 4475 proven. 351 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-10 03:05:36,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:36,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 62 [2018-04-10 03:05:36,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 03:05:36,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 03:05:36,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3564, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 03:05:36,859 INFO L87 Difference]: Start difference. First operand 837 states and 857 transitions. Second operand 63 states. [2018-04-10 03:05:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:38,997 INFO L93 Difference]: Finished difference Result 853 states and 876 transitions. [2018-04-10 03:05:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 03:05:38,997 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 707 [2018-04-10 03:05:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:39,000 INFO L225 Difference]: With dead ends: 853 [2018-04-10 03:05:39,000 INFO L226 Difference]: Without dead ends: 852 [2018-04-10 03:05:39,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1456 GetRequests, 1330 SyntacticMatches, 23 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3339 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1162, Invalid=9758, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 03:05:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-04-10 03:05:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 837. [2018-04-10 03:05:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-10 03:05:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 856 transitions. [2018-04-10 03:05:39,042 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 856 transitions. Word has length 707 [2018-04-10 03:05:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:39,043 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 856 transitions. [2018-04-10 03:05:39,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 03:05:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 856 transitions. [2018-04-10 03:05:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2018-04-10 03:05:39,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:39,046 INFO L355 BasicCegarLoop]: trace histogram [66, 56, 55, 55, 55, 55, 55, 55, 55, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:39,047 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:39,047 INFO L82 PathProgramCache]: Analyzing trace with hash 422015794, now seen corresponding path program 23 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:39,054 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:39,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15640 backedges. 4900 proven. 435 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-10 03:05:40,087 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15640 backedges. 4900 proven. 435 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-04-10 03:05:40,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:40,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 67 [2018-04-10 03:05:40,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 03:05:40,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 03:05:40,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3849, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 03:05:40,954 INFO L87 Difference]: Start difference. First operand 837 states and 856 transitions. Second operand 67 states. [2018-04-10 03:05:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:42,784 INFO L93 Difference]: Finished difference Result 1171 states and 1210 transitions. [2018-04-10 03:05:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 03:05:42,784 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 716 [2018-04-10 03:05:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:42,788 INFO L225 Difference]: With dead ends: 1171 [2018-04-10 03:05:42,788 INFO L226 Difference]: Without dead ends: 951 [2018-04-10 03:05:42,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1483 GetRequests, 1343 SyntacticMatches, 23 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3646 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2274, Invalid=11768, Unknown=0, NotChecked=0, Total=14042 [2018-04-10 03:05:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-10 03:05:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 938. [2018-04-10 03:05:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-10 03:05:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 957 transitions. [2018-04-10 03:05:42,842 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 957 transitions. Word has length 716 [2018-04-10 03:05:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:42,843 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 957 transitions. [2018-04-10 03:05:42,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 03:05:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 957 transitions. [2018-04-10 03:05:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-04-10 03:05:42,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:42,848 INFO L355 BasicCegarLoop]: trace histogram [76, 65, 64, 64, 64, 64, 64, 64, 64, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:42,848 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 963149049, now seen corresponding path program 24 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:42,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:43,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20965 backedges. 9853 proven. 342 refuted. 0 times theorem prover too weak. 10770 trivial. 0 not checked. [2018-04-10 03:05:43,942 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:44,283 WARN L148 SmtUtils]: Spent 170ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-10 03:05:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20965 backedges. 9853 proven. 342 refuted. 0 times theorem prover too weak. 10770 trivial. 0 not checked. [2018-04-10 03:05:45,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:45,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 64 [2018-04-10 03:05:45,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 03:05:45,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 03:05:45,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=3486, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 03:05:45,162 INFO L87 Difference]: Start difference. First operand 938 states and 957 transitions. Second operand 64 states. [2018-04-10 03:05:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:46,572 INFO L93 Difference]: Finished difference Result 1176 states and 1216 transitions. [2018-04-10 03:05:46,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 03:05:46,572 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 817 [2018-04-10 03:05:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:46,575 INFO L225 Difference]: With dead ends: 1176 [2018-04-10 03:05:46,575 INFO L226 Difference]: Without dead ends: 950 [2018-04-10 03:05:46,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1549 SyntacticMatches, 23 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4937 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2125, Invalid=10757, Unknown=0, NotChecked=0, Total=12882 [2018-04-10 03:05:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-04-10 03:05:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 938. [2018-04-10 03:05:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-10 03:05:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 955 transitions. [2018-04-10 03:05:46,610 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 955 transitions. Word has length 817 [2018-04-10 03:05:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:46,610 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 955 transitions. [2018-04-10 03:05:46,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 03:05:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 955 transitions. [2018-04-10 03:05:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2018-04-10 03:05:46,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:46,615 INFO L355 BasicCegarLoop]: trace histogram [77, 66, 65, 65, 65, 65, 65, 65, 65, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:46,615 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash -269505853, now seen corresponding path program 25 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:46,621 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:46,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21566 backedges. 5951 proven. 435 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-10 03:05:47,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21566 backedges. 5951 proven. 435 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-10 03:05:48,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:48,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 68 [2018-04-10 03:05:48,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 03:05:48,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 03:05:48,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=4294, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 03:05:48,776 INFO L87 Difference]: Start difference. First operand 938 states and 955 transitions. Second operand 69 states. [2018-04-10 03:05:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:51,416 INFO L93 Difference]: Finished difference Result 954 states and 973 transitions. [2018-04-10 03:05:51,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 03:05:51,416 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 826 [2018-04-10 03:05:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:51,419 INFO L225 Difference]: With dead ends: 954 [2018-04-10 03:05:51,419 INFO L226 Difference]: Without dead ends: 953 [2018-04-10 03:05:51,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1698 GetRequests, 1560 SyntacticMatches, 25 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4047 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1365, Invalid=11745, Unknown=0, NotChecked=0, Total=13110 [2018-04-10 03:05:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-04-10 03:05:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 938. [2018-04-10 03:05:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-10 03:05:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 954 transitions. [2018-04-10 03:05:51,453 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 954 transitions. Word has length 826 [2018-04-10 03:05:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:51,454 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 954 transitions. [2018-04-10 03:05:51,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 03:05:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 954 transitions. [2018-04-10 03:05:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-04-10 03:05:51,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:51,459 INFO L355 BasicCegarLoop]: trace histogram [78, 67, 66, 66, 66, 66, 66, 66, 66, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:51,459 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash 542118583, now seen corresponding path program 26 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:51,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:51,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22176 backedges. 6468 proven. 528 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-10 03:05:52,596 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 22176 backedges. 6468 proven. 528 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-04-10 03:05:53,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:53,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 73 [2018-04-10 03:05:53,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 03:05:53,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 03:05:53,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=4583, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 03:05:53,992 INFO L87 Difference]: Start difference. First operand 938 states and 954 transitions. Second operand 73 states. [2018-04-10 03:05:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:05:56,331 INFO L93 Difference]: Finished difference Result 1272 states and 1305 transitions. [2018-04-10 03:05:56,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 03:05:56,331 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 835 [2018-04-10 03:05:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:05:56,334 INFO L225 Difference]: With dead ends: 1272 [2018-04-10 03:05:56,334 INFO L226 Difference]: Without dead ends: 1061 [2018-04-10 03:05:56,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1726 GetRequests, 1573 SyntacticMatches, 25 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4396 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2697, Invalid=14073, Unknown=0, NotChecked=0, Total=16770 [2018-04-10 03:05:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-04-10 03:05:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1048. [2018-04-10 03:05:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-10 03:05:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1064 transitions. [2018-04-10 03:05:56,375 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1064 transitions. Word has length 835 [2018-04-10 03:05:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:05:56,375 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1064 transitions. [2018-04-10 03:05:56,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 03:05:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1064 transitions. [2018-04-10 03:05:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2018-04-10 03:05:56,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:05:56,381 INFO L355 BasicCegarLoop]: trace histogram [89, 77, 76, 76, 76, 76, 76, 76, 76, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:05:56,381 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:05:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1628900346, now seen corresponding path program 27 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:05:56,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:05:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:05:56,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:05:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 29154 backedges. 12988 proven. 425 refuted. 0 times theorem prover too weak. 15741 trivial. 0 not checked. [2018-04-10 03:05:57,471 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:05:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 29154 backedges. 12988 proven. 425 refuted. 0 times theorem prover too weak. 15741 trivial. 0 not checked. [2018-04-10 03:05:59,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:05:59,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 70 [2018-04-10 03:05:59,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-10 03:05:59,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-10 03:05:59,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=4186, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 03:05:59,609 INFO L87 Difference]: Start difference. First operand 1048 states and 1064 transitions. Second operand 70 states. [2018-04-10 03:06:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:01,283 INFO L93 Difference]: Finished difference Result 1277 states and 1310 transitions. [2018-04-10 03:06:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 03:06:01,284 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 945 [2018-04-10 03:06:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:01,286 INFO L225 Difference]: With dead ends: 1277 [2018-04-10 03:06:01,287 INFO L226 Difference]: Without dead ends: 1060 [2018-04-10 03:06:01,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1945 GetRequests, 1797 SyntacticMatches, 25 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6008 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2540, Invalid=12960, Unknown=0, NotChecked=0, Total=15500 [2018-04-10 03:06:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2018-04-10 03:06:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1048. [2018-04-10 03:06:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-10 03:06:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1062 transitions. [2018-04-10 03:06:01,325 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1062 transitions. Word has length 945 [2018-04-10 03:06:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:01,326 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1062 transitions. [2018-04-10 03:06:01,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-10 03:06:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1062 transitions. [2018-04-10 03:06:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-04-10 03:06:01,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:01,331 INFO L355 BasicCegarLoop]: trace histogram [90, 78, 77, 77, 77, 77, 77, 77, 77, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:01,331 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2050312594, now seen corresponding path program 28 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:01,337 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:01,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 29865 backedges. 7722 proven. 528 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-10 03:06:02,695 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 29865 backedges. 7722 proven. 528 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-10 03:06:03,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:03,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 74 [2018-04-10 03:06:03,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 03:06:03,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 03:06:03,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=5092, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 03:06:03,977 INFO L87 Difference]: Start difference. First operand 1048 states and 1062 transitions. Second operand 75 states. [2018-04-10 03:06:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:07,354 INFO L93 Difference]: Finished difference Result 1064 states and 1079 transitions. [2018-04-10 03:06:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 03:06:07,354 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 954 [2018-04-10 03:06:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:07,357 INFO L225 Difference]: With dead ends: 1064 [2018-04-10 03:06:07,357 INFO L226 Difference]: Without dead ends: 1063 [2018-04-10 03:06:07,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1958 GetRequests, 1808 SyntacticMatches, 27 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4823 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1584, Invalid=13916, Unknown=0, NotChecked=0, Total=15500 [2018-04-10 03:06:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-04-10 03:06:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1048. [2018-04-10 03:06:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-04-10 03:06:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1061 transitions. [2018-04-10 03:06:07,397 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1061 transitions. Word has length 954 [2018-04-10 03:06:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:07,397 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1061 transitions. [2018-04-10 03:06:07,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 03:06:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1061 transitions. [2018-04-10 03:06:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-04-10 03:06:07,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:07,403 INFO L355 BasicCegarLoop]: trace histogram [91, 79, 78, 78, 78, 78, 78, 78, 78, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:07,403 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 786345160, now seen corresponding path program 29 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:07,410 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:07,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30585 backedges. 8340 proven. 630 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-10 03:06:08,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30585 backedges. 8340 proven. 630 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-04-10 03:06:10,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:10,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 79 [2018-04-10 03:06:10,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-10 03:06:10,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-10 03:06:10,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=5381, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 03:06:10,060 INFO L87 Difference]: Start difference. First operand 1048 states and 1061 transitions. Second operand 79 states. [2018-04-10 03:06:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:12,969 INFO L93 Difference]: Finished difference Result 1382 states and 1409 transitions. [2018-04-10 03:06:12,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 03:06:12,970 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 963 [2018-04-10 03:06:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:12,973 INFO L225 Difference]: With dead ends: 1382 [2018-04-10 03:06:12,973 INFO L226 Difference]: Without dead ends: 1180 [2018-04-10 03:06:12,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1987 GetRequests, 1821 SyntacticMatches, 27 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5216 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3156, Invalid=16584, Unknown=0, NotChecked=0, Total=19740 [2018-04-10 03:06:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2018-04-10 03:06:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1167. [2018-04-10 03:06:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-04-10 03:06:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1180 transitions. [2018-04-10 03:06:13,015 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1180 transitions. Word has length 963 [2018-04-10 03:06:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:13,016 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1180 transitions. [2018-04-10 03:06:13,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-10 03:06:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1180 transitions. [2018-04-10 03:06:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1083 [2018-04-10 03:06:13,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:13,024 INFO L355 BasicCegarLoop]: trace histogram [103, 90, 89, 89, 89, 89, 89, 89, 89, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:13,024 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:13,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1404777379, now seen corresponding path program 30 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:13,030 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:13,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 39528 backedges. 16730 proven. 517 refuted. 0 times theorem prover too weak. 22281 trivial. 0 not checked. [2018-04-10 03:06:14,430 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 39528 backedges. 16730 proven. 517 refuted. 0 times theorem prover too weak. 22281 trivial. 0 not checked. [2018-04-10 03:06:16,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:16,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 76 [2018-04-10 03:06:16,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-10 03:06:16,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-10 03:06:16,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=4950, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 03:06:16,039 INFO L87 Difference]: Start difference. First operand 1167 states and 1180 transitions. Second operand 76 states. [2018-04-10 03:06:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:17,955 INFO L93 Difference]: Finished difference Result 1387 states and 1413 transitions. [2018-04-10 03:06:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 03:06:17,956 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 1082 [2018-04-10 03:06:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:17,958 INFO L225 Difference]: With dead ends: 1387 [2018-04-10 03:06:17,959 INFO L226 Difference]: Without dead ends: 1179 [2018-04-10 03:06:17,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2224 GetRequests, 2063 SyntacticMatches, 27 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7184 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2992, Invalid=15368, Unknown=0, NotChecked=0, Total=18360 [2018-04-10 03:06:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-04-10 03:06:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1167. [2018-04-10 03:06:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-04-10 03:06:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1178 transitions. [2018-04-10 03:06:18,008 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1178 transitions. Word has length 1082 [2018-04-10 03:06:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:18,009 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1178 transitions. [2018-04-10 03:06:18,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-10 03:06:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1178 transitions. [2018-04-10 03:06:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2018-04-10 03:06:18,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:18,019 INFO L355 BasicCegarLoop]: trace histogram [104, 91, 90, 90, 90, 90, 90, 90, 90, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:18,019 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1501247193, now seen corresponding path program 31 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:18,028 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:18,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40358 backedges. 9815 proven. 630 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-10 03:06:19,768 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 40358 backedges. 9815 proven. 630 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-10 03:06:21,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:21,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 80 [2018-04-10 03:06:21,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 03:06:21,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 03:06:21,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=5958, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 03:06:21,392 INFO L87 Difference]: Start difference. First operand 1167 states and 1178 transitions. Second operand 81 states. [2018-04-10 03:06:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:24,937 INFO L93 Difference]: Finished difference Result 1183 states and 1194 transitions. [2018-04-10 03:06:24,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 03:06:24,938 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1091 [2018-04-10 03:06:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:24,943 INFO L225 Difference]: With dead ends: 1183 [2018-04-10 03:06:24,943 INFO L226 Difference]: Without dead ends: 1182 [2018-04-10 03:06:24,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2236 GetRequests, 2074 SyntacticMatches, 29 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5667 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1819, Invalid=16271, Unknown=0, NotChecked=0, Total=18090 [2018-04-10 03:06:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-04-10 03:06:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1167. [2018-04-10 03:06:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-04-10 03:06:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1177 transitions. [2018-04-10 03:06:25,021 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1177 transitions. Word has length 1091 [2018-04-10 03:06:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:25,022 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1177 transitions. [2018-04-10 03:06:25,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 03:06:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1177 transitions. [2018-04-10 03:06:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2018-04-10 03:06:25,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:25,037 INFO L355 BasicCegarLoop]: trace histogram [105, 92, 91, 91, 91, 91, 91, 91, 91, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:25,037 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1800519521, now seen corresponding path program 32 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:25,080 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:25,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 41197 backedges. 10543 proven. 741 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-10 03:06:26,833 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 41197 backedges. 10543 proven. 741 refuted. 0 times theorem prover too weak. 29913 trivial. 0 not checked. [2018-04-10 03:06:29,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:29,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 85 [2018-04-10 03:06:29,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-10 03:06:29,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-10 03:06:29,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=897, Invalid=6243, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 03:06:29,155 INFO L87 Difference]: Start difference. First operand 1167 states and 1177 transitions. Second operand 85 states. [2018-04-10 03:06:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:31,691 INFO L93 Difference]: Finished difference Result 1501 states and 1522 transitions. [2018-04-10 03:06:31,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-10 03:06:31,691 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1100 [2018-04-10 03:06:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:31,694 INFO L225 Difference]: With dead ends: 1501 [2018-04-10 03:06:31,695 INFO L226 Difference]: Without dead ends: 1308 [2018-04-10 03:06:31,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2266 GetRequests, 2087 SyntacticMatches, 29 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6106 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3651, Invalid=19301, Unknown=0, NotChecked=0, Total=22952 [2018-04-10 03:06:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-04-10 03:06:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1295. [2018-04-10 03:06:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-04-10 03:06:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1305 transitions. [2018-04-10 03:06:31,751 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1305 transitions. Word has length 1100 [2018-04-10 03:06:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:31,752 INFO L459 AbstractCegarLoop]: Abstraction has 1295 states and 1305 transitions. [2018-04-10 03:06:31,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-10 03:06:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1305 transitions. [2018-04-10 03:06:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-04-10 03:06:31,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:31,765 INFO L355 BasicCegarLoop]: trace histogram [118, 104, 103, 103, 103, 103, 103, 103, 103, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:31,765 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash 733022320, now seen corresponding path program 33 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:31,771 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:31,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 52444 backedges. 21133 proven. 618 refuted. 0 times theorem prover too weak. 30693 trivial. 0 not checked. [2018-04-10 03:06:33,332 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 52444 backedges. 21133 proven. 618 refuted. 0 times theorem prover too weak. 30693 trivial. 0 not checked. [2018-04-10 03:06:35,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:35,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 82 [2018-04-10 03:06:35,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-10 03:06:35,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-10 03:06:35,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=5778, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 03:06:35,060 INFO L87 Difference]: Start difference. First operand 1295 states and 1305 transitions. Second operand 82 states. [2018-04-10 03:06:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:36,689 INFO L93 Difference]: Finished difference Result 1506 states and 1525 transitions. [2018-04-10 03:06:36,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-10 03:06:36,690 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1228 [2018-04-10 03:06:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:36,693 INFO L225 Difference]: With dead ends: 1506 [2018-04-10 03:06:36,693 INFO L226 Difference]: Without dead ends: 1307 [2018-04-10 03:06:36,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2521 GetRequests, 2347 SyntacticMatches, 29 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8465 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3481, Invalid=17981, Unknown=0, NotChecked=0, Total=21462 [2018-04-10 03:06:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2018-04-10 03:06:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1295. [2018-04-10 03:06:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-04-10 03:06:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1303 transitions. [2018-04-10 03:06:36,740 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1303 transitions. Word has length 1228 [2018-04-10 03:06:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:36,740 INFO L459 AbstractCegarLoop]: Abstraction has 1295 states and 1303 transitions. [2018-04-10 03:06:36,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-10 03:06:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1303 transitions. [2018-04-10 03:06:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2018-04-10 03:06:36,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:36,749 INFO L355 BasicCegarLoop]: trace histogram [119, 105, 104, 104, 104, 104, 104, 104, 104, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:36,749 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1580734696, now seen corresponding path program 34 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:36,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:36,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 53402 backedges. 12257 proven. 741 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-10 03:06:38,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 53402 backedges. 12257 proven. 741 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-10 03:06:40,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:40,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 86 [2018-04-10 03:06:40,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-10 03:06:40,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-10 03:06:40,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=6892, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 03:06:40,585 INFO L87 Difference]: Start difference. First operand 1295 states and 1303 transitions. Second operand 87 states. [2018-04-10 03:06:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:44,256 INFO L93 Difference]: Finished difference Result 1311 states and 1318 transitions. [2018-04-10 03:06:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 03:06:44,257 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1237 [2018-04-10 03:06:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:44,260 INFO L225 Difference]: With dead ends: 1311 [2018-04-10 03:06:44,260 INFO L226 Difference]: Without dead ends: 1310 [2018-04-10 03:06:44,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2532 GetRequests, 2358 SyntacticMatches, 31 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6579 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2070, Invalid=18810, Unknown=0, NotChecked=0, Total=20880 [2018-04-10 03:06:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2018-04-10 03:06:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1295. [2018-04-10 03:06:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2018-04-10 03:06:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1302 transitions. [2018-04-10 03:06:44,306 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1302 transitions. Word has length 1237 [2018-04-10 03:06:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:44,307 INFO L459 AbstractCegarLoop]: Abstraction has 1295 states and 1302 transitions. [2018-04-10 03:06:44,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-10 03:06:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1302 transitions. [2018-04-10 03:06:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2018-04-10 03:06:44,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:44,315 INFO L355 BasicCegarLoop]: trace histogram [120, 106, 105, 105, 105, 105, 105, 105, 105, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:44,315 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash 541113906, now seen corresponding path program 35 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:44,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:44,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 54369 backedges. 13104 proven. 861 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-10 03:06:46,008 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 54369 backedges. 13104 proven. 861 refuted. 0 times theorem prover too weak. 40404 trivial. 0 not checked. [2018-04-10 03:06:47,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:47,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 91 [2018-04-10 03:06:47,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-10 03:06:47,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-10 03:06:47,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=7169, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 03:06:47,815 INFO L87 Difference]: Start difference. First operand 1295 states and 1302 transitions. Second operand 91 states. [2018-04-10 03:06:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:51,149 INFO L93 Difference]: Finished difference Result 1632 states and 1647 transitions. [2018-04-10 03:06:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-10 03:06:51,150 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1246 [2018-04-10 03:06:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:51,153 INFO L225 Difference]: With dead ends: 1632 [2018-04-10 03:06:51,153 INFO L226 Difference]: Without dead ends: 1448 [2018-04-10 03:06:51,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2563 GetRequests, 2371 SyntacticMatches, 31 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7066 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4182, Invalid=22224, Unknown=0, NotChecked=0, Total=26406 [2018-04-10 03:06:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-04-10 03:06:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1432. [2018-04-10 03:06:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-04-10 03:06:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1439 transitions. [2018-04-10 03:06:51,205 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1439 transitions. Word has length 1246 [2018-04-10 03:06:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:51,205 INFO L459 AbstractCegarLoop]: Abstraction has 1432 states and 1439 transitions. [2018-04-10 03:06:51,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-10 03:06:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1439 transitions. [2018-04-10 03:06:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2018-04-10 03:06:51,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:51,214 INFO L355 BasicCegarLoop]: trace histogram [119, 104, 104, 104, 104, 104, 104, 104, 104, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:51,214 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1167181417, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:51,221 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:51,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 53454 backedges. 12280 proven. 728 refuted. 0 times theorem prover too weak. 40446 trivial. 0 not checked. [2018-04-10 03:06:52,866 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 53454 backedges. 12280 proven. 728 refuted. 0 times theorem prover too weak. 40446 trivial. 0 not checked. [2018-04-10 03:06:54,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:54,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 88 [2018-04-10 03:06:54,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-10 03:06:54,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-10 03:06:54,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=986, Invalid=6670, Unknown=0, NotChecked=0, Total=7656 [2018-04-10 03:06:54,611 INFO L87 Difference]: Start difference. First operand 1432 states and 1439 transitions. Second operand 88 states. [2018-04-10 03:06:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:06:56,685 INFO L93 Difference]: Finished difference Result 1634 states and 1646 transitions. [2018-04-10 03:06:56,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 03:06:56,685 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1257 [2018-04-10 03:06:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:06:56,688 INFO L225 Difference]: With dead ends: 1634 [2018-04-10 03:06:56,688 INFO L226 Difference]: Without dead ends: 1444 [2018-04-10 03:06:56,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2584 GetRequests, 2397 SyntacticMatches, 31 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9851 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4007, Invalid=20799, Unknown=0, NotChecked=0, Total=24806 [2018-04-10 03:06:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2018-04-10 03:06:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1432. [2018-04-10 03:06:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-04-10 03:06:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1437 transitions. [2018-04-10 03:06:56,738 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1437 transitions. Word has length 1257 [2018-04-10 03:06:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:06:56,739 INFO L459 AbstractCegarLoop]: Abstraction has 1432 states and 1437 transitions. [2018-04-10 03:06:56,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-10 03:06:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1437 transitions. [2018-04-10 03:06:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-04-10 03:06:56,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:06:56,749 INFO L355 BasicCegarLoop]: trace histogram [120, 105, 105, 105, 105, 105, 105, 105, 105, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:06:56,749 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:06:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash -301145421, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:06:56,755 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:06:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:06:56,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:06:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 54420 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-10 03:06:57,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:06:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 54420 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-10 03:06:59,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:06:59,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-10 03:06:59,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 03:06:59,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 03:06:59,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 03:06:59,066 INFO L87 Difference]: Start difference. First operand 1432 states and 1437 transitions. Second operand 64 states. [2018-04-10 03:07:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:07:01,459 INFO L93 Difference]: Finished difference Result 1628 states and 1665 transitions. [2018-04-10 03:07:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 03:07:01,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1266 [2018-04-10 03:07:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:07:01,465 INFO L225 Difference]: With dead ends: 1628 [2018-04-10 03:07:01,465 INFO L226 Difference]: Without dead ends: 1606 [2018-04-10 03:07:01,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2591 GetRequests, 2469 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-10 03:07:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-04-10 03:07:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1573. [2018-04-10 03:07:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-10 03:07:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1608 transitions. [2018-04-10 03:07:01,541 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1608 transitions. Word has length 1266 [2018-04-10 03:07:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:07:01,541 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1608 transitions. [2018-04-10 03:07:01,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 03:07:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1608 transitions. [2018-04-10 03:07:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1393 [2018-04-10 03:07:01,552 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:07:01,552 INFO L355 BasicCegarLoop]: trace histogram [135, 120, 119, 119, 119, 119, 119, 119, 119, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:07:01,552 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:07:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 153877187, now seen corresponding path program 36 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:07:01,559 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:07:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:07:01,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:07:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 69381 backedges. 15075 proven. 861 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-10 03:07:03,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:07:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 69381 backedges. 15075 proven. 861 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-10 03:07:05,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:07:05,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 92 [2018-04-10 03:07:05,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-10 03:07:05,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-10 03:07:05,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=7894, Unknown=0, NotChecked=0, Total=8556 [2018-04-10 03:07:05,606 INFO L87 Difference]: Start difference. First operand 1573 states and 1608 transitions. Second operand 93 states. [2018-04-10 03:07:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:07:10,665 INFO L93 Difference]: Finished difference Result 1593 states and 1641 transitions. [2018-04-10 03:07:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 03:07:10,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1392 [2018-04-10 03:07:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:07:10,669 INFO L225 Difference]: With dead ends: 1593 [2018-04-10 03:07:10,669 INFO L226 Difference]: Without dead ends: 1592 [2018-04-10 03:07:10,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2846 GetRequests, 2660 SyntacticMatches, 33 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7559 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2337, Invalid=21533, Unknown=0, NotChecked=0, Total=23870 [2018-04-10 03:07:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-04-10 03:07:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1573. [2018-04-10 03:07:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-10 03:07:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1607 transitions. [2018-04-10 03:07:10,732 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1607 transitions. Word has length 1392 [2018-04-10 03:07:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:07:10,732 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1607 transitions. [2018-04-10 03:07:10,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-10 03:07:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1607 transitions. [2018-04-10 03:07:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1397 [2018-04-10 03:07:10,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:07:10,743 INFO L355 BasicCegarLoop]: trace histogram [135, 119, 119, 119, 119, 119, 119, 119, 119, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:07:10,743 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:07:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1207275285, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:07:10,751 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:07:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:07:11,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:07:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 69337 backedges. 15000 proven. 847 refuted. 0 times theorem prover too weak. 53490 trivial. 0 not checked. [2018-04-10 03:07:12,832 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:07:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 69337 backedges. 15000 proven. 847 refuted. 0 times theorem prover too weak. 53490 trivial. 0 not checked. [2018-04-10 03:07:14,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:07:14,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 94 [2018-04-10 03:07:14,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-10 03:07:14,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-10 03:07:14,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=7626, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 03:07:14,986 INFO L87 Difference]: Start difference. First operand 1573 states and 1607 transitions. Second operand 94 states. [2018-04-10 03:07:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:07:17,213 INFO L93 Difference]: Finished difference Result 1908 states and 1989 transitions. [2018-04-10 03:07:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-10 03:07:17,213 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1396 [2018-04-10 03:07:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:07:17,216 INFO L225 Difference]: With dead ends: 1908 [2018-04-10 03:07:17,216 INFO L226 Difference]: Without dead ends: 1589 [2018-04-10 03:07:17,219 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2867 GetRequests, 2667 SyntacticMatches, 33 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11342 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4570, Invalid=23822, Unknown=0, NotChecked=0, Total=28392 [2018-04-10 03:07:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-04-10 03:07:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1573. [2018-04-10 03:07:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-10 03:07:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1606 transitions. [2018-04-10 03:07:17,312 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1606 transitions. Word has length 1396 [2018-04-10 03:07:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:07:17,313 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1606 transitions. [2018-04-10 03:07:17,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-10 03:07:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1606 transitions. [2018-04-10 03:07:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1402 [2018-04-10 03:07:17,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:07:17,329 INFO L355 BasicCegarLoop]: trace histogram [136, 121, 120, 120, 120, 120, 120, 120, 120, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:07:17,329 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:07:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1645362505, now seen corresponding path program 37 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:07:17,337 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:07:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:07:17,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:07:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 70485 backedges. 16050 proven. 990 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-10 03:07:19,401 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:07:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 70485 backedges. 16050 proven. 990 refuted. 0 times theorem prover too weak. 53445 trivial. 0 not checked. [2018-04-10 03:07:22,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:07:22,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 97 [2018-04-10 03:07:22,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-10 03:07:22,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-10 03:07:22,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=8159, Unknown=0, NotChecked=0, Total=9312 [2018-04-10 03:07:22,120 INFO L87 Difference]: Start difference. First operand 1573 states and 1606 transitions. Second operand 97 states. [2018-04-10 03:07:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:07:24,923 INFO L93 Difference]: Finished difference Result 2046 states and 2111 transitions. [2018-04-10 03:07:24,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 03:07:24,923 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1401 [2018-04-10 03:07:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:07:24,927 INFO L225 Difference]: With dead ends: 2046 [2018-04-10 03:07:24,927 INFO L226 Difference]: Without dead ends: 1730 [2018-04-10 03:07:24,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2878 GetRequests, 2673 SyntacticMatches, 33 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8096 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4749, Invalid=25353, Unknown=0, NotChecked=0, Total=30102 [2018-04-10 03:07:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-04-10 03:07:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1719. [2018-04-10 03:07:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-04-10 03:07:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 1751 transitions. [2018-04-10 03:07:24,993 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 1751 transitions. Word has length 1401 [2018-04-10 03:07:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:07:24,994 INFO L459 AbstractCegarLoop]: Abstraction has 1719 states and 1751 transitions. [2018-04-10 03:07:24,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-10 03:07:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 1751 transitions. [2018-04-10 03:07:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2018-04-10 03:07:25,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:07:25,004 INFO L355 BasicCegarLoop]: trace histogram [136, 120, 120, 120, 120, 120, 120, 120, 120, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:07:25,004 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:07:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1779811063, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:07:25,011 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:07:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:07:25,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:07:25,295 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-10 03:07:25,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:07:25,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:07:25,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:07:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 70440 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-10 03:07:29,309 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:07:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 70440 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-10 03:07:31,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:07:31,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-04-10 03:07:31,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 03:07:31,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 03:07:31,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=3715, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 03:07:31,396 INFO L87 Difference]: Start difference. First operand 1719 states and 1751 transitions. Second operand 67 states. [2018-04-10 03:07:33,760 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 121 DAG size of output 24 [2018-04-10 03:07:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:07:38,135 INFO L93 Difference]: Finished difference Result 1737 states and 1769 transitions. [2018-04-10 03:07:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 03:07:38,135 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1405 [2018-04-10 03:07:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:07:38,138 INFO L225 Difference]: With dead ends: 1737 [2018-04-10 03:07:38,139 INFO L226 Difference]: Without dead ends: 1736 [2018-04-10 03:07:38,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2870 GetRequests, 2713 SyntacticMatches, 31 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3788 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3881, Invalid=12375, Unknown=0, NotChecked=0, Total=16256 [2018-04-10 03:07:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2018-04-10 03:07:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1722. [2018-04-10 03:07:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2018-04-10 03:07:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 1740 transitions. [2018-04-10 03:07:38,253 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 1740 transitions. Word has length 1405 [2018-04-10 03:07:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:07:38,254 INFO L459 AbstractCegarLoop]: Abstraction has 1722 states and 1740 transitions. [2018-04-10 03:07:38,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 03:07:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 1740 transitions. [2018-04-10 03:07:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1557 [2018-04-10 03:07:38,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:07:38,274 INFO L355 BasicCegarLoop]: trace histogram [152, 136, 135, 135, 135, 135, 135, 135, 135, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:07:38,274 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:07:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1823892242, now seen corresponding path program 38 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:07:38,287 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:07:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:07:38,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:07:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 88706 backedges. 18296 proven. 990 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-10 03:07:40,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:07:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 88706 backedges. 18296 proven. 990 refuted. 0 times theorem prover too weak. 69420 trivial. 0 not checked. [2018-04-10 03:07:43,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:07:43,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 98 [2018-04-10 03:07:43,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-10 03:07:43,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-10 03:07:43,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=738, Invalid=8964, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 03:07:43,617 INFO L87 Difference]: Start difference. First operand 1722 states and 1740 transitions. Second operand 99 states. [2018-04-10 03:07:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:07:48,463 INFO L93 Difference]: Finished difference Result 1752 states and 1785 transitions. [2018-04-10 03:07:48,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 03:07:48,463 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1556 [2018-04-10 03:07:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:07:48,468 INFO L225 Difference]: With dead ends: 1752 [2018-04-10 03:07:48,469 INFO L226 Difference]: Without dead ends: 1751 [2018-04-10 03:07:48,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3179 GetRequests, 2981 SyntacticMatches, 35 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8607 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2620, Invalid=24440, Unknown=0, NotChecked=0, Total=27060 [2018-04-10 03:07:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2018-04-10 03:07:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1730. [2018-04-10 03:07:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2018-04-10 03:07:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 1749 transitions. [2018-04-10 03:07:48,585 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 1749 transitions. Word has length 1556 [2018-04-10 03:07:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:07:48,587 INFO L459 AbstractCegarLoop]: Abstraction has 1730 states and 1749 transitions. [2018-04-10 03:07:48,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-10 03:07:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 1749 transitions. [2018-04-10 03:07:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2018-04-10 03:07:48,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:07:48,606 INFO L355 BasicCegarLoop]: trace histogram [152, 136, 136, 135, 135, 135, 135, 135, 135, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:07:48,606 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:07:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 706084887, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:07:48,617 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 03:07:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:07:49,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:07:49,046 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-10 03:07:49,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 03:07:49,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 03:07:49,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 03:07:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 88841 backedges. 17288 proven. 1005 refuted. 0 times theorem prover too weak. 70548 trivial. 0 not checked. [2018-04-10 03:07:53,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-10 03:07:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 88841 backedges. 17288 proven. 1005 refuted. 0 times theorem prover too weak. 70548 trivial. 0 not checked. [2018-04-10 03:07:55,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 03:07:55,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-04-10 03:07:55,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 03:07:55,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 03:07:55,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4251, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 03:07:55,901 INFO L87 Difference]: Start difference. First operand 1730 states and 1749 transitions. Second operand 71 states. [2018-04-10 03:07:59,177 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 126 DAG size of output 29 [2018-04-10 03:07:59,418 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 122 DAG size of output 28 [2018-04-10 03:08:03,267 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 59 DAG size of output 28 [2018-04-10 03:08:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 03:08:04,632 INFO L93 Difference]: Finished difference Result 1933 states and 2222 transitions. [2018-04-10 03:08:04,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 03:08:04,632 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1557 [2018-04-10 03:08:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 03:08:04,637 INFO L225 Difference]: With dead ends: 1933 [2018-04-10 03:08:04,637 INFO L226 Difference]: Without dead ends: 1932 [2018-04-10 03:08:04,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3192 GetRequests, 3029 SyntacticMatches, 31 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4094, Invalid=13728, Unknown=0, NotChecked=0, Total=17822 [2018-04-10 03:08:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2018-04-10 03:08:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1866. [2018-04-10 03:08:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-04-10 03:08:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 1915 transitions. [2018-04-10 03:08:04,720 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 1915 transitions. Word has length 1557 [2018-04-10 03:08:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 03:08:04,721 INFO L459 AbstractCegarLoop]: Abstraction has 1866 states and 1915 transitions. [2018-04-10 03:08:04,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 03:08:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 1915 transitions. [2018-04-10 03:08:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-04-10 03:08:04,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 03:08:04,734 INFO L355 BasicCegarLoop]: trace histogram [153, 137, 136, 136, 136, 136, 136, 136, 136, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 03:08:04,734 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 03:08:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash -834518200, now seen corresponding path program 39 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-10 03:08:04,752 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-04-10 03:08:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 03:08:05,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 03:08:05,140 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 03:08:05,141 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 03:08:05,145 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 03:08:05,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:08:05 BasicIcfg [2018-04-10 03:08:05,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 03:08:05,147 INFO L168 Benchmark]: Toolchain (without parser) took 219096.22 ms. Allocated memory was 311.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 251.9 MB in the beginning and 423.2 MB in the end (delta: -171.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-04-10 03:08:05,148 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 311.4 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 03:08:05,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.52 ms. Allocated memory is still 311.4 MB. Free memory was 251.9 MB in the beginning and 241.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-10 03:08:05,148 INFO L168 Benchmark]: Boogie Preprocessor took 35.47 ms. Allocated memory is still 311.4 MB. Free memory was 241.8 MB in the beginning and 240.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-04-10 03:08:05,149 INFO L168 Benchmark]: RCFGBuilder took 404.35 ms. Allocated memory was 311.4 MB in the beginning and 475.0 MB in the end (delta: 163.6 MB). Free memory was 239.8 MB in the beginning and 440.3 MB in the end (delta: -200.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-04-10 03:08:05,149 INFO L168 Benchmark]: IcfgTransformer took 10681.93 ms. Allocated memory was 475.0 MB in the beginning and 675.8 MB in the end (delta: 200.8 MB). Free memory was 440.3 MB in the beginning and 486.4 MB in the end (delta: -46.1 MB). Peak memory consumption was 154.7 MB. Max. memory is 5.3 GB. [2018-04-10 03:08:05,149 INFO L168 Benchmark]: TraceAbstraction took 207728.87 ms. Allocated memory was 675.8 MB in the beginning and 2.3 GB in the end (delta: 1.6 GB). Free memory was 486.4 MB in the beginning and 423.2 MB in the end (delta: 63.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-04-10 03:08:05,152 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.20 ms. Allocated memory is still 311.4 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.52 ms. Allocated memory is still 311.4 MB. Free memory was 251.9 MB in the beginning and 241.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.47 ms. Allocated memory is still 311.4 MB. Free memory was 241.8 MB in the beginning and 240.8 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 404.35 ms. Allocated memory was 311.4 MB in the beginning and 475.0 MB in the end (delta: 163.6 MB). Free memory was 239.8 MB in the beginning and 440.3 MB in the end (delta: -200.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 10681.93 ms. Allocated memory was 475.0 MB in the beginning and 675.8 MB in the end (delta: 200.8 MB). Free memory was 440.3 MB in the beginning and 486.4 MB in the end (delta: -46.1 MB). Peak memory consumption was 154.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 207728.87 ms. Allocated memory was 675.8 MB in the beginning and 2.3 GB in the end (delta: 1.6 GB). Free memory was 486.4 MB in the beginning and 423.2 MB in the end (delta: 63.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 61 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 568 LocStat_NO_SUPPORTING_DISEQUALITIES : 207 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 77 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 78 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2034.24 RENAME_VARIABLES(MILLISECONDS) : 277.41 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 2041.25 PROJECTAWAY(MILLISECONDS) : 3613.14 ADD_WEAK_EQUALITY(MILLISECONDS) : 8.57 DISJOIN(MILLISECONDS) : 127.48 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 303.43 ADD_EQUALITY(MILLISECONDS) : 10.33 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.33 #CONJOIN_DISJUNCTIVE : 395 #RENAME_VARIABLES : 834 #UNFREEZE : 0 #CONJOIN : 503 #PROJECTAWAY : 515 #ADD_WEAK_EQUALITY : 10 #DISJOIN : 126 #RENAME_VARIABLES_DISJUNCTIVE : 824 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 5752.52 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 2023.99 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 8.36 JOIN(MILLISECONDS) : 118.85 RENAMEVARS(MILLISECONDS) : 266.64 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 3544.89 ISLABELSTRONGERTHAN(MILLISECONDS) : 567.21 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 69.30 UNFREEZE(MILLISECONDS) : 84.72 REPORTCONTAINS(MILLISECONDS) : 0.55 PROJECTAWAY(MILLISECONDS) : 3450.70 MEETEDGELABELS(MILLISECONDS) : 204.05 REPORTEQUALITY(MILLISECONDS) : 295.99 ADDALLNODES(MILLISECONDS) : 320.29 REPORTDISEQUALITY(MILLISECONDS) : 3.95 WEQGRAPHJOIN(MILLISECONDS) : 46.73 #FREEZE : 3075 #ADDNODE : 0 #MEET : 334 #FILTERREDUNDANT : 0 #REPORTWEQ : 10 #JOIN : 126 #RENAMEVARS : 834 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 837 #ISLABELSTRONGERTHAN : 38706 #ISWEQGRAPHSTRONGERTHAN : 407 #UNFREEZE : 2081 #REPORTCONTAINS : 21 #PROJECTAWAY : 913 #MEETEDGELABELS : 1570 #REPORTEQUALITY : 3240 #ADDALLNODES : 334 #REPORTDISEQUALITY : 886 #WEQGRAPHJOIN : 126 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 2631.80 REPORT_EQUALITY(MILLISECONDS) : 919.73 FILTERREDUNDANT(MILLISECONDS) : 2080.35 ADD_ALL_ELEMENTS(MILLISECONDS) : 397.73 JOIN(MILLISECONDS) : 49.43 ALIGN_ELEMENTS(MILLISECONDS) : 250.88 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 185.41 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 4219.37 REPORTCONTAINS(MILLISECONDS) : 16.60 IS_STRONGER_THAN_NO_CACHING(MILLISECONDS) : 645.35 REMOVE(MILLISECONDS) : 0.00 IS_STRONGER_THAN_W_CACHING(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 759.42 #ADDNODE : 0 #MEET : 8743 #REPORT_EQUALITY : 78262 #FILTERREDUNDANT : 89076 #ADD_ALL_ELEMENTS : 14920 #JOIN : 126 #ALIGN_ELEMENTS : 2723 #COPY : 0 #REPORT_DISEQUALITY : 25707 #UNFREEZE : 0 #OVERALL : 315669 #REPORTCONTAINS : 704 #IS_STRONGER_THAN_NO_CACHING : 86715 #REMOVE : 0 #IS_STRONGER_THAN_W_CACHING : 0 #PROJECT_TO_ELEMENTS : 8693 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 1566 with TraceHistMax 153, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. TIMEOUT Result, 207.6s OverallTime, 66 OverallIterations, 153 TraceHistogramMax, 98.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5992 SDtfs, 35461 SDslu, 102855 SDs, 0 SdLazy, 92146 SolverSat, 8397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72054 GetRequests, 66126 SyntacticMatches, 1009 SemanticMatches, 4919 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170247 ImplicationChecksByTransitivity, 105.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1866occurred in iteration=65, 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: 2.0s AutomataMinimizationTime, 65 MinimizatonAttempts, 1012 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 96.9s InterpolantComputationTime, 34956 NumberOfCodeBlocks, 34956 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 69782 ConstructedInterpolants, 3495 QuantifiedInterpolants, 158713622 SizeOfPredicates, 1733 NumberOfNonLiveVariables, 67905 ConjunctsInSsa, 2312 ConjunctsInUnsatCore, 130 InterpolantComputations, 18 PerfectInterpolantSequences, 2229426/2267174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-04-10_03-08-05-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-04-10_03-08-05-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-04-10_03-08-05-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-1-2018-04-10_03-08-05-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-2-2018-04-10_03-08-05-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-04-10_03-08-05-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_03-08-05-172.csv Completed graceful shutdown