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-1cf7e2d-m [2018-03-29 23:52:47,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 23:52:47,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 23:52:47,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 23:52:47,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 23:52:47,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 23:52:47,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 23:52:47,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 23:52:47,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 23:52:47,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 23:52:47,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 23:52:47,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 23:52:47,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 23:52:47,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 23:52:47,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 23:52:47,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 23:52:47,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 23:52:47,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 23:52:47,407 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 23:52:47,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 23:52:47,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 23:52:47,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 23:52:47,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 23:52:47,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 23:52:47,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 23:52:47,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 23:52:47,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 23:52:47,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 23:52:47,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 23:52:47,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 23:52:47,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 23:52:47,417 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-03-29 23:52:47,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 23:52:47,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 23:52:47,441 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 23:52:47,441 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 23:52:47,442 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 23:52:47,442 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 23:52:47,442 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 23:52:47,442 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 23:52:47,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 23:52:47,443 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 23:52:47,443 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 23:52:47,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 23:52:47,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 23:52:47,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 23:52:47,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 23:52:47,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 23:52:47,445 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 23:52:47,445 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 23:52:47,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 23:52:47,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 23:52:47,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 23:52:47,446 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 23:52:47,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 23:52:47,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 23:52:47,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 23:52:47,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 23:52:47,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 23:52:47,447 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 23:52:47,448 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 23:52:47,448 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 23:52:47,448 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 23:52:47,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 23:52:47,490 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 23:52:47,493 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 23:52:47,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 23:52:47,495 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 23:52:47,496 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-03-29 23:52:47,810 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9af72c336 [2018-03-29 23:52:47,913 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 23:52:47,913 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 23:52:47,914 INFO L168 CDTParser]: Scanning ArraysOfVariableLength_true-valid-memsafety.c [2018-03-29 23:52:47,915 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 23:52:47,915 INFO L215 ultiparseSymbolTable]: [2018-03-29 23:52:47,915 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 23:52:47,915 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength_true-valid-memsafety.c [2018-03-29 23:52:47,915 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength_true-valid-memsafety.c [2018-03-29 23:52:47,915 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 23:52:47,915 INFO L233 ultiparseSymbolTable]: [2018-03-29 23:52:47,930 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9af72c336 [2018-03-29 23:52:47,935 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 23:52:47,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-03-29 23:52:47,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 23:52:47,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 23:52:47,947 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 23:52:47,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 11:52:47" (1/1) ... [2018-03-29 23:52:47,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6374826e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:47, skipping insertion in model container [2018-03-29 23:52:47,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 11:52:47" (1/1) ... [2018-03-29 23:52:47,965 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 23:52:47,979 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 23:52:48,118 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 23:52:48,139 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 23:52:48,144 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-29 23:52:48,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48 WrapperNode [2018-03-29 23:52:48,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 23:52:48,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 23:52:48,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 23:52:48,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 23:52:48,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 23:52:48,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 23:52:48,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 23:52:48,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 23:52:48,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (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-03-29 23:52:48,252 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 23:52:48,252 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 23:52:48,252 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-03-29 23:52:48,252 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 23:52:48,252 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-03-29 23:52:48,252 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 23:52:48,253 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 23:52:48,539 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 23:52:48,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 11:52:48 BoogieIcfgContainer [2018-03-29 23:52:48,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 23:52:48,540 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-03-29 23:52:48,540 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-03-29 23:52:48,541 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-03-29 23:52:48,543 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 11:52:48" (1/1) ... [2018-03-29 23:52:48,550 INFO L139 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-03-29 23:52:48,551 INFO L140 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-03-29 23:52:48,565 INFO L298 apSepIcfgTransformer]: Heap separator: starting memloc-array-style preprocessing [2018-03-29 23:52:48,577 INFO L333 apSepIcfgTransformer]: finished MemlocArrayUpdater, created 2 location literals (each corresponds to one heap write) [2018-03-29 23:52:48,586 INFO L393 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-03-29 23:52:48,587 DEBUG L397 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-03-29 23:52:48,590 DEBUG L399 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-03-29 23:52:48,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-03-29 23:53:09,449 INFO L314 AbstractInterpreter]: Visited 70 different actions 416 times. Merged at 48 different actions 226 times. Widened at 2 different actions 2 times. Found 24 fixpoints after 7 different actions. Largest state had 31 variables. [2018-03-29 23:53:09,452 INFO L405 apSepIcfgTransformer]: finished equality analysis [2018-03-29 23:53:09,459 INFO L195 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 3 [2018-03-29 23:53:09,460 INFO L415 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-03-29 23:53:09,460 INFO L416 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-03-29 23:53:09,461 INFO L418 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-03-29 23:53:09,501 DEBUG L379 HeapPartitionManager]: creating LocationBlock locs_31 [2018-03-29 23:53:09,502 DEBUG L380 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-03-29 23:53:09,502 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_31 [2018-03-29 23:53:09,502 DEBUG L330 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-03-29 23:53:09,502 DEBUG L331 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-03-29 23:53:09,502 DEBUG L379 HeapPartitionManager]: creating LocationBlock locs_32 [2018-03-29 23:53:09,502 DEBUG L380 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-03-29 23:53:09,503 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_32 [2018-03-29 23:53:09,503 DEBUG L330 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-03-29 23:53:09,503 DEBUG L331 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-03-29 23:53:09,503 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_31 [2018-03-29 23:53:09,503 DEBUG L330 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-03-29 23:53:09,503 DEBUG L331 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-03-29 23:53:09,503 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_31 [2018-03-29 23:53:09,504 DEBUG L330 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-03-29 23:53:09,504 DEBUG L331 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-03-29 23:53:09,504 DEBUG L329 HeapPartitionManager]: adding LocationBlock locs_32 [2018-03-29 23:53:09,504 DEBUG L330 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-03-29 23:53:09,504 DEBUG L331 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-03-29 23:53:09,504 INFO L336 HeapPartitionManager]: partitioning result: [2018-03-29 23:53:09,504 INFO L341 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-03-29 23:53:09,504 INFO L350 HeapPartitionManager]: at dimension 0 [2018-03-29 23:53:09,505 INFO L351 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-29 23:53:09,505 INFO L352 HeapPartitionManager]: # location blocks :1 [2018-03-29 23:53:09,505 DEBUG L359 HeapPartitionManager]: location block contents: [2018-03-29 23:53:09,505 DEBUG L362 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-03-29 23:53:09,505 INFO L350 HeapPartitionManager]: at dimension 1 [2018-03-29 23:53:09,505 INFO L351 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-03-29 23:53:09,505 INFO L352 HeapPartitionManager]: # location blocks :1 [2018-03-29 23:53:09,505 DEBUG L359 HeapPartitionManager]: location block contents: [2018-03-29 23:53:09,505 DEBUG L362 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-03-29 23:53:09,506 INFO L124 ransitionTransformer]: executing heap partitioning transformation [2018-03-29 23:53:09,509 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,509 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,510 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,510 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,510 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,510 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,511 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,511 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,511 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,511 DEBUG L259 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-03-29 23:53:09,512 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,512 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,512 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,512 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,512 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,513 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,513 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,513 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_~i~1=v_main_~i~1_1} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:53:09,513 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,513 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,514 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,514 DEBUG L259 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-03-29 23:53:09,514 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,514 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,514 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,514 DEBUG L259 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-03-29 23:53:09,514 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,514 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,515 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,515 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,515 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,515 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,515 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,515 DEBUG L259 ransitionTransformer]: Formula: (= v_main_~i~1_2 0) InVars {} OutVars{main_~i~1=v_main_~i~1_2} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:53:09,515 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,515 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,516 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,516 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,516 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,516 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,516 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,516 DEBUG L259 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,516 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,516 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,517 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,517 DEBUG L259 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-03-29 23:53:09,517 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,517 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,517 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,517 DEBUG L259 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-03-29 23:53:09,518 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,518 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,518 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,518 DEBUG L259 ransitionTransformer]: Formula: (= v_main_~i~1_10 0) InVars {} OutVars{main_~i~1=v_main_~i~1_10} AuxVars[] AssignedVars[main_~i~1] [2018-03-29 23:53:09,518 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,518 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,519 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,519 DEBUG L259 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{__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~b.base=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.baseInParam_1|, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~nInParam_1|} 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-03-29 23:53:09,519 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,519 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,520 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,520 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,520 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,520 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,520 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,520 DEBUG L259 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,520 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,521 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,521 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,521 DEBUG L259 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-03-29 23:53:09,521 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,521 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,522 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,522 DEBUG L259 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-03-29 23:53:09,522 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,522 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,522 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,523 DEBUG L259 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-03-29 23:53:09,523 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,523 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,523 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,523 DEBUG L259 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-03-29 23:53:09,523 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,524 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,524 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,524 DEBUG L259 ransitionTransformer]: Formula: (= |v_main_#res_2| 0) InVars {} OutVars{main_#res=|v_main_#res_2|} AuxVars[] AssignedVars[main_#res] [2018-03-29 23:53:09,524 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,524 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,527 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,528 DEBUG L259 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-03-29 23:53:09,528 DEBUG L266 ransitionTransformer]: formula has changed [2018-03-29 23:53:09,528 DEBUG L267 ransitionTransformer]: old formula: [2018-03-29 23:53:09,528 DEBUG L268 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-03-29 23:53:09,528 DEBUG L269 ransitionTransformer]: new formula: [2018-03-29 23:53:09,528 DEBUG L270 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-03-29 23:53:09,529 DEBUG L274 ransitionTransformer]: invars have changed [2018-03-29 23:53:09,529 DEBUG L275 ransitionTransformer]: old invars: [2018-03-29 23:53:09,529 DEBUG L276 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-03-29 23:53:09,529 DEBUG L277 ransitionTransformer]: new invars: [2018-03-29 23:53:09,529 DEBUG L278 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-03-29 23:53:09,529 DEBUG L282 ransitionTransformer]: outvars have changed [2018-03-29 23:53:09,530 DEBUG L283 ransitionTransformer]: old outvars: [2018-03-29 23:53:09,530 DEBUG L284 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-03-29 23:53:09,530 DEBUG L285 ransitionTransformer]: new outvars: [2018-03-29 23:53:09,530 DEBUG L286 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-03-29 23:53:09,530 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,530 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,530 DEBUG L259 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-03-29 23:53:09,531 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,531 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,531 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,531 DEBUG L259 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-03-29 23:53:09,531 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,531 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,532 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,532 DEBUG L259 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-03-29 23:53:09,532 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,532 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,533 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,533 DEBUG L259 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-03-29 23:53:09,533 DEBUG L266 ransitionTransformer]: formula has changed [2018-03-29 23:53:09,533 DEBUG L267 ransitionTransformer]: old formula: [2018-03-29 23:53:09,533 DEBUG L268 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-03-29 23:53:09,533 DEBUG L269 ransitionTransformer]: new formula: [2018-03-29 23:53:09,534 DEBUG L270 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-03-29 23:53:09,534 DEBUG L274 ransitionTransformer]: invars have changed [2018-03-29 23:53:09,534 DEBUG L275 ransitionTransformer]: old invars: [2018-03-29 23:53:09,534 DEBUG L276 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-03-29 23:53:09,534 DEBUG L277 ransitionTransformer]: new invars: [2018-03-29 23:53:09,534 DEBUG L278 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-03-29 23:53:09,534 DEBUG L282 ransitionTransformer]: outvars have changed [2018-03-29 23:53:09,534 DEBUG L283 ransitionTransformer]: old outvars: [2018-03-29 23:53:09,535 DEBUG L284 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-03-29 23:53:09,535 DEBUG L285 ransitionTransformer]: new outvars: [2018-03-29 23:53:09,535 DEBUG L286 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-03-29 23:53:09,535 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,535 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,535 DEBUG L259 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-03-29 23:53:09,535 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,536 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,536 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,536 DEBUG L259 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-03-29 23:53:09,536 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,536 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,537 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,537 DEBUG L259 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-03-29 23:53:09,537 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,537 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,538 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,538 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~ret3=|v_main_#t~ret3_4|} AuxVars[] AssignedVars[main_#t~ret3] [2018-03-29 23:53:09,538 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,538 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,538 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,539 DEBUG L259 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-03-29 23:53:09,539 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,539 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,539 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,539 DEBUG L259 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-03-29 23:53:09,540 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,540 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,540 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,540 DEBUG L259 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-03-29 23:53:09,540 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,540 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,541 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,541 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#b~0.base=|v_main_~#b~0.base_12|, main_~#b~0.offset=|v_main_~#b~0.offset_10|} AuxVars[] AssignedVars[main_~#b~0.base, main_~#b~0.offset] [2018-03-29 23:53:09,541 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,541 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,542 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,542 DEBUG L259 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-03-29 23:53:09,542 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,542 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,542 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,542 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~a~0] [2018-03-29 23:53:09,542 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,542 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,543 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,543 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~mem5=|v_main_#t~mem5_3|} AuxVars[] AssignedVars[main_#t~mem5] [2018-03-29 23:53:09,543 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,543 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,543 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,543 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~mem5=|v_main_#t~mem5_5|} AuxVars[] AssignedVars[main_#t~mem5] [2018-03-29 23:53:09,543 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,543 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,544 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,544 DEBUG L259 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-03-29 23:53:09,544 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,544 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,545 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,545 DEBUG L259 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-03-29 23:53:09,545 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,545 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,545 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,545 DEBUG L259 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-03-29 23:53:09,545 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,545 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,546 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,546 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0=v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0_1} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0] [2018-03-29 23:53:09,546 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,546 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,546 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,547 DEBUG L259 ransitionTransformer]: Formula: (= |v_main_#res_1| 1) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-03-29 23:53:09,547 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,547 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,547 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,547 DEBUG L259 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-03-29 23:53:09,547 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,548 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,548 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,548 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post2=|v_main_#t~post2_3|} AuxVars[] AssignedVars[main_#t~post2] [2018-03-29 23:53:09,548 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,548 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,549 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,549 DEBUG L259 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-03-29 23:53:09,549 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,549 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,549 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,550 DEBUG L259 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-03-29 23:53:09,550 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,550 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,550 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,550 DEBUG L259 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-03-29 23:53:09,551 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,551 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,551 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,551 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,551 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,551 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,552 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,552 DEBUG L259 ransitionTransformer]: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,552 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,552 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,552 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,552 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_~#b~0.base=|v_main_~#b~0.base_10|, main_~#b~0.offset=|v_main_~#b~0.offset_8|} AuxVars[] AssignedVars[main_~#b~0.base, main_~#b~0.offset] [2018-03-29 23:53:09,552 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,553 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,553 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,553 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_#t~post4] [2018-03-29 23:53:09,553 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,553 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,553 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,553 DEBUG L259 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-03-29 23:53:09,554 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,554 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,554 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,554 DEBUG L259 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-03-29 23:53:09,554 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,554 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,555 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,555 DEBUG L259 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-03-29 23:53:09,555 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,555 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,555 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,556 DEBUG L259 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-03-29 23:53:09,556 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,556 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,556 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,556 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,557 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,557 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,557 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,557 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,557 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,557 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,558 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,558 DEBUG L259 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-03-29 23:53:09,558 DEBUG L266 ransitionTransformer]: formula has changed [2018-03-29 23:53:09,559 DEBUG L267 ransitionTransformer]: old formula: [2018-03-29 23:53:09,559 DEBUG L268 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-03-29 23:53:09,559 DEBUG L269 ransitionTransformer]: new formula: [2018-03-29 23:53:09,559 DEBUG L270 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-03-29 23:53:09,559 DEBUG L274 ransitionTransformer]: invars have changed [2018-03-29 23:53:09,559 DEBUG L275 ransitionTransformer]: old invars: [2018-03-29 23:53:09,560 DEBUG L276 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-03-29 23:53:09,560 DEBUG L277 ransitionTransformer]: new invars: [2018-03-29 23:53:09,560 DEBUG L278 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-03-29 23:53:09,560 DEBUG L282 ransitionTransformer]: outvars have changed [2018-03-29 23:53:09,560 DEBUG L283 ransitionTransformer]: old outvars: [2018-03-29 23:53:09,560 DEBUG L284 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-03-29 23:53:09,561 DEBUG L285 ransitionTransformer]: new outvars: [2018-03-29 23:53:09,561 DEBUG L286 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-03-29 23:53:09,561 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,561 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,562 DEBUG L259 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-03-29 23:53:09,562 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,562 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,562 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,562 DEBUG L259 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-03-29 23:53:09,563 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,563 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,563 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,563 DEBUG L259 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-03-29 23:53:09,563 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,564 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,564 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,564 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~mem1] [2018-03-29 23:53:09,564 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,564 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,564 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,565 DEBUG L259 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-03-29 23:53:09,565 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,565 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,565 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,565 DEBUG L259 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-03-29 23:53:09,566 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,566 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,566 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,566 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0=|v___U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0_3|} AuxVars[] AssignedVars[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#t~post0] [2018-03-29 23:53:09,566 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,566 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,567 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,567 DEBUG L259 ransitionTransformer]: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-03-29 23:53:09,567 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,567 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,567 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,568 DEBUG L259 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|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret6] [2018-03-29 23:53:09,568 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,568 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,568 DEBUG L258 ransitionTransformer]: transformed transition [2018-03-29 23:53:09,568 DEBUG L259 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{main_#t~ret3=|v_main_#t~ret3_5|} AuxVars[] AssignedVars[main_#t~ret3] [2018-03-29 23:53:09,568 DEBUG L262 ransitionTransformer]: transformula unchanged [2018-03-29 23:53:09,568 DEBUG L288 ransitionTransformer]: [2018-03-29 23:53:09,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.03 11:53:09 BasicIcfg [2018-03-29 23:53:09,570 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-03-29 23:53:09,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 23:53:09,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 23:53:09,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 23:53:09,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 11:52:47" (1/4) ... [2018-03-29 23:53:09,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9dd539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 11:53:09, skipping insertion in model container [2018-03-29 23:53:09,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 11:52:48" (2/4) ... [2018-03-29 23:53:09,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9dd539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 11:53:09, skipping insertion in model container [2018-03-29 23:53:09,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 11:52:48" (3/4) ... [2018-03-29 23:53:09,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9dd539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 11:53:09, skipping insertion in model container [2018-03-29 23:53:09,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.03 11:53:09" (4/4) ... [2018-03-29 23:53:09,577 INFO L107 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-03-29 23:53:09,587 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 23:53:09,595 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-03-29 23:53:09,628 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 23:53:09,629 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 23:53:09,629 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 23:53:09,629 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 23:53:09,629 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 23:53:09,629 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 23:53:09,629 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 23:53:09,629 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 23:53:09,629 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 23:53:09,630 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 23:53:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-03-29 23:53:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-03-29 23:53:09,648 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:09,648 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:53:09,649 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-03-29 23:53:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -689560400, 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-03-29 23:53:09,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:09,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:09,719 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:09,787 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:09,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 23:53:09,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-03-29 23:53:09,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-03-29 23:53:09,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-03-29 23:53:09,800 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-03-29 23:53:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:09,823 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-03-29 23:53:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-03-29 23:53:09,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-03-29 23:53:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:09,833 INFO L225 Difference]: With dead ends: 119 [2018-03-29 23:53:09,833 INFO L226 Difference]: Without dead ends: 61 [2018-03-29 23:53:09,836 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-03-29 23:53:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-03-29 23:53:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-03-29 23:53:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-03-29 23:53:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-03-29 23:53:09,871 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2018-03-29 23:53:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:09,871 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-03-29 23:53:09,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-03-29 23:53:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-03-29 23:53:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-03-29 23:53:09,872 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:09,872 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 23:53:09,872 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-03-29 23:53:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 67923450, 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-03-29 23:53:09,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:09,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:09,911 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:09,956 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:09,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-03-29 23:53:09,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 23:53:09,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 23:53:09,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-03-29 23:53:09,958 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-03-29 23:53:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:10,075 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-03-29 23:53:10,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 23:53:10,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-03-29 23:53:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:10,078 INFO L225 Difference]: With dead ends: 108 [2018-03-29 23:53:10,078 INFO L226 Difference]: Without dead ends: 88 [2018-03-29 23:53:10,079 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-03-29 23:53:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-03-29 23:53:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-03-29 23:53:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-03-29 23:53:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-03-29 23:53:10,089 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2018-03-29 23:53:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:10,089 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-03-29 23:53:10,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 23:53:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-03-29 23:53:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 23:53:10,090 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:10,090 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-03-29 23:53:10,090 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-03-29 23:53:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash -758655353, 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-03-29 23:53:10,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:10,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:10,170 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:10,258 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:10,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-03-29 23:53:10,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-29 23:53:10,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-29 23:53:10,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-03-29 23:53:10,259 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-03-29 23:53:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:10,467 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-03-29 23:53:10,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 23:53:10,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-03-29 23:53:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:10,468 INFO L225 Difference]: With dead ends: 151 [2018-03-29 23:53:10,468 INFO L226 Difference]: Without dead ends: 97 [2018-03-29 23:53:10,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-29 23:53:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-03-29 23:53:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-03-29 23:53:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-03-29 23:53:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-03-29 23:53:10,478 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 21 [2018-03-29 23:53:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:10,478 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-03-29 23:53:10,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-29 23:53:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-03-29 23:53:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-29 23:53:10,479 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:10,480 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-03-29 23:53:10,480 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-03-29 23:53:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash -453676904, 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-03-29 23:53:10,486 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:10,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:10,517 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-03-29 23:53:10,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:10,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:10,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 23:53:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:10,547 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:10,598 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:10,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2018-03-29 23:53:10,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 23:53:10,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 23:53:10,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-03-29 23:53:10,599 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2018-03-29 23:53:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:10,656 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-03-29 23:53:10,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 23:53:10,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-03-29 23:53:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:10,659 INFO L225 Difference]: With dead ends: 77 [2018-03-29 23:53:10,659 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 23:53:10,660 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-03-29 23:53:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 23:53:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-29 23:53:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-29 23:53:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-03-29 23:53:10,669 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2018-03-29 23:53:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:10,669 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-03-29 23:53:10,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 23:53:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-03-29 23:53:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-29 23:53:10,670 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:10,671 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-03-29 23:53:10,671 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-03-29 23:53:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash -453676903, 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-03-29 23:53:10,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:10,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:10,725 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-03-29 23:53:10,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:10,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:10,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:10,886 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:11,015 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:11,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-03-29 23:53:11,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 23:53:11,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 23:53:11,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-03-29 23:53:11,016 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 9 states. [2018-03-29 23:53:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:11,135 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-03-29 23:53:11,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 23:53:11,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-03-29 23:53:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:11,136 INFO L225 Difference]: With dead ends: 80 [2018-03-29 23:53:11,136 INFO L226 Difference]: Without dead ends: 78 [2018-03-29 23:53:11,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-03-29 23:53:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-29 23:53:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-03-29 23:53:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-29 23:53:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-03-29 23:53:11,142 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2018-03-29 23:53:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:11,142 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-03-29 23:53:11,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 23:53:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-03-29 23:53:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-29 23:53:11,143 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:11,143 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-03-29 23:53:11,143 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-03-29 23:53:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1607998424, 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-03-29 23:53:11,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:11,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:11,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:11,309 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:11,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2018-03-29 23:53:11,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 23:53:11,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 23:53:11,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-03-29 23:53:11,311 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-03-29 23:53:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:11,491 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-03-29 23:53:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 23:53:11,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-03-29 23:53:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:11,492 INFO L225 Difference]: With dead ends: 107 [2018-03-29 23:53:11,492 INFO L226 Difference]: Without dead ends: 106 [2018-03-29 23:53:11,492 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-03-29 23:53:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-03-29 23:53:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2018-03-29 23:53:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-03-29 23:53:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-03-29 23:53:11,500 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2018-03-29 23:53:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:11,501 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-03-29 23:53:11,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 23:53:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-03-29 23:53:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-29 23:53:11,502 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:11,502 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-03-29 23:53:11,502 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-03-29 23:53:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 47998280, 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-03-29 23:53:11,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:11,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:11,536 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:11,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:11,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-03-29 23:53:11,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 23:53:11,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 23:53:11,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-29 23:53:11,578 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 8 states. [2018-03-29 23:53:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:11,662 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-03-29 23:53:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 23:53:11,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-03-29 23:53:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:11,663 INFO L225 Difference]: With dead ends: 131 [2018-03-29 23:53:11,663 INFO L226 Difference]: Without dead ends: 109 [2018-03-29 23:53:11,664 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-03-29 23:53:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-03-29 23:53:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2018-03-29 23:53:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 23:53:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-03-29 23:53:11,673 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 41 [2018-03-29 23:53:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:11,674 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-03-29 23:53:11,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 23:53:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-03-29 23:53:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-29 23:53:11,676 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:11,676 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-03-29 23:53:11,676 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-03-29 23:53:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1691656177, 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-03-29 23:53:11,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:11,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:11,701 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-03-29 23:53:11,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:11,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:11,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 23:53:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 23:53:11,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 23:53:11,758 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:11,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2018-03-29 23:53:11,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 23:53:11,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 23:53:11,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-03-29 23:53:11,759 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-03-29 23:53:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:11,792 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-03-29 23:53:11,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 23:53:11,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-03-29 23:53:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:11,793 INFO L225 Difference]: With dead ends: 96 [2018-03-29 23:53:11,793 INFO L226 Difference]: Without dead ends: 95 [2018-03-29 23:53:11,793 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-03-29 23:53:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-03-29 23:53:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-03-29 23:53:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-29 23:53:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-03-29 23:53:11,798 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 42 [2018-03-29 23:53:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:11,799 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-03-29 23:53:11,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 23:53:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-03-29 23:53:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-29 23:53:11,800 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:11,800 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-03-29 23:53:11,800 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-03-29 23:53:11,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1691656176, 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-03-29 23:53:11,806 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:11,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:11,835 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-03-29 23:53:11,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:11,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:11,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 23:53:11,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 23:53:12,002 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:12,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2018-03-29 23:53:12,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-29 23:53:12,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-29 23:53:12,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-03-29 23:53:12,003 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 11 states. [2018-03-29 23:53:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:12,089 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-03-29 23:53:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-29 23:53:12,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-03-29 23:53:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:12,090 INFO L225 Difference]: With dead ends: 104 [2018-03-29 23:53:12,090 INFO L226 Difference]: Without dead ends: 103 [2018-03-29 23:53:12,091 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-03-29 23:53:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-03-29 23:53:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-03-29 23:53:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 23:53:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-03-29 23:53:12,097 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 42 [2018-03-29 23:53:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:12,097 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-03-29 23:53:12,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-29 23:53:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-03-29 23:53:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-03-29 23:53:12,098 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:12,098 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-03-29 23:53:12,098 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-03-29 23:53:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 986752362, 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-03-29 23:53:12,105 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:12,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 23:53:12,154 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-29 23:53:12,223 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 23:53:12,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2018-03-29 23:53:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 23:53:12,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 23:53:12,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-03-29 23:53:12,224 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 10 states. [2018-03-29 23:53:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:12,337 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-03-29 23:53:12,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 23:53:12,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-03-29 23:53:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:12,338 INFO L225 Difference]: With dead ends: 179 [2018-03-29 23:53:12,338 INFO L226 Difference]: Without dead ends: 112 [2018-03-29 23:53:12,339 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-03-29 23:53:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-03-29 23:53:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-03-29 23:53:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 23:53:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-29 23:53:12,345 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 45 [2018-03-29 23:53:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:12,346 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-29 23:53:12,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 23:53:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-29 23:53:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 23:53:12,347 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:12,347 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-03-29 23:53:12,347 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-03-29 23:53:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1468910017, 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-03-29 23:53:12,356 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:12,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:12,455 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 23:53:12,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:12,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-03-29 23:53:12,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-29 23:53:12,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-29 23:53:12,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-03-29 23:53:12,517 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 13 states. [2018-03-29 23:53:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:12,707 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2018-03-29 23:53:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 23:53:12,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-03-29 23:53:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:12,708 INFO L225 Difference]: With dead ends: 191 [2018-03-29 23:53:12,708 INFO L226 Difference]: Without dead ends: 127 [2018-03-29 23:53:12,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-03-29 23:53:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-03-29 23:53:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2018-03-29 23:53:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-03-29 23:53:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-03-29 23:53:12,718 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 50 [2018-03-29 23:53:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:12,718 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-03-29 23:53:12,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-29 23:53:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-03-29 23:53:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 23:53:12,720 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:12,720 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-03-29 23:53:12,720 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-03-29 23:53:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash -491047213, 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-03-29 23:53:12,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:12,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:12,775 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-03-29 23:53:12,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:12,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:12,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-29 23:53:12,862 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-29 23:53:12,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:12,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-03-29 23:53:12,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-29 23:53:12,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-29 23:53:12,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-03-29 23:53:12,964 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 11 states. [2018-03-29 23:53:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:13,174 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-03-29 23:53:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 23:53:13,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-03-29 23:53:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:13,176 INFO L225 Difference]: With dead ends: 128 [2018-03-29 23:53:13,176 INFO L226 Difference]: Without dead ends: 127 [2018-03-29 23:53:13,176 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-03-29 23:53:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-03-29 23:53:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-03-29 23:53:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-03-29 23:53:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-03-29 23:53:13,186 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 54 [2018-03-29 23:53:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:13,186 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-03-29 23:53:13,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-29 23:53:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-03-29 23:53:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-29 23:53:13,188 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:13,188 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-03-29 23:53:13,188 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-03-29 23:53:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1928304839, 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-03-29 23:53:13,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:13,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-29 23:53:13,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-29 23:53:13,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:13,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-03-29 23:53:13,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-29 23:53:13,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-29 23:53:13,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-03-29 23:53:13,402 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 15 states. [2018-03-29 23:53:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:13,686 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-03-29 23:53:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-29 23:53:13,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2018-03-29 23:53:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:13,687 INFO L225 Difference]: With dead ends: 149 [2018-03-29 23:53:13,688 INFO L226 Difference]: Without dead ends: 148 [2018-03-29 23:53:13,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-03-29 23:53:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-29 23:53:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-03-29 23:53:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-03-29 23:53:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-03-29 23:53:13,697 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 79 [2018-03-29 23:53:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:13,697 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-03-29 23:53:13,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-29 23:53:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-03-29 23:53:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-03-29 23:53:13,698 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:13,698 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-03-29 23:53:13,698 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-03-29 23:53:13,698 INFO L82 PathProgramCache]: Analyzing trace with hash -352091903, 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-03-29 23:53:13,704 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:13,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:13,741 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-03-29 23:53:13,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:13,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:13,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-03-29 23:53:13,825 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-03-29 23:53:14,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:14,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-03-29 23:53:14,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-29 23:53:14,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-29 23:53:14,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-03-29 23:53:14,013 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 15 states. [2018-03-29 23:53:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:14,299 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-03-29 23:53:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-03-29 23:53:14,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-03-29 23:53:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:14,301 INFO L225 Difference]: With dead ends: 145 [2018-03-29 23:53:14,301 INFO L226 Difference]: Without dead ends: 144 [2018-03-29 23:53:14,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2018-03-29 23:53:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-03-29 23:53:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-03-29 23:53:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-03-29 23:53:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-03-29 23:53:14,311 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 80 [2018-03-29 23:53:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:14,311 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-03-29 23:53:14,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-29 23:53:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-03-29 23:53:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-03-29 23:53:14,313 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:14,313 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-03-29 23:53:14,313 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-03-29 23:53:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1907517874, 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-03-29 23:53:14,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:14,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-29 23:53:14,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-29 23:53:14,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:14,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-03-29 23:53:14,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-29 23:53:14,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-29 23:53:14,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-03-29 23:53:14,580 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 19 states. [2018-03-29 23:53:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:14,855 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2018-03-29 23:53:14,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-29 23:53:14,855 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2018-03-29 23:53:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:14,857 INFO L225 Difference]: With dead ends: 258 [2018-03-29 23:53:14,857 INFO L226 Difference]: Without dead ends: 182 [2018-03-29 23:53:14,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2018-03-29 23:53:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-03-29 23:53:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2018-03-29 23:53:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-03-29 23:53:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-03-29 23:53:14,868 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 88 [2018-03-29 23:53:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:14,868 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-03-29 23:53:14,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-29 23:53:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-03-29 23:53:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-03-29 23:53:14,869 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:14,869 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-03-29 23:53:14,869 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-03-29 23:53:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 432834440, 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-03-29 23:53:14,878 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:14,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-03-29 23:53:14,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-03-29 23:53:15,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:15,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-03-29 23:53:15,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-29 23:53:15,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-29 23:53:15,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-03-29 23:53:15,095 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 16 states. [2018-03-29 23:53:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:15,370 INFO L93 Difference]: Finished difference Result 260 states and 272 transitions. [2018-03-29 23:53:15,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-29 23:53:15,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2018-03-29 23:53:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:15,371 INFO L225 Difference]: With dead ends: 260 [2018-03-29 23:53:15,371 INFO L226 Difference]: Without dead ends: 178 [2018-03-29 23:53:15,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 177 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-03-29 23:53:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-03-29 23:53:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2018-03-29 23:53:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-03-29 23:53:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2018-03-29 23:53:15,380 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 99 [2018-03-29 23:53:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:15,381 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2018-03-29 23:53:15,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-29 23:53:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2018-03-29 23:53:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-03-29 23:53:15,382 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:15,382 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-03-29 23:53:15,382 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-03-29 23:53:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -76499725, 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-03-29 23:53:15,395 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:15,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-29 23:53:15,452 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-29 23:53:15,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:15,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-03-29 23:53:15,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-29 23:53:15,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-29 23:53:15,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-03-29 23:53:15,534 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand 16 states. [2018-03-29 23:53:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:15,731 INFO L93 Difference]: Finished difference Result 236 states and 248 transitions. [2018-03-29 23:53:15,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-29 23:53:15,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-03-29 23:53:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:15,733 INFO L225 Difference]: With dead ends: 236 [2018-03-29 23:53:15,733 INFO L226 Difference]: Without dead ends: 214 [2018-03-29 23:53:15,734 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-03-29 23:53:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-03-29 23:53:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 199. [2018-03-29 23:53:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-03-29 23:53:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 210 transitions. [2018-03-29 23:53:15,752 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 210 transitions. Word has length 108 [2018-03-29 23:53:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:15,753 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 210 transitions. [2018-03-29 23:53:15,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-29 23:53:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 210 transitions. [2018-03-29 23:53:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-03-29 23:53:15,754 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:15,754 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-03-29 23:53:15,754 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-03-29 23:53:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1538224925, 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-03-29 23:53:15,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:15,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 135 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-29 23:53:15,947 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 135 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-29 23:53:16,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:16,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-03-29 23:53:16,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-29 23:53:16,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-29 23:53:16,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-03-29 23:53:16,105 INFO L87 Difference]: Start difference. First operand 199 states and 210 transitions. Second operand 21 states. [2018-03-29 23:53:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:16,603 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-03-29 23:53:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-29 23:53:16,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2018-03-29 23:53:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:16,606 INFO L225 Difference]: With dead ends: 219 [2018-03-29 23:53:16,608 INFO L226 Difference]: Without dead ends: 218 [2018-03-29 23:53:16,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 224 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-03-29 23:53:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-03-29 23:53:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2018-03-29 23:53:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-03-29 23:53:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 209 transitions. [2018-03-29 23:53:16,624 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 209 transitions. Word has length 126 [2018-03-29 23:53:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:16,625 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 209 transitions. [2018-03-29 23:53:16,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-29 23:53:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 209 transitions. [2018-03-29 23:53:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-03-29 23:53:16,626 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:16,627 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-03-29 23:53:16,627 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-03-29 23:53:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1136420619, 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-03-29 23:53:16,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:16,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 138 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-03-29 23:53:16,798 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 138 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-03-29 23:53:16,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:16,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-03-29 23:53:16,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-03-29 23:53:16,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-03-29 23:53:16,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-03-29 23:53:16,975 INFO L87 Difference]: Start difference. First operand 199 states and 209 transitions. Second operand 22 states. [2018-03-29 23:53:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:17,334 INFO L93 Difference]: Finished difference Result 318 states and 339 transitions. [2018-03-29 23:53:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 23:53:17,334 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 130 [2018-03-29 23:53:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:17,336 INFO L225 Difference]: With dead ends: 318 [2018-03-29 23:53:17,336 INFO L226 Difference]: Without dead ends: 215 [2018-03-29 23:53:17,337 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 231 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2018-03-29 23:53:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-03-29 23:53:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-03-29 23:53:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-03-29 23:53:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-03-29 23:53:17,349 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 130 [2018-03-29 23:53:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:17,350 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-03-29 23:53:17,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-03-29 23:53:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-03-29 23:53:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-03-29 23:53:17,350 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:17,350 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-03-29 23:53:17,351 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-03-29 23:53:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2077469418, 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-03-29 23:53:17,358 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:17,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-29 23:53:17,522 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-29 23:53:17,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:17,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-03-29 23:53:17,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 23:53:17,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 23:53:17,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-03-29 23:53:17,699 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 25 states. [2018-03-29 23:53:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:18,264 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-03-29 23:53:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-03-29 23:53:18,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 135 [2018-03-29 23:53:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:18,265 INFO L225 Difference]: With dead ends: 348 [2018-03-29 23:53:18,266 INFO L226 Difference]: Without dead ends: 248 [2018-03-29 23:53:18,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 237 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980 [2018-03-29 23:53:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-03-29 23:53:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2018-03-29 23:53:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-03-29 23:53:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 245 transitions. [2018-03-29 23:53:18,275 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 245 transitions. Word has length 135 [2018-03-29 23:53:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:18,275 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 245 transitions. [2018-03-29 23:53:18,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 23:53:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 245 transitions. [2018-03-29 23:53:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-03-29 23:53:18,276 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:18,276 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-03-29 23:53:18,276 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-03-29 23:53:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1003098024, 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-03-29 23:53:18,289 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:18,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:18,338 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-03-29 23:53:18,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:18,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:18,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-03-29 23:53:18,742 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-03-29 23:53:18,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:18,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-03-29 23:53:18,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-29 23:53:18,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-29 23:53:18,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-03-29 23:53:18,868 INFO L87 Difference]: Start difference. First operand 237 states and 245 transitions. Second operand 19 states. [2018-03-29 23:53:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:19,468 INFO L93 Difference]: Finished difference Result 249 states and 259 transitions. [2018-03-29 23:53:19,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-29 23:53:19,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 139 [2018-03-29 23:53:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:19,470 INFO L225 Difference]: With dead ends: 249 [2018-03-29 23:53:19,470 INFO L226 Difference]: Without dead ends: 248 [2018-03-29 23:53:19,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 253 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=783, Unknown=0, NotChecked=0, Total=1122 [2018-03-29 23:53:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-03-29 23:53:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2018-03-29 23:53:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-03-29 23:53:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 246 transitions. [2018-03-29 23:53:19,484 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 246 transitions. Word has length 139 [2018-03-29 23:53:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:19,485 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 246 transitions. [2018-03-29 23:53:19,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-29 23:53:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 246 transitions. [2018-03-29 23:53:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-03-29 23:53:19,486 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:19,486 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-03-29 23:53:19,486 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-03-29 23:53:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1246905650, 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-03-29 23:53:19,496 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:19,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 302 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-03-29 23:53:19,827 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 302 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-03-29 23:53:20,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:20,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 26 [2018-03-29 23:53:20,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-03-29 23:53:20,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-03-29 23:53:20,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-03-29 23:53:20,048 INFO L87 Difference]: Start difference. First operand 240 states and 246 transitions. Second operand 27 states. [2018-03-29 23:53:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:20,546 INFO L93 Difference]: Finished difference Result 270 states and 279 transitions. [2018-03-29 23:53:20,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-03-29 23:53:20,547 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 182 [2018-03-29 23:53:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:20,548 INFO L225 Difference]: With dead ends: 270 [2018-03-29 23:53:20,548 INFO L226 Difference]: Without dead ends: 269 [2018-03-29 23:53:20,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 329 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2018-03-29 23:53:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-03-29 23:53:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248. [2018-03-29 23:53:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-03-29 23:53:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 255 transitions. [2018-03-29 23:53:20,564 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 255 transitions. Word has length 182 [2018-03-29 23:53:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:20,565 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 255 transitions. [2018-03-29 23:53:20,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-03-29 23:53:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 255 transitions. [2018-03-29 23:53:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-03-29 23:53:20,566 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:20,566 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-03-29 23:53:20,566 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-03-29 23:53:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -630282, 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-03-29 23:53:20,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:20,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:20,624 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-03-29 23:53:20,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:20,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:20,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 242 proven. 39 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-03-29 23:53:20,836 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 242 proven. 39 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-03-29 23:53:21,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:21,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-03-29 23:53:21,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-03-29 23:53:21,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-03-29 23:53:21,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-03-29 23:53:21,033 INFO L87 Difference]: Start difference. First operand 248 states and 255 transitions. Second operand 23 states. [2018-03-29 23:53:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:21,929 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2018-03-29 23:53:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-29 23:53:21,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 183 [2018-03-29 23:53:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:21,931 INFO L225 Difference]: With dead ends: 292 [2018-03-29 23:53:21,931 INFO L226 Difference]: Without dead ends: 291 [2018-03-29 23:53:21,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 341 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2018-03-29 23:53:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-03-29 23:53:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276. [2018-03-29 23:53:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-03-29 23:53:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 289 transitions. [2018-03-29 23:53:21,949 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 289 transitions. Word has length 183 [2018-03-29 23:53:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:21,950 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 289 transitions. [2018-03-29 23:53:21,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-03-29 23:53:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 289 transitions. [2018-03-29 23:53:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-03-29 23:53:21,951 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:21,952 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-03-29 23:53:21,952 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-03-29 23:53:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash 994280871, 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-03-29 23:53:21,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:21,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 364 proven. 66 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-03-29 23:53:22,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 364 proven. 66 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-03-29 23:53:22,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:22,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-03-29 23:53:22,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-29 23:53:22,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-29 23:53:22,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-03-29 23:53:22,337 INFO L87 Difference]: Start difference. First operand 276 states and 289 transitions. Second operand 31 states. [2018-03-29 23:53:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:22,947 INFO L93 Difference]: Finished difference Result 466 states and 493 transitions. [2018-03-29 23:53:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-03-29 23:53:22,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 191 [2018-03-29 23:53:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:22,948 INFO L225 Difference]: With dead ends: 466 [2018-03-29 23:53:22,949 INFO L226 Difference]: Without dead ends: 336 [2018-03-29 23:53:22,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 341 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=552, Invalid=2640, Unknown=0, NotChecked=0, Total=3192 [2018-03-29 23:53:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-03-29 23:53:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-03-29 23:53:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-03-29 23:53:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 336 transitions. [2018-03-29 23:53:22,964 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 336 transitions. Word has length 191 [2018-03-29 23:53:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:22,964 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 336 transitions. [2018-03-29 23:53:22,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-29 23:53:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 336 transitions. [2018-03-29 23:53:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-03-29 23:53:22,966 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:22,966 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-03-29 23:53:22,966 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-03-29 23:53:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash 856322499, 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-03-29 23:53:22,973 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:23,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 766 proven. 33 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-03-29 23:53:23,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 766 proven. 33 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-03-29 23:53:23,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:23,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-03-29 23:53:23,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-03-29 23:53:23,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-03-29 23:53:23,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-03-29 23:53:23,427 INFO L87 Difference]: Start difference. First operand 323 states and 336 transitions. Second operand 28 states. [2018-03-29 23:53:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:23,893 INFO L93 Difference]: Finished difference Result 471 states and 497 transitions. [2018-03-29 23:53:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-03-29 23:53:23,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 238 [2018-03-29 23:53:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:23,895 INFO L225 Difference]: With dead ends: 471 [2018-03-29 23:53:23,895 INFO L226 Difference]: Without dead ends: 335 [2018-03-29 23:53:23,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 439 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2018-03-29 23:53:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-03-29 23:53:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 323. [2018-03-29 23:53:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-03-29 23:53:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 334 transitions. [2018-03-29 23:53:23,914 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 334 transitions. Word has length 238 [2018-03-29 23:53:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:23,915 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 334 transitions. [2018-03-29 23:53:23,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-03-29 23:53:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 334 transitions. [2018-03-29 23:53:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-03-29 23:53:23,916 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:23,917 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-03-29 23:53:23,917 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-03-29 23:53:23,917 INFO L82 PathProgramCache]: Analyzing trace with hash -874262728, 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-03-29 23:53:23,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:23,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 575 proven. 66 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-03-29 23:53:24,205 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 575 proven. 66 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-03-29 23:53:24,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:24,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 32 [2018-03-29 23:53:24,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-03-29 23:53:24,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-03-29 23:53:24,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2018-03-29 23:53:24,511 INFO L87 Difference]: Start difference. First operand 323 states and 334 transitions. Second operand 33 states. [2018-03-29 23:53:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:25,196 INFO L93 Difference]: Finished difference Result 339 states and 350 transitions. [2018-03-29 23:53:25,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-29 23:53:25,197 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 247 [2018-03-29 23:53:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:25,199 INFO L225 Difference]: With dead ends: 339 [2018-03-29 23:53:25,199 INFO L226 Difference]: Without dead ends: 338 [2018-03-29 23:53:25,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 450 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=2783, Unknown=0, NotChecked=0, Total=3192 [2018-03-29 23:53:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-03-29 23:53:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2018-03-29 23:53:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-03-29 23:53:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 333 transitions. [2018-03-29 23:53:25,220 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 333 transitions. Word has length 247 [2018-03-29 23:53:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:25,220 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 333 transitions. [2018-03-29 23:53:25,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-03-29 23:53:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 333 transitions. [2018-03-29 23:53:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-03-29 23:53:25,222 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:25,223 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-03-29 23:53:25,223 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-03-29 23:53:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1032184417, 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-03-29 23:53:25,234 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:25,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 675 proven. 105 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-03-29 23:53:25,583 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 675 proven. 105 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-03-29 23:53:26,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:26,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 37 [2018-03-29 23:53:26,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-03-29 23:53:26,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-03-29 23:53:26,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-03-29 23:53:26,238 INFO L87 Difference]: Start difference. First operand 323 states and 333 transitions. Second operand 37 states. [2018-03-29 23:53:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:26,901 INFO L93 Difference]: Finished difference Result 513 states and 534 transitions. [2018-03-29 23:53:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-03-29 23:53:26,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 256 [2018-03-29 23:53:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:26,903 INFO L225 Difference]: With dead ends: 513 [2018-03-29 23:53:26,903 INFO L226 Difference]: Without dead ends: 392 [2018-03-29 23:53:26,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 463 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=779, Invalid=3913, Unknown=0, NotChecked=0, Total=4692 [2018-03-29 23:53:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-03-29 23:53:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 379. [2018-03-29 23:53:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-03-29 23:53:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 389 transitions. [2018-03-29 23:53:26,917 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 389 transitions. Word has length 256 [2018-03-29 23:53:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:26,917 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 389 transitions. [2018-03-29 23:53:26,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-03-29 23:53:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 389 transitions. [2018-03-29 23:53:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-03-29 23:53:26,919 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:26,919 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-03-29 23:53:26,919 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-03-29 23:53:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1940050672, 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-03-29 23:53:26,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:26,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1393 proven. 62 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-03-29 23:53:27,325 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1393 proven. 62 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-03-29 23:53:27,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:27,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 34 [2018-03-29 23:53:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-03-29 23:53:27,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-03-29 23:53:27,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-03-29 23:53:27,759 INFO L87 Difference]: Start difference. First operand 379 states and 389 transitions. Second operand 34 states. [2018-03-29 23:53:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:28,291 INFO L93 Difference]: Finished difference Result 518 states and 537 transitions. [2018-03-29 23:53:28,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-03-29 23:53:28,292 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 312 [2018-03-29 23:53:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:28,294 INFO L225 Difference]: With dead ends: 518 [2018-03-29 23:53:28,294 INFO L226 Difference]: Without dead ends: 391 [2018-03-29 23:53:28,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 579 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=572, Invalid=2734, Unknown=0, NotChecked=0, Total=3306 [2018-03-29 23:53:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-03-29 23:53:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 379. [2018-03-29 23:53:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-03-29 23:53:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 387 transitions. [2018-03-29 23:53:28,308 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 387 transitions. Word has length 312 [2018-03-29 23:53:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:28,308 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 387 transitions. [2018-03-29 23:53:28,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-03-29 23:53:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 387 transitions. [2018-03-29 23:53:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-03-29 23:53:28,310 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:28,310 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-03-29 23:53:28,310 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-03-29 23:53:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -822612761, 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-03-29 23:53:28,325 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:28,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2376 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-03-29 23:53:28,674 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2376 backedges. 981 proven. 105 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-03-29 23:53:29,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:29,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 38 [2018-03-29 23:53:29,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-29 23:53:29,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-29 23:53:29,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-03-29 23:53:29,029 INFO L87 Difference]: Start difference. First operand 379 states and 387 transitions. Second operand 39 states. [2018-03-29 23:53:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:29,894 INFO L93 Difference]: Finished difference Result 395 states and 402 transitions. [2018-03-29 23:53:29,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-03-29 23:53:29,894 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 321 [2018-03-29 23:53:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:29,896 INFO L225 Difference]: With dead ends: 395 [2018-03-29 23:53:29,896 INFO L226 Difference]: Without dead ends: 394 [2018-03-29 23:53:29,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 590 SyntacticMatches, 15 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=544, Invalid=4012, Unknown=0, NotChecked=0, Total=4556 [2018-03-29 23:53:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-03-29 23:53:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 379. [2018-03-29 23:53:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-03-29 23:53:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 386 transitions. [2018-03-29 23:53:29,918 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 386 transitions. Word has length 321 [2018-03-29 23:53:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:29,919 INFO L459 AbstractCegarLoop]: Abstraction has 379 states and 386 transitions. [2018-03-29 23:53:29,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-29 23:53:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 386 transitions. [2018-03-29 23:53:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-03-29 23:53:29,921 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:29,921 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-03-29 23:53:29,921 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-03-29 23:53:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1057572462, 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-03-29 23:53:29,931 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:29,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1128 proven. 153 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-03-29 23:53:30,297 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1128 proven. 153 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2018-03-29 23:53:30,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:30,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 43 [2018-03-29 23:53:30,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-03-29 23:53:30,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-03-29 23:53:30,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2018-03-29 23:53:30,632 INFO L87 Difference]: Start difference. First operand 379 states and 386 transitions. Second operand 43 states. [2018-03-29 23:53:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:31,544 INFO L93 Difference]: Finished difference Result 572 states and 587 transitions. [2018-03-29 23:53:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-03-29 23:53:31,545 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 330 [2018-03-29 23:53:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:31,547 INFO L225 Difference]: With dead ends: 572 [2018-03-29 23:53:31,547 INFO L226 Difference]: Without dead ends: 460 [2018-03-29 23:53:31,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 603 SyntacticMatches, 15 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1044, Invalid=5436, Unknown=0, NotChecked=0, Total=6480 [2018-03-29 23:53:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-03-29 23:53:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2018-03-29 23:53:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-03-29 23:53:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 451 transitions. [2018-03-29 23:53:31,575 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 451 transitions. Word has length 330 [2018-03-29 23:53:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:31,575 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 451 transitions. [2018-03-29 23:53:31,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-03-29 23:53:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 451 transitions. [2018-03-29 23:53:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-03-29 23:53:31,578 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:31,578 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-03-29 23:53:31,578 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-03-29 23:53:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -444494936, 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-03-29 23:53:31,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:31,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1016 proven. 100 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2018-03-29 23:53:32,057 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1016 proven. 100 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2018-03-29 23:53:32,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:32,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 40 [2018-03-29 23:53:32,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-03-29 23:53:32,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-03-29 23:53:32,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2018-03-29 23:53:32,520 INFO L87 Difference]: Start difference. First operand 444 states and 451 transitions. Second operand 40 states. [2018-03-29 23:53:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:33,148 INFO L93 Difference]: Finished difference Result 574 states and 586 transitions. [2018-03-29 23:53:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-29 23:53:33,148 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 341 [2018-03-29 23:53:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:33,149 INFO L225 Difference]: With dead ends: 574 [2018-03-29 23:53:33,149 INFO L226 Difference]: Without dead ends: 456 [2018-03-29 23:53:33,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 629 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=788, Invalid=3904, Unknown=0, NotChecked=0, Total=4692 [2018-03-29 23:53:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-03-29 23:53:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 444. [2018-03-29 23:53:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-03-29 23:53:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 449 transitions. [2018-03-29 23:53:33,174 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 449 transitions. Word has length 341 [2018-03-29 23:53:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:33,174 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 449 transitions. [2018-03-29 23:53:33,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-03-29 23:53:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 449 transitions. [2018-03-29 23:53:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-03-29 23:53:33,177 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:33,177 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-03-29 23:53:33,177 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-03-29 23:53:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash 978212051, 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-03-29 23:53:33,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:33,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-03-29 23:53:33,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-03-29 23:53:33,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:33,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-03-29 23:53:33,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-03-29 23:53:33,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-03-29 23:53:33,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-03-29 23:53:33,731 INFO L87 Difference]: Start difference. First operand 444 states and 449 transitions. Second operand 32 states. [2018-03-29 23:53:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:34,166 INFO L93 Difference]: Finished difference Result 554 states and 574 transitions. [2018-03-29 23:53:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-29 23:53:34,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2018-03-29 23:53:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:34,168 INFO L225 Difference]: With dead ends: 554 [2018-03-29 23:53:34,168 INFO L226 Difference]: Without dead ends: 532 [2018-03-29 23:53:34,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-03-29 23:53:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-03-29 23:53:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 513. [2018-03-29 23:53:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-03-29 23:53:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 532 transitions. [2018-03-29 23:53:34,198 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 532 transitions. Word has length 350 [2018-03-29 23:53:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:34,199 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 532 transitions. [2018-03-29 23:53:34,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-03-29 23:53:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 532 transitions. [2018-03-29 23:53:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-03-29 23:53:34,202 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:34,202 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-03-29 23:53:34,203 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-03-29 23:53:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1654980483, 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-03-29 23:53:34,212 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:34,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 1547 proven. 153 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-03-29 23:53:34,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 1547 proven. 153 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-03-29 23:53:35,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:35,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 44 [2018-03-29 23:53:35,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-03-29 23:53:35,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-03-29 23:53:35,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2018-03-29 23:53:35,306 INFO L87 Difference]: Start difference. First operand 513 states and 532 transitions. Second operand 45 states. [2018-03-29 23:53:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:36,466 INFO L93 Difference]: Finished difference Result 533 states and 557 transitions. [2018-03-29 23:53:36,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-29 23:53:36,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 404 [2018-03-29 23:53:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:36,468 INFO L225 Difference]: With dead ends: 533 [2018-03-29 23:53:36,468 INFO L226 Difference]: Without dead ends: 532 [2018-03-29 23:53:36,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 748 SyntacticMatches, 17 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=696, Invalid=5466, Unknown=0, NotChecked=0, Total=6162 [2018-03-29 23:53:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-03-29 23:53:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 513. [2018-03-29 23:53:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-03-29 23:53:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 531 transitions. [2018-03-29 23:53:36,487 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 531 transitions. Word has length 404 [2018-03-29 23:53:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:36,487 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 531 transitions. [2018-03-29 23:53:36,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-03-29 23:53:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 531 transitions. [2018-03-29 23:53:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-03-29 23:53:36,490 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:36,490 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-03-29 23:53:36,490 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-03-29 23:53:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2145237909, 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-03-29 23:53:36,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:36,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1540 proven. 147 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2018-03-29 23:53:37,412 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 1540 proven. 147 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2018-03-29 23:53:37,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:37,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 46 [2018-03-29 23:53:37,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-03-29 23:53:37,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-03-29 23:53:37,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1770, Unknown=0, NotChecked=0, Total=2070 [2018-03-29 23:53:37,881 INFO L87 Difference]: Start difference. First operand 513 states and 531 transitions. Second operand 46 states. [2018-03-29 23:53:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:38,529 INFO L93 Difference]: Finished difference Result 704 states and 745 transitions. [2018-03-29 23:53:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-03-29 23:53:38,529 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 408 [2018-03-29 23:53:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:38,531 INFO L225 Difference]: With dead ends: 704 [2018-03-29 23:53:38,531 INFO L226 Difference]: Without dead ends: 529 [2018-03-29 23:53:38,533 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 755 SyntacticMatches, 17 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1038, Invalid=5282, Unknown=0, NotChecked=0, Total=6320 [2018-03-29 23:53:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-03-29 23:53:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2018-03-29 23:53:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-03-29 23:53:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 530 transitions. [2018-03-29 23:53:38,559 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 530 transitions. Word has length 408 [2018-03-29 23:53:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:38,560 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 530 transitions. [2018-03-29 23:53:38,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-03-29 23:53:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 530 transitions. [2018-03-29 23:53:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-03-29 23:53:38,563 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:38,563 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-03-29 23:53:38,563 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-03-29 23:53:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash 111072886, 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-03-29 23:53:38,571 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:38,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 1750 proven. 210 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-03-29 23:53:39,274 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 1750 proven. 210 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-03-29 23:53:39,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:39,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 49 [2018-03-29 23:53:39,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-03-29 23:53:39,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-03-29 23:53:39,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2031, Unknown=0, NotChecked=0, Total=2352 [2018-03-29 23:53:39,694 INFO L87 Difference]: Start difference. First operand 513 states and 530 transitions. Second operand 49 states. [2018-03-29 23:53:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:40,750 INFO L93 Difference]: Finished difference Result 770 states and 803 transitions. [2018-03-29 23:53:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-03-29 23:53:40,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 413 [2018-03-29 23:53:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:40,753 INFO L225 Difference]: With dead ends: 770 [2018-03-29 23:53:40,753 INFO L226 Difference]: Without dead ends: 598 [2018-03-29 23:53:40,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 761 SyntacticMatches, 17 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1347, Invalid=7209, Unknown=0, NotChecked=0, Total=8556 [2018-03-29 23:53:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-03-29 23:53:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 587. [2018-03-29 23:53:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-03-29 23:53:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 603 transitions. [2018-03-29 23:53:40,782 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 603 transitions. Word has length 413 [2018-03-29 23:53:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:40,783 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 603 transitions. [2018-03-29 23:53:40,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-03-29 23:53:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 603 transitions. [2018-03-29 23:53:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-03-29 23:53:40,784 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:40,785 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-03-29 23:53:40,785 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-03-29 23:53:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1415373064, 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-03-29 23:53:40,790 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:40,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:40,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-03-29 23:53:40,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:40,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:40,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-03-29 23:53:41,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-03-29 23:53:41,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:41,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-03-29 23:53:41,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-03-29 23:53:41,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-03-29 23:53:41,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2018-03-29 23:53:41,948 INFO L87 Difference]: Start difference. First operand 587 states and 603 transitions. Second operand 35 states. [2018-03-29 23:53:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:43,754 INFO L93 Difference]: Finished difference Result 599 states and 617 transitions. [2018-03-29 23:53:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-03-29 23:53:43,754 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 417 [2018-03-29 23:53:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:43,756 INFO L225 Difference]: With dead ends: 599 [2018-03-29 23:53:43,756 INFO L226 Difference]: Without dead ends: 598 [2018-03-29 23:53:43,757 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 785 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1299, Invalid=3531, Unknown=0, NotChecked=0, Total=4830 [2018-03-29 23:53:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-03-29 23:53:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2018-03-29 23:53:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-03-29 23:53:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 600 transitions. [2018-03-29 23:53:43,781 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 600 transitions. Word has length 417 [2018-03-29 23:53:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:43,781 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 600 transitions. [2018-03-29 23:53:43,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-03-29 23:53:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 600 transitions. [2018-03-29 23:53:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-03-29 23:53:43,785 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:43,785 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-03-29 23:53:43,785 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-03-29 23:53:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1648802030, 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-03-29 23:53:43,792 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:43,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6668 backedges. 2300 proven. 210 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-03-29 23:53:44,402 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6668 backedges. 2300 proven. 210 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-03-29 23:53:44,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:44,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 50 [2018-03-29 23:53:44,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-03-29 23:53:44,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-03-29 23:53:44,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2018-03-29 23:53:44,953 INFO L87 Difference]: Start difference. First operand 590 states and 600 transitions. Second operand 51 states. [2018-03-29 23:53:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:46,502 INFO L93 Difference]: Finished difference Result 620 states and 637 transitions. [2018-03-29 23:53:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-03-29 23:53:46,502 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 496 [2018-03-29 23:53:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:46,504 INFO L225 Difference]: With dead ends: 620 [2018-03-29 23:53:46,504 INFO L226 Difference]: Without dead ends: 619 [2018-03-29 23:53:46,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 925 SyntacticMatches, 19 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=865, Invalid=7145, Unknown=0, NotChecked=0, Total=8010 [2018-03-29 23:53:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-03-29 23:53:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 598. [2018-03-29 23:53:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-03-29 23:53:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 609 transitions. [2018-03-29 23:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 609 transitions. Word has length 496 [2018-03-29 23:53:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:46,525 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 609 transitions. [2018-03-29 23:53:46,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-03-29 23:53:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 609 transitions. [2018-03-29 23:53:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-03-29 23:53:46,528 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:46,529 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-03-29 23:53:46,529 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-03-29 23:53:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash 426744854, 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-03-29 23:53:46,535 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:46,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:46,634 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-03-29 23:53:46,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 23:53:46,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 23:53:46,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 23:53:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6703 backedges. 2052 proven. 217 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2018-03-29 23:53:47,236 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6703 backedges. 2052 proven. 217 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2018-03-29 23:53:47,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:47,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-03-29 23:53:47,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-29 23:53:47,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-29 23:53:47,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-03-29 23:53:47,857 INFO L87 Difference]: Start difference. First operand 598 states and 609 transitions. Second operand 39 states. [2018-03-29 23:53:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:50,232 INFO L93 Difference]: Finished difference Result 694 states and 775 transitions. [2018-03-29 23:53:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-03-29 23:53:50,232 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 497 [2018-03-29 23:53:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:50,234 INFO L225 Difference]: With dead ends: 694 [2018-03-29 23:53:50,234 INFO L226 Difference]: Without dead ends: 693 [2018-03-29 23:53:50,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 949 SyntacticMatches, 15 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1574, Invalid=5232, Unknown=0, NotChecked=0, Total=6806 [2018-03-29 23:53:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-03-29 23:53:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 662. [2018-03-29 23:53:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-03-29 23:53:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 687 transitions. [2018-03-29 23:53:50,259 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 687 transitions. Word has length 497 [2018-03-29 23:53:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:50,259 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 687 transitions. [2018-03-29 23:53:50,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-29 23:53:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 687 transitions. [2018-03-29 23:53:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-03-29 23:53:50,262 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:50,263 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-03-29 23:53:50,263 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-03-29 23:53:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash -714039353, 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-03-29 23:53:50,274 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:50,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7002 backedges. 2568 proven. 276 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-03-29 23:53:50,835 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7002 backedges. 2568 proven. 276 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-03-29 23:53:51,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:51,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 55 [2018-03-29 23:53:51,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-03-29 23:53:51,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-03-29 23:53:51,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2573, Unknown=0, NotChecked=0, Total=2970 [2018-03-29 23:53:51,394 INFO L87 Difference]: Start difference. First operand 662 states and 687 transitions. Second operand 55 states. [2018-03-29 23:53:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:52,741 INFO L93 Difference]: Finished difference Result 996 states and 1047 transitions. [2018-03-29 23:53:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-03-29 23:53:52,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 505 [2018-03-29 23:53:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:52,743 INFO L225 Difference]: With dead ends: 996 [2018-03-29 23:53:52,743 INFO L226 Difference]: Without dead ends: 758 [2018-03-29 23:53:52,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 937 SyntacticMatches, 19 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2801 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1688, Invalid=9232, Unknown=0, NotChecked=0, Total=10920 [2018-03-29 23:53:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-03-29 23:53:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 745. [2018-03-29 23:53:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-03-29 23:53:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 770 transitions. [2018-03-29 23:53:52,769 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 770 transitions. Word has length 505 [2018-03-29 23:53:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:52,770 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 770 transitions. [2018-03-29 23:53:52,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-03-29 23:53:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 770 transitions. [2018-03-29 23:53:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-03-29 23:53:52,773 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:52,773 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-03-29 23:53:52,773 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-03-29 23:53:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1047490147, 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-03-29 23:53:52,778 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:52,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9849 backedges. 5188 proven. 203 refuted. 0 times theorem prover too weak. 4458 trivial. 0 not checked. [2018-03-29 23:53:53,330 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9849 backedges. 5188 proven. 203 refuted. 0 times theorem prover too weak. 4458 trivial. 0 not checked. [2018-03-29 23:53:53,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:53,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 52 [2018-03-29 23:53:53,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-03-29 23:53:53,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-03-29 23:53:53,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2018-03-29 23:53:53,968 INFO L87 Difference]: Start difference. First operand 745 states and 770 transitions. Second operand 52 states. [2018-03-29 23:53:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:54,822 INFO L93 Difference]: Finished difference Result 1001 states and 1055 transitions. [2018-03-29 23:53:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-03-29 23:53:54,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 588 [2018-03-29 23:53:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:54,824 INFO L225 Difference]: With dead ends: 1001 [2018-03-29 23:53:54,824 INFO L226 Difference]: Without dead ends: 757 [2018-03-29 23:53:54,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1107 SyntacticMatches, 19 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1322, Invalid=6868, Unknown=0, NotChecked=0, Total=8190 [2018-03-29 23:53:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-03-29 23:53:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 745. [2018-03-29 23:53:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-03-29 23:53:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 768 transitions. [2018-03-29 23:53:54,849 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 768 transitions. Word has length 588 [2018-03-29 23:53:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:54,850 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 768 transitions. [2018-03-29 23:53:54,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-03-29 23:53:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 768 transitions. [2018-03-29 23:53:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-03-29 23:53:54,852 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:54,853 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-03-29 23:53:54,853 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-03-29 23:53:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1604005272, 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-03-29 23:53:54,862 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:54,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 3267 proven. 276 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-03-29 23:53:55,534 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 3267 proven. 276 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-03-29 23:53:56,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:56,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 56 [2018-03-29 23:53:56,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-03-29 23:53:56,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-03-29 23:53:56,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2018-03-29 23:53:56,224 INFO L87 Difference]: Start difference. First operand 745 states and 768 transitions. Second operand 57 states. [2018-03-29 23:53:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:53:57,837 INFO L93 Difference]: Finished difference Result 761 states and 788 transitions. [2018-03-29 23:53:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-03-29 23:53:57,838 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 597 [2018-03-29 23:53:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:53:57,840 INFO L225 Difference]: With dead ends: 761 [2018-03-29 23:53:57,840 INFO L226 Difference]: Without dead ends: 760 [2018-03-29 23:53:57,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1118 SyntacticMatches, 21 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1051, Invalid=9049, Unknown=0, NotChecked=0, Total=10100 [2018-03-29 23:53:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-03-29 23:53:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 745. [2018-03-29 23:53:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-03-29 23:53:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 767 transitions. [2018-03-29 23:53:57,863 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 767 transitions. Word has length 597 [2018-03-29 23:53:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:53:57,864 INFO L459 AbstractCegarLoop]: Abstraction has 745 states and 767 transitions. [2018-03-29 23:53:57,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-03-29 23:53:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 767 transitions. [2018-03-29 23:53:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-03-29 23:53:57,866 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:53:57,867 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-03-29 23:53:57,867 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-03-29 23:53:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2059579393, 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-03-29 23:53:57,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:53:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:53:57,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:53:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10674 backedges. 3609 proven. 351 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-03-29 23:53:58,550 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:53:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10674 backedges. 3609 proven. 351 refuted. 0 times theorem prover too weak. 6714 trivial. 0 not checked. [2018-03-29 23:53:59,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:53:59,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 61 [2018-03-29 23:53:59,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-03-29 23:53:59,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-03-29 23:53:59,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=3179, Unknown=0, NotChecked=0, Total=3660 [2018-03-29 23:53:59,204 INFO L87 Difference]: Start difference. First operand 745 states and 767 transitions. Second operand 61 states. [2018-03-29 23:54:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:00,691 INFO L93 Difference]: Finished difference Result 1079 states and 1124 transitions. [2018-03-29 23:54:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-03-29 23:54:00,691 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 606 [2018-03-29 23:54:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:00,694 INFO L225 Difference]: With dead ends: 1079 [2018-03-29 23:54:00,694 INFO L226 Difference]: Without dead ends: 850 [2018-03-29 23:54:00,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1267 GetRequests, 1131 SyntacticMatches, 21 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3534 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2067, Invalid=11505, Unknown=0, NotChecked=0, Total=13572 [2018-03-29 23:54:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-03-29 23:54:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 837. [2018-03-29 23:54:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-03-29 23:54:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 859 transitions. [2018-03-29 23:54:00,721 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 859 transitions. Word has length 606 [2018-03-29 23:54:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:00,722 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 859 transitions. [2018-03-29 23:54:00,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-03-29 23:54:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 859 transitions. [2018-03-29 23:54:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-03-29 23:54:00,725 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:00,725 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-03-29 23:54:00,725 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-03-29 23:54:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1579145008, 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-03-29 23:54:00,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:00,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14631 backedges. 7271 proven. 268 refuted. 0 times theorem prover too weak. 7092 trivial. 0 not checked. [2018-03-29 23:54:01,431 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14631 backedges. 7271 proven. 268 refuted. 0 times theorem prover too weak. 7092 trivial. 0 not checked. [2018-03-29 23:54:02,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:02,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 58 [2018-03-29 23:54:02,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-03-29 23:54:02,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-03-29 23:54:02,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=2850, Unknown=0, NotChecked=0, Total=3306 [2018-03-29 23:54:02,185 INFO L87 Difference]: Start difference. First operand 837 states and 859 transitions. Second operand 58 states. [2018-03-29 23:54:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:03,147 INFO L93 Difference]: Finished difference Result 1084 states and 1131 transitions. [2018-03-29 23:54:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-03-29 23:54:03,147 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 698 [2018-03-29 23:54:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:03,150 INFO L225 Difference]: With dead ends: 1084 [2018-03-29 23:54:03,150 INFO L226 Difference]: Without dead ends: 849 [2018-03-29 23:54:03,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1440 GetRequests, 1319 SyntacticMatches, 21 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3839 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1640, Invalid=8662, Unknown=0, NotChecked=0, Total=10302 [2018-03-29 23:54:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-03-29 23:54:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 837. [2018-03-29 23:54:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-03-29 23:54:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 857 transitions. [2018-03-29 23:54:03,177 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 857 transitions. Word has length 698 [2018-03-29 23:54:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:03,178 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 857 transitions. [2018-03-29 23:54:03,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-03-29 23:54:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 857 transitions. [2018-03-29 23:54:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-03-29 23:54:03,181 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:03,181 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-03-29 23:54:03,181 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-03-29 23:54:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash -129045497, 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-03-29 23:54:03,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:03,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 4475 proven. 351 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-03-29 23:54:03,997 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 4475 proven. 351 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-03-29 23:54:04,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:04,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 62 [2018-03-29 23:54:04,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-03-29 23:54:04,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-03-29 23:54:04,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3564, Unknown=0, NotChecked=0, Total=3906 [2018-03-29 23:54:04,813 INFO L87 Difference]: Start difference. First operand 837 states and 857 transitions. Second operand 63 states. [2018-03-29 23:54:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:06,839 INFO L93 Difference]: Finished difference Result 853 states and 876 transitions. [2018-03-29 23:54:06,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-03-29 23:54:06,868 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 707 [2018-03-29 23:54:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:06,871 INFO L225 Difference]: With dead ends: 853 [2018-03-29 23:54:06,871 INFO L226 Difference]: Without dead ends: 852 [2018-03-29 23:54:06,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1463 GetRequests, 1330 SyntacticMatches, 23 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1254, Invalid=11178, Unknown=0, NotChecked=0, Total=12432 [2018-03-29 23:54:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-03-29 23:54:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 837. [2018-03-29 23:54:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-03-29 23:54:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 856 transitions. [2018-03-29 23:54:06,898 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 856 transitions. Word has length 707 [2018-03-29 23:54:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:06,899 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 856 transitions. [2018-03-29 23:54:06,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-03-29 23:54:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 856 transitions. [2018-03-29 23:54:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2018-03-29 23:54:06,902 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:06,902 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-03-29 23:54:06,902 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-03-29 23:54:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1765588594, 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-03-29 23:54:06,911 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:07,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15640 backedges. 4900 proven. 435 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-03-29 23:54:07,726 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15640 backedges. 4900 proven. 435 refuted. 0 times theorem prover too weak. 10305 trivial. 0 not checked. [2018-03-29 23:54:08,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:08,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 67 [2018-03-29 23:54:08,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-03-29 23:54:08,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-03-29 23:54:08,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3849, Unknown=0, NotChecked=0, Total=4422 [2018-03-29 23:54:08,539 INFO L87 Difference]: Start difference. First operand 837 states and 856 transitions. Second operand 67 states. [2018-03-29 23:54:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:10,359 INFO L93 Difference]: Finished difference Result 1171 states and 1210 transitions. [2018-03-29 23:54:10,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-03-29 23:54:10,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 716 [2018-03-29 23:54:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:10,362 INFO L225 Difference]: With dead ends: 1171 [2018-03-29 23:54:10,362 INFO L226 Difference]: Without dead ends: 951 [2018-03-29 23:54:10,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1493 GetRequests, 1343 SyntacticMatches, 23 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2484, Invalid=14028, Unknown=0, NotChecked=0, Total=16512 [2018-03-29 23:54:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-03-29 23:54:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 938. [2018-03-29 23:54:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-03-29 23:54:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 957 transitions. [2018-03-29 23:54:10,393 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 957 transitions. Word has length 716 [2018-03-29 23:54:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:10,393 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 957 transitions. [2018-03-29 23:54:10,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-03-29 23:54:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 957 transitions. [2018-03-29 23:54:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-03-29 23:54:10,399 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:10,399 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-03-29 23:54:10,399 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-03-29 23:54:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash -733106184, 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-03-29 23:54:10,407 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:10,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20965 backedges. 9853 proven. 342 refuted. 0 times theorem prover too weak. 10770 trivial. 0 not checked. [2018-03-29 23:54:11,269 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20965 backedges. 9853 proven. 342 refuted. 0 times theorem prover too weak. 10770 trivial. 0 not checked. [2018-03-29 23:54:12,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:12,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 64 [2018-03-29 23:54:12,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-03-29 23:54:12,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-03-29 23:54:12,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=3486, Unknown=0, NotChecked=0, Total=4032 [2018-03-29 23:54:12,575 INFO L87 Difference]: Start difference. First operand 938 states and 957 transitions. Second operand 64 states. [2018-03-29 23:54:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:14,062 INFO L93 Difference]: Finished difference Result 1176 states and 1216 transitions. [2018-03-29 23:54:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-03-29 23:54:14,062 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 817 [2018-03-29 23:54:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:14,066 INFO L225 Difference]: With dead ends: 1176 [2018-03-29 23:54:14,066 INFO L226 Difference]: Without dead ends: 950 [2018-03-29 23:54:14,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1683 GetRequests, 1549 SyntacticMatches, 23 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1992, Invalid=10664, Unknown=0, NotChecked=0, Total=12656 [2018-03-29 23:54:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-03-29 23:54:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 938. [2018-03-29 23:54:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-03-29 23:54:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 955 transitions. [2018-03-29 23:54:14,098 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 955 transitions. Word has length 817 [2018-03-29 23:54:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:14,099 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 955 transitions. [2018-03-29 23:54:14,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-03-29 23:54:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 955 transitions. [2018-03-29 23:54:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2018-03-29 23:54:14,103 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:14,103 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-03-29 23:54:14,103 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-03-29 23:54:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1092298531, 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-03-29 23:54:14,109 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:14,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21566 backedges. 5951 proven. 435 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-03-29 23:54:15,181 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21566 backedges. 5951 proven. 435 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-03-29 23:54:16,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:16,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 68 [2018-03-29 23:54:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-03-29 23:54:16,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-03-29 23:54:16,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=4294, Unknown=0, NotChecked=0, Total=4692 [2018-03-29 23:54:16,187 INFO L87 Difference]: Start difference. First operand 938 states and 955 transitions. Second operand 69 states. [2018-03-29 23:54:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:18,550 INFO L93 Difference]: Finished difference Result 954 states and 973 transitions. [2018-03-29 23:54:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-03-29 23:54:18,551 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 826 [2018-03-29 23:54:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:18,553 INFO L225 Difference]: With dead ends: 954 [2018-03-29 23:54:18,553 INFO L226 Difference]: Without dead ends: 953 [2018-03-29 23:54:18,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1560 SyntacticMatches, 25 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4583 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1474, Invalid=13532, Unknown=0, NotChecked=0, Total=15006 [2018-03-29 23:54:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-03-29 23:54:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 938. [2018-03-29 23:54:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-03-29 23:54:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 954 transitions. [2018-03-29 23:54:18,582 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 954 transitions. Word has length 826 [2018-03-29 23:54:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:18,583 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 954 transitions. [2018-03-29 23:54:18,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-03-29 23:54:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 954 transitions. [2018-03-29 23:54:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-03-29 23:54:18,587 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:18,587 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-03-29 23:54:18,587 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-03-29 23:54:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -351583530, 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-03-29 23:54:18,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:18,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22176 backedges. 6468 proven. 528 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-03-29 23:54:19,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22176 backedges. 6468 proven. 528 refuted. 0 times theorem prover too weak. 15180 trivial. 0 not checked. [2018-03-29 23:54:20,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:20,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 73 [2018-03-29 23:54:20,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-03-29 23:54:20,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-03-29 23:54:20,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=4583, Unknown=0, NotChecked=0, Total=5256 [2018-03-29 23:54:20,547 INFO L87 Difference]: Start difference. First operand 938 states and 954 transitions. Second operand 73 states. [2018-03-29 23:54:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:22,691 INFO L93 Difference]: Finished difference Result 1272 states and 1305 transitions. [2018-03-29 23:54:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-03-29 23:54:22,691 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 835 [2018-03-29 23:54:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:22,694 INFO L225 Difference]: With dead ends: 1272 [2018-03-29 23:54:22,694 INFO L226 Difference]: Without dead ends: 1061 [2018-03-29 23:54:22,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1737 GetRequests, 1573 SyntacticMatches, 25 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5255 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2939, Invalid=16801, Unknown=0, NotChecked=0, Total=19740 [2018-03-29 23:54:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-03-29 23:54:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1048. [2018-03-29 23:54:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-03-29 23:54:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1064 transitions. [2018-03-29 23:54:22,729 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1064 transitions. Word has length 835 [2018-03-29 23:54:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:22,729 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1064 transitions. [2018-03-29 23:54:22,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-03-29 23:54:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1064 transitions. [2018-03-29 23:54:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2018-03-29 23:54:22,734 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:22,734 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-03-29 23:54:22,735 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-03-29 23:54:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1856909061, 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-03-29 23:54:22,740 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:22,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29154 backedges. 12988 proven. 425 refuted. 0 times theorem prover too weak. 15741 trivial. 0 not checked. [2018-03-29 23:54:23,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29154 backedges. 12988 proven. 425 refuted. 0 times theorem prover too weak. 15741 trivial. 0 not checked. [2018-03-29 23:54:24,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:24,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 70 [2018-03-29 23:54:24,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-03-29 23:54:24,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-03-29 23:54:24,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=4186, Unknown=0, NotChecked=0, Total=4830 [2018-03-29 23:54:24,893 INFO L87 Difference]: Start difference. First operand 1048 states and 1064 transitions. Second operand 70 states. [2018-03-29 23:54:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:26,031 INFO L93 Difference]: Finished difference Result 1277 states and 1310 transitions. [2018-03-29 23:54:26,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-03-29 23:54:26,031 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 945 [2018-03-29 23:54:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:26,033 INFO L225 Difference]: With dead ends: 1277 [2018-03-29 23:54:26,034 INFO L226 Difference]: Without dead ends: 1060 [2018-03-29 23:54:26,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1944 GetRequests, 1797 SyntacticMatches, 25 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5824 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2378, Invalid=12874, Unknown=0, NotChecked=0, Total=15252 [2018-03-29 23:54:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2018-03-29 23:54:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1048. [2018-03-29 23:54:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-03-29 23:54:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1062 transitions. [2018-03-29 23:54:26,067 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1062 transitions. Word has length 945 [2018-03-29 23:54:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:26,067 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1062 transitions. [2018-03-29 23:54:26,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-03-29 23:54:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1062 transitions. [2018-03-29 23:54:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-03-29 23:54:26,072 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:26,073 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-03-29 23:54:26,073 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-03-29 23:54:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1577696754, 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-03-29 23:54:26,078 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:26,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 29865 backedges. 7722 proven. 528 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-03-29 23:54:27,293 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 29865 backedges. 7722 proven. 528 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-03-29 23:54:28,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:28,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 74 [2018-03-29 23:54:28,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-03-29 23:54:28,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-03-29 23:54:28,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=5092, Unknown=0, NotChecked=0, Total=5550 [2018-03-29 23:54:28,515 INFO L87 Difference]: Start difference. First operand 1048 states and 1062 transitions. Second operand 75 states. [2018-03-29 23:54:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:31,347 INFO L93 Difference]: Finished difference Result 1064 states and 1079 transitions. [2018-03-29 23:54:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-03-29 23:54:31,347 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 954 [2018-03-29 23:54:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:31,350 INFO L225 Difference]: With dead ends: 1064 [2018-03-29 23:54:31,350 INFO L226 Difference]: Without dead ends: 1063 [2018-03-29 23:54:31,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1967 GetRequests, 1808 SyntacticMatches, 27 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5485 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1711, Invalid=16111, Unknown=0, NotChecked=0, Total=17822 [2018-03-29 23:54:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-03-29 23:54:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1048. [2018-03-29 23:54:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-03-29 23:54:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1061 transitions. [2018-03-29 23:54:31,384 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1061 transitions. Word has length 954 [2018-03-29 23:54:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:31,384 INFO L459 AbstractCegarLoop]: Abstraction has 1048 states and 1061 transitions. [2018-03-29 23:54:31,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-03-29 23:54:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1061 transitions. [2018-03-29 23:54:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-03-29 23:54:31,390 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:31,390 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-03-29 23:54:31,390 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-03-29 23:54:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash 159900903, 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-03-29 23:54:31,396 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:31,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30585 backedges. 8340 proven. 630 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-03-29 23:54:32,566 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30585 backedges. 8340 proven. 630 refuted. 0 times theorem prover too weak. 21615 trivial. 0 not checked. [2018-03-29 23:54:33,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:33,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 79 [2018-03-29 23:54:33,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-03-29 23:54:33,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-03-29 23:54:33,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=5381, Unknown=0, NotChecked=0, Total=6162 [2018-03-29 23:54:33,726 INFO L87 Difference]: Start difference. First operand 1048 states and 1061 transitions. Second operand 79 states. [2018-03-29 23:54:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 23:54:36,203 INFO L93 Difference]: Finished difference Result 1382 states and 1409 transitions. [2018-03-29 23:54:36,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-03-29 23:54:36,204 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 963 [2018-03-29 23:54:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 23:54:36,207 INFO L225 Difference]: With dead ends: 1382 [2018-03-29 23:54:36,207 INFO L226 Difference]: Without dead ends: 1180 [2018-03-29 23:54:36,208 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1999 GetRequests, 1821 SyntacticMatches, 27 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6243 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3432, Invalid=19824, Unknown=0, NotChecked=0, Total=23256 [2018-03-29 23:54:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2018-03-29 23:54:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1167. [2018-03-29 23:54:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-03-29 23:54:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1180 transitions. [2018-03-29 23:54:36,243 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1180 transitions. Word has length 963 [2018-03-29 23:54:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 23:54:36,244 INFO L459 AbstractCegarLoop]: Abstraction has 1167 states and 1180 transitions. [2018-03-29 23:54:36,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-03-29 23:54:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1180 transitions. [2018-03-29 23:54:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1083 [2018-03-29 23:54:36,250 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 23:54:36,250 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-03-29 23:54:36,250 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-03-29 23:54:36,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1119395843, 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-03-29 23:54:36,256 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 23:54:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 23:54:36,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 23:54:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 39528 backedges. 16730 proven. 517 refuted. 0 times theorem prover too weak. 22281 trivial. 0 not checked. [2018-03-29 23:54:37,521 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 23:54:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 39528 backedges. 16730 proven. 517 refuted. 0 times theorem prover too weak. 22281 trivial. 0 not checked. [2018-03-29 23:54:38,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 23:54:38,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 76 [2018-03-29 23:54:38,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-03-29 23:54:38,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-03-29 23:54:38,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=4950, Unknown=0, NotChecked=0, Total=5700 [2018-03-29 23:54:38,883 INFO L87 Difference]: Start difference. First operand 1167 states and 1180 transitions. Second operand 76 states. Received shutdown request... [2018-03-29 23:54:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-03-29 23:54:39,998 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 23:54:40,000 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 23:54:40,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 11:54:40 BasicIcfg [2018-03-29 23:54:40,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 23:54:40,001 INFO L168 Benchmark]: Toolchain (without parser) took 112065.97 ms. Allocated memory was 306.2 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 248.6 MB in the beginning and 462.8 MB in the end (delta: -214.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-03-29 23:54:40,002 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 23:54:40,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.93 ms. Allocated memory is still 306.2 MB. Free memory was 248.6 MB in the beginning and 238.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-03-29 23:54:40,002 INFO L168 Benchmark]: Boogie Preprocessor took 34.43 ms. Allocated memory is still 306.2 MB. Free memory was 238.5 MB in the beginning and 236.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-29 23:54:40,002 INFO L168 Benchmark]: RCFGBuilder took 349.35 ms. Allocated memory was 306.2 MB in the beginning and 469.8 MB in the end (delta: 163.6 MB). Free memory was 236.6 MB in the beginning and 435.3 MB in the end (delta: -198.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-03-29 23:54:40,002 INFO L168 Benchmark]: IcfgTransformer took 21029.98 ms. Allocated memory was 469.8 MB in the beginning and 875.6 MB in the end (delta: 405.8 MB). Free memory was 435.3 MB in the beginning and 455.5 MB in the end (delta: -20.2 MB). Peak memory consumption was 385.6 MB. Max. memory is 5.3 GB. [2018-03-29 23:54:40,003 INFO L168 Benchmark]: TraceAbstraction took 90430.41 ms. Allocated memory was 875.6 MB in the beginning and 1.8 GB in the end (delta: 910.2 MB). Free memory was 455.5 MB in the beginning and 462.8 MB in the end (delta: -7.3 MB). Peak memory consumption was 902.9 MB. Max. memory is 5.3 GB. [2018-03-29 23:54:40,004 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 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.93 ms. Allocated memory is still 306.2 MB. Free memory was 248.6 MB in the beginning and 238.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.43 ms. Allocated memory is still 306.2 MB. Free memory was 238.5 MB in the beginning and 236.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 349.35 ms. Allocated memory was 306.2 MB in the beginning and 469.8 MB in the end (delta: 163.6 MB). Free memory was 236.6 MB in the beginning and 435.3 MB in the end (delta: -198.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * IcfgTransformer took 21029.98 ms. Allocated memory was 469.8 MB in the beginning and 875.6 MB in the end (delta: 405.8 MB). Free memory was 435.3 MB in the beginning and 455.5 MB in the end (delta: -20.2 MB). Peak memory consumption was 385.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 90430.41 ms. Allocated memory was 875.6 MB in the beginning and 1.8 GB in the end (delta: 910.2 MB). Free memory was 455.5 MB in the beginning and 462.8 MB in the end (delta: -7.3 MB). Peak memory consumption was 902.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 539 LocStat_NO_SUPPORTING_DISEQUALITIES : 207 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 76 TransStat_MAX_WEQGRAPH_SIZE : 4 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 77 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2343.10 RENAME_VARIABLES(MILLISECONDS) : 1701.58 UNFREEZE(MILLISECONDS) : 0.00 CONJOIN(MILLISECONDS) : 2359.50 PROJECTAWAY(MILLISECONDS) : 4773.49 ADD_WEAK_EQUALITY(MILLISECONDS) : 6.81 DISJOIN(MILLISECONDS) : 176.18 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1739.78 ADD_EQUALITY(MILLISECONDS) : 9.53 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.00 ADD_DISEQUALITY(MILLISECONDS) : 0.34 #CONJOIN_DISJUNCTIVE : 740 #RENAME_VARIABLES : 1648 #UNFREEZE : 0 #CONJOIN : 1000 #PROJECTAWAY : 965 #ADD_WEAK_EQUALITY : 10 #DISJOIN : 233 #RENAME_VARIABLES_DISJUNCTIVE : 1628 #ADD_EQUALITY : 68 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: WeqCcManagerStatistics FREEZE(MILLISECONDS) : 14617.42 ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 2343.60 FILTERREDUNDANT(MILLISECONDS) : 0.00 REPORTWEQ(MILLISECONDS) : 6.63 JOIN(MILLISECONDS) : 163.58 RENAMEVARS(MILLISECONDS) : 1687.94 FLATTENLABELS(MILLISECONDS) : 0.00 COPY(MILLISECONDS) : 0.00 ISSTRONGERTHAN(MILLISECONDS) : 10668.77 ISLABELSTRONGERTHAN(MILLISECONDS) : 3602.39 ISWEQGRAPHSTRONGERTHAN(MILLISECONDS) : 155.89 UNFREEZE(MILLISECONDS) : 119.81 REPORTCONTAINS(MILLISECONDS) : 0.55 PROJECTAWAY(MILLISECONDS) : 4539.68 MEETEDGELABELS(MILLISECONDS) : 175.42 REPORTEQUALITY(MILLISECONDS) : 272.88 ADDALLNODES(MILLISECONDS) : 326.28 REPORTDISEQUALITY(MILLISECONDS) : 5.11 WEQGRAPHJOIN(MILLISECONDS) : 62.28 #FREEZE : 11801 #ADDNODE : 0 #MEET : 670 #FILTERREDUNDANT : 0 #REPORTWEQ : 10 #JOIN : 233 #RENAMEVARS : 1648 #FLATTENLABELS : 0 #COPY : 0 #ISSTRONGERTHAN : 3525 #ISLABELSTRONGERTHAN : 105076 #ISWEQGRAPHSTRONGERTHAN : 1145 #UNFREEZE : 4525 #REPORTCONTAINS : 23 #PROJECTAWAY : 2207 #MEETEDGELABELS : 2428 #REPORTEQUALITY : 6250 #ADDALLNODES : 670 #REPORTDISEQUALITY : 1611 #WEQGRAPHJOIN : 233 - StatisticsResult: CcManagerStatistics ADDNODE(MILLISECONDS) : 0.00 MEET(MILLISECONDS) : 4913.01 IS_STRONGER_THAN(MILLISECONDS) : 4377.13 REPORT_EQUALITY(MILLISECONDS) : 2329.66 FILTERREDUNDANT(MILLISECONDS) : 2993.69 ADD_ALL_ELEMENTS(MILLISECONDS) : 2548.15 JOIN(MILLISECONDS) : 70.01 ALIGN_ELEMENTS(MILLISECONDS) : 3189.06 COPY(MILLISECONDS) : 0.00 REPORT_DISEQUALITY(MILLISECONDS) : 361.76 UNFREEZE(MILLISECONDS) : 0.00 OVERALL(MILLISECONDS) : 8899.74 REPORTCONTAINS(MILLISECONDS) : 16.00 REMOVE(MILLISECONDS) : 0.00 PROJECT_TO_ELEMENTS(MILLISECONDS) : 1644.13 #ADDNODE : 0 #MEET : 21272 #IS_STRONGER_THAN : 186835 #REPORT_EQUALITY : 251901 #FILTERREDUNDANT : 234701 #ADD_ALL_ELEMENTS : 76266 #JOIN : 233 #ALIGN_ELEMENTS : 26957 #COPY : 0 #REPORT_DISEQUALITY : 69584 #UNFREEZE : 0 #OVERALL : 889991 #REPORTCONTAINS : 1069 #REMOVE : 0 #PROJECT_TO_ELEMENTS : 21173 * 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 constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 20). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1167states) and interpolant automaton (currently 73 states, 76 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. TIMEOUT Result, 90.3s OverallTime, 52 OverallIterations, 103 TraceHistogramMax, 44.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4054 SDtfs, 11156 SDslu, 55234 SDs, 0 SdLazy, 49842 SolverSat, 2199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37057 GetRequests, 33299 SyntacticMatches, 633 SemanticMatches, 3124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86536 ImplicationChecksByTransitivity, 47.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1167occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 51 MinimizatonAttempts, 690 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 17824 NumberOfCodeBlocks, 17824 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 35544 ConstructedInterpolants, 983 QuantifiedInterpolants, 48104738 SizeOfPredicates, 1062 NumberOfNonLiveVariables, 35384 ConjunctsInSsa, 1424 ConjunctsInUnsatCore, 104 InterpolantComputations, 18 PerfectInterpolantSequences, 637772/653506 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-03-29_23-54-40-012.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-03-29_23-54-40-012.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-03-29_23-54-40-012.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-03-29_23-54-40-012.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-03-29_23-54-40-012.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-03-29_23-54-40-012.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-03-29_23-54-40-012.csv Completed graceful shutdown