./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:43:47,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:43:47,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:43:47,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:43:47,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:43:47,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:43:47,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:43:47,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:43:47,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:43:47,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:43:47,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:43:47,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:43:47,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:43:47,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:43:47,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:43:47,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:43:47,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:43:47,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:43:47,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:43:47,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:43:47,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:43:47,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:43:47,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:43:47,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:43:47,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:43:47,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:43:47,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:43:47,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:43:47,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:43:47,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:43:47,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:43:47,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:43:47,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:43:47,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:43:47,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:43:47,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:43:47,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:43:47,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:43:47,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:43:47,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:43:47,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:43:47,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-29 04:43:48,035 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:43:48,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:43:48,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:43:48,046 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:43:48,047 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:43:48,047 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:43:48,047 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:43:48,047 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:43:48,048 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:43:48,048 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:43:48,049 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:43:48,049 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:43:48,050 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:43:48,050 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:43:48,050 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:43:48,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:43:48,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:43:48,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:43:48,053 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:43:48,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 04:43:48,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:43:48,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:43:48,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:43:48,054 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 04:43:48,054 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 04:43:48,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:43:48,055 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:43:48,055 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:43:48,055 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:43:48,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:43:48,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:43:48,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:43:48,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:43:48,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:43:48,058 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:43:48,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:43:48,058 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:43:48,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:43:48,059 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2021-10-29 04:43:48,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:43:48,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:43:48,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:43:48,390 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:43:48,390 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:43:48,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-10-29 04:43:48,461 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/data/6da7529bb/69917db262bf432db49473bc074f77b9/FLAGa18f6dbf3 [2021-10-29 04:43:49,084 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:43:49,085 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2021-10-29 04:43:49,115 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/data/6da7529bb/69917db262bf432db49473bc074f77b9/FLAGa18f6dbf3 [2021-10-29 04:43:49,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/data/6da7529bb/69917db262bf432db49473bc074f77b9 [2021-10-29 04:43:49,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:43:49,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:43:49,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:43:49,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:43:49,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:43:49,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:49,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a6e5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49, skipping insertion in model container [2021-10-29 04:43:49,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:49,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:43:49,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:43:49,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-10-29 04:43:49,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:43:49,844 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:43:49,874 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2021-10-29 04:43:49,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:43:49,923 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:43:49,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49 WrapperNode [2021-10-29 04:43:49,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:43:49,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:43:49,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:43:49,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:43:49,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:49,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:43:50,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:43:50,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:43:50,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:43:50,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:43:50,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:43:50,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:43:50,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:43:50,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (1/1) ... [2021-10-29 04:43:50,112 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:43:50,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:43:50,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:43:50,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:43:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-29 04:43:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2021-10-29 04:43:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2021-10-29 04:43:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-29 04:43:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:43:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-10-29 04:43:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-10-29 04:43:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-29 04:43:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 04:43:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-29 04:43:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2021-10-29 04:43:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2021-10-29 04:43:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2021-10-29 04:43:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2021-10-29 04:43:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:43:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:43:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:43:51,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:43:51,470 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-10-29 04:43:51,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:51 BoogieIcfgContainer [2021-10-29 04:43:51,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:43:51,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:43:51,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:43:51,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:43:51,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:43:49" (1/3) ... [2021-10-29 04:43:51,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb1a439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:43:51, skipping insertion in model container [2021-10-29 04:43:51,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:49" (2/3) ... [2021-10-29 04:43:51,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb1a439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:43:51, skipping insertion in model container [2021-10-29 04:43:51,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:51" (3/3) ... [2021-10-29 04:43:51,484 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2021-10-29 04:43:51,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:43:51,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 159 error locations. [2021-10-29 04:43:51,543 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:43:51,553 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:43:51,554 INFO L340 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2021-10-29 04:43:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 171 states have (on average 2.47953216374269) internal successors, (424), 332 states have internal predecessors, (424), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-29 04:43:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 04:43:51,583 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:51,584 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:51,584 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1934548942, now seen corresponding path program 1 times [2021-10-29 04:43:51,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:51,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430026508] [2021-10-29 04:43:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:51,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:51,837 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:51,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430026508] [2021-10-29 04:43:51,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430026508] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:51,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:51,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:43:51,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741543120] [2021-10-29 04:43:51,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:51,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:51,863 INFO L87 Difference]: Start difference. First operand has 342 states, 171 states have (on average 2.47953216374269) internal successors, (424), 332 states have internal predecessors, (424), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:52,205 INFO L93 Difference]: Finished difference Result 342 states and 361 transitions. [2021-10-29 04:43:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-29 04:43:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:52,229 INFO L225 Difference]: With dead ends: 342 [2021-10-29 04:43:52,229 INFO L226 Difference]: Without dead ends: 341 [2021-10-29 04:43:52,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-29 04:43:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2021-10-29 04:43:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 171 states have (on average 2.0) internal successors, (342), 329 states have internal predecessors, (342), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-29 04:43:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 356 transitions. [2021-10-29 04:43:52,294 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 356 transitions. Word has length 7 [2021-10-29 04:43:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:52,294 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 356 transitions. [2021-10-29 04:43:52,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 356 transitions. [2021-10-29 04:43:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 04:43:52,295 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:52,295 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:52,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:43:52,296 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:52,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1934548943, now seen corresponding path program 1 times [2021-10-29 04:43:52,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:52,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343947098] [2021-10-29 04:43:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:52,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:52,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:52,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343947098] [2021-10-29 04:43:52,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343947098] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:52,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:52,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:43:52,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549979386] [2021-10-29 04:43:52,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:52,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:52,372 INFO L87 Difference]: Start difference. First operand 339 states and 356 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:52,673 INFO L93 Difference]: Finished difference Result 339 states and 358 transitions. [2021-10-29 04:43:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-29 04:43:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:52,676 INFO L225 Difference]: With dead ends: 339 [2021-10-29 04:43:52,676 INFO L226 Difference]: Without dead ends: 339 [2021-10-29 04:43:52,677 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-10-29 04:43:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2021-10-29 04:43:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 171 states have (on average 1.9883040935672514) internal successors, (340), 327 states have internal predecessors, (340), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-29 04:43:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 354 transitions. [2021-10-29 04:43:52,715 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 354 transitions. Word has length 7 [2021-10-29 04:43:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:52,716 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 354 transitions. [2021-10-29 04:43:52,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 354 transitions. [2021-10-29 04:43:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:43:52,717 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:52,717 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:52,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:43:52,717 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash -647647508, now seen corresponding path program 1 times [2021-10-29 04:43:52,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:52,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923173336] [2021-10-29 04:43:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:52,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:52,793 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:52,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923173336] [2021-10-29 04:43:52,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923173336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:52,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:52,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:43:52,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249699980] [2021-10-29 04:43:52,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:52,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:52,795 INFO L87 Difference]: Start difference. First operand 337 states and 354 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:52,980 INFO L93 Difference]: Finished difference Result 334 states and 351 transitions. [2021-10-29 04:43:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:52,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-29 04:43:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:52,983 INFO L225 Difference]: With dead ends: 334 [2021-10-29 04:43:52,984 INFO L226 Difference]: Without dead ends: 334 [2021-10-29 04:43:52,984 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-10-29 04:43:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-10-29 04:43:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 171 states have (on average 1.9707602339181287) internal successors, (337), 324 states have internal predecessors, (337), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-29 04:43:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 351 transitions. [2021-10-29 04:43:53,024 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 351 transitions. Word has length 9 [2021-10-29 04:43:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:53,025 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 351 transitions. [2021-10-29 04:43:53,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 351 transitions. [2021-10-29 04:43:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:43:53,026 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:53,026 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:53,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:43:53,026 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash -647647507, now seen corresponding path program 1 times [2021-10-29 04:43:53,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:53,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934768635] [2021-10-29 04:43:53,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:53,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:53,123 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:53,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934768635] [2021-10-29 04:43:53,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934768635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:53,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:53,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:43:53,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629559760] [2021-10-29 04:43:53,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:53,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:53,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:53,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:53,144 INFO L87 Difference]: Start difference. First operand 334 states and 351 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:53,332 INFO L93 Difference]: Finished difference Result 331 states and 348 transitions. [2021-10-29 04:43:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:53,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-29 04:43:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:53,335 INFO L225 Difference]: With dead ends: 331 [2021-10-29 04:43:53,335 INFO L226 Difference]: Without dead ends: 331 [2021-10-29 04:43:53,336 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-29 04:43:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2021-10-29 04:43:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 171 states have (on average 1.9532163742690059) internal successors, (334), 321 states have internal predecessors, (334), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-29 04:43:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 348 transitions. [2021-10-29 04:43:53,348 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 348 transitions. Word has length 9 [2021-10-29 04:43:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:53,348 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 348 transitions. [2021-10-29 04:43:53,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 348 transitions. [2021-10-29 04:43:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:43:53,349 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:53,350 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:53,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:43:53,350 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash -619277081, now seen corresponding path program 1 times [2021-10-29 04:43:53,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:53,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777705334] [2021-10-29 04:43:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:53,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:53,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:53,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777705334] [2021-10-29 04:43:53,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777705334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:53,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:53,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:43:53,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475230419] [2021-10-29 04:43:53,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:53,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:53,478 INFO L87 Difference]: Start difference. First operand 331 states and 348 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:53,561 INFO L93 Difference]: Finished difference Result 353 states and 378 transitions. [2021-10-29 04:43:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:43:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-29 04:43:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:53,565 INFO L225 Difference]: With dead ends: 353 [2021-10-29 04:43:53,565 INFO L226 Difference]: Without dead ends: 353 [2021-10-29 04:43:53,565 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-29 04:43:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 347. [2021-10-29 04:43:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 180 states have (on average 1.9277777777777778) internal successors, (347), 330 states have internal predecessors, (347), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (15), 10 states have call predecessors, (15), 12 states have call successors, (15) [2021-10-29 04:43:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 374 transitions. [2021-10-29 04:43:53,581 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 374 transitions. Word has length 9 [2021-10-29 04:43:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:53,581 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 374 transitions. [2021-10-29 04:43:53,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 374 transitions. [2021-10-29 04:43:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:43:53,586 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:53,587 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:53,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:43:53,587 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1073762538, now seen corresponding path program 1 times [2021-10-29 04:43:53,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:53,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547614626] [2021-10-29 04:43:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:53,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:53,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:53,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547614626] [2021-10-29 04:43:53,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547614626] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:53,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:53,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 04:43:53,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237618526] [2021-10-29 04:43:53,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:43:53,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:53,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:43:53,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:43:53,712 INFO L87 Difference]: Start difference. First operand 347 states and 374 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:54,302 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2021-10-29 04:43:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 04:43:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-29 04:43:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:54,305 INFO L225 Difference]: With dead ends: 366 [2021-10-29 04:43:54,306 INFO L226 Difference]: Without dead ends: 366 [2021-10-29 04:43:54,306 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:43:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-29 04:43:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2021-10-29 04:43:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 188 states have (on average 1.898936170212766) internal successors, (357), 337 states have internal predecessors, (357), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-29 04:43:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 386 transitions. [2021-10-29 04:43:54,321 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 386 transitions. Word has length 12 [2021-10-29 04:43:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:54,322 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 386 transitions. [2021-10-29 04:43:54,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 386 transitions. [2021-10-29 04:43:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:43:54,322 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:54,323 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:54,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:43:54,323 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1073762537, now seen corresponding path program 1 times [2021-10-29 04:43:54,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:54,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785761816] [2021-10-29 04:43:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:54,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:54,490 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:54,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785761816] [2021-10-29 04:43:54,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785761816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:54,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:54,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:43:54,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016922765] [2021-10-29 04:43:54,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 04:43:54,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 04:43:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:43:54,492 INFO L87 Difference]: Start difference. First operand 356 states and 386 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:55,153 INFO L93 Difference]: Finished difference Result 364 states and 394 transitions. [2021-10-29 04:43:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:43:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-29 04:43:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:55,157 INFO L225 Difference]: With dead ends: 364 [2021-10-29 04:43:55,157 INFO L226 Difference]: Without dead ends: 364 [2021-10-29 04:43:55,157 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:43:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-29 04:43:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2021-10-29 04:43:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 188 states have (on average 1.8882978723404256) internal successors, (355), 337 states have internal predecessors, (355), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-29 04:43:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 384 transitions. [2021-10-29 04:43:55,169 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 384 transitions. Word has length 12 [2021-10-29 04:43:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:55,170 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 384 transitions. [2021-10-29 04:43:55,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 384 transitions. [2021-10-29 04:43:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:43:55,171 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:55,171 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:55,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:43:55,171 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1073127878, now seen corresponding path program 1 times [2021-10-29 04:43:55,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:55,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943066409] [2021-10-29 04:43:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:55,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:55,205 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:55,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943066409] [2021-10-29 04:43:55,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943066409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:55,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:55,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:43:55,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387399009] [2021-10-29 04:43:55,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:55,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:55,207 INFO L87 Difference]: Start difference. First operand 356 states and 384 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:55,435 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2021-10-29 04:43:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:55,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-29 04:43:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:55,438 INFO L225 Difference]: With dead ends: 355 [2021-10-29 04:43:55,438 INFO L226 Difference]: Without dead ends: 355 [2021-10-29 04:43:55,439 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-10-29 04:43:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2021-10-29 04:43:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 188 states have (on average 1.8829787234042554) internal successors, (354), 336 states have internal predecessors, (354), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-29 04:43:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 383 transitions. [2021-10-29 04:43:55,450 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 383 transitions. Word has length 13 [2021-10-29 04:43:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:55,450 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 383 transitions. [2021-10-29 04:43:55,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 383 transitions. [2021-10-29 04:43:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:43:55,451 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:55,451 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:55,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:43:55,452 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1073127879, now seen corresponding path program 1 times [2021-10-29 04:43:55,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:55,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930270273] [2021-10-29 04:43:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:55,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:55,495 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:55,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930270273] [2021-10-29 04:43:55,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930270273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:55,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:55,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:43:55,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039806110] [2021-10-29 04:43:55,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:55,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:55,497 INFO L87 Difference]: Start difference. First operand 355 states and 383 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:55,664 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-10-29 04:43:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:43:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-29 04:43:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:55,667 INFO L225 Difference]: With dead ends: 354 [2021-10-29 04:43:55,667 INFO L226 Difference]: Without dead ends: 354 [2021-10-29 04:43:55,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-29 04:43:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-10-29 04:43:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 188 states have (on average 1.877659574468085) internal successors, (353), 335 states have internal predecessors, (353), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) [2021-10-29 04:43:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 382 transitions. [2021-10-29 04:43:55,678 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 382 transitions. Word has length 13 [2021-10-29 04:43:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:55,678 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 382 transitions. [2021-10-29 04:43:55,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 382 transitions. [2021-10-29 04:43:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 04:43:55,680 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:55,680 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:55,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:43:55,681 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 483741159, now seen corresponding path program 1 times [2021-10-29 04:43:55,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:55,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26271512] [2021-10-29 04:43:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:55,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:55,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:55,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26271512] [2021-10-29 04:43:55,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26271512] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:55,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:55,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-29 04:43:55,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017719695] [2021-10-29 04:43:55,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 04:43:55,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 04:43:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:43:55,945 INFO L87 Difference]: Start difference. First operand 354 states and 382 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:56,603 INFO L93 Difference]: Finished difference Result 381 states and 414 transitions. [2021-10-29 04:43:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 04:43:56,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-29 04:43:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:56,606 INFO L225 Difference]: With dead ends: 381 [2021-10-29 04:43:56,606 INFO L226 Difference]: Without dead ends: 381 [2021-10-29 04:43:56,607 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-29 04:43:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-29 04:43:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 368. [2021-10-29 04:43:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 199 states have (on average 1.8542713567839195) internal successors, (369), 346 states have internal predecessors, (369), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:43:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 404 transitions. [2021-10-29 04:43:56,642 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 404 transitions. Word has length 15 [2021-10-29 04:43:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:56,642 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 404 transitions. [2021-10-29 04:43:56,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 404 transitions. [2021-10-29 04:43:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 04:43:56,643 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:56,644 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:56,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 04:43:56,644 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1544475002, now seen corresponding path program 1 times [2021-10-29 04:43:56,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:56,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920483066] [2021-10-29 04:43:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:56,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-29 04:43:56,759 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:56,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920483066] [2021-10-29 04:43:56,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920483066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:56,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:56,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:43:56,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22916066] [2021-10-29 04:43:56,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 04:43:56,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:56,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 04:43:56,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:43:56,761 INFO L87 Difference]: Start difference. First operand 368 states and 404 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:57,163 INFO L93 Difference]: Finished difference Result 366 states and 402 transitions. [2021-10-29 04:43:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:43:57,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 04:43:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:57,167 INFO L225 Difference]: With dead ends: 366 [2021-10-29 04:43:57,167 INFO L226 Difference]: Without dead ends: 366 [2021-10-29 04:43:57,167 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:43:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-29 04:43:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-10-29 04:43:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 199 states have (on average 1.8442211055276383) internal successors, (367), 344 states have internal predecessors, (367), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:43:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 402 transitions. [2021-10-29 04:43:57,178 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 402 transitions. Word has length 23 [2021-10-29 04:43:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:57,179 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 402 transitions. [2021-10-29 04:43:57,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 402 transitions. [2021-10-29 04:43:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 04:43:57,180 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:57,180 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:57,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:43:57,180 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1544475003, now seen corresponding path program 1 times [2021-10-29 04:43:57,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:57,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125451756] [2021-10-29 04:43:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:57,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-29 04:43:57,273 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:57,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125451756] [2021-10-29 04:43:57,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125451756] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:57,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:57,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:43:57,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083572469] [2021-10-29 04:43:57,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:43:57,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:43:57,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:57,275 INFO L87 Difference]: Start difference. First operand 366 states and 402 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:57,798 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2021-10-29 04:43:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:43:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 04:43:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:57,801 INFO L225 Difference]: With dead ends: 364 [2021-10-29 04:43:57,801 INFO L226 Difference]: Without dead ends: 364 [2021-10-29 04:43:57,802 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:43:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-29 04:43:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-10-29 04:43:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 199 states have (on average 1.8341708542713568) internal successors, (365), 342 states have internal predecessors, (365), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:43:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2021-10-29 04:43:57,812 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 23 [2021-10-29 04:43:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:57,813 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2021-10-29 04:43:57,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2021-10-29 04:43:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:43:57,814 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:57,814 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:57,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:43:57,814 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash 634114193, now seen corresponding path program 1 times [2021-10-29 04:43:57,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:57,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62609970] [2021-10-29 04:43:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:57,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:43:57,880 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:57,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62609970] [2021-10-29 04:43:57,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62609970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:57,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:57,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:43:57,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862967147] [2021-10-29 04:43:57,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:57,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:57,883 INFO L87 Difference]: Start difference. First operand 364 states and 400 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:58,085 INFO L93 Difference]: Finished difference Result 363 states and 399 transitions. [2021-10-29 04:43:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:43:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:43:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:58,088 INFO L225 Difference]: With dead ends: 363 [2021-10-29 04:43:58,088 INFO L226 Difference]: Without dead ends: 363 [2021-10-29 04:43:58,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-10-29 04:43:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2021-10-29 04:43:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 199 states have (on average 1.829145728643216) internal successors, (364), 341 states have internal predecessors, (364), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:43:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 399 transitions. [2021-10-29 04:43:58,100 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 399 transitions. Word has length 24 [2021-10-29 04:43:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:58,101 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 399 transitions. [2021-10-29 04:43:58,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 399 transitions. [2021-10-29 04:43:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:43:58,102 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:58,102 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:58,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 04:43:58,103 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash 634114194, now seen corresponding path program 1 times [2021-10-29 04:43:58,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:58,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747216242] [2021-10-29 04:43:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:58,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:43:58,161 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:58,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747216242] [2021-10-29 04:43:58,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747216242] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:58,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:58,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:43:58,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711475571] [2021-10-29 04:43:58,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:58,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:58,163 INFO L87 Difference]: Start difference. First operand 363 states and 399 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:58,337 INFO L93 Difference]: Finished difference Result 362 states and 398 transitions. [2021-10-29 04:43:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:43:58,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:43:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:58,340 INFO L225 Difference]: With dead ends: 362 [2021-10-29 04:43:58,340 INFO L226 Difference]: Without dead ends: 362 [2021-10-29 04:43:58,341 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-10-29 04:43:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-10-29 04:43:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 340 states have internal predecessors, (363), 15 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:43:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 398 transitions. [2021-10-29 04:43:58,351 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 398 transitions. Word has length 24 [2021-10-29 04:43:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:58,352 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 398 transitions. [2021-10-29 04:43:58,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 398 transitions. [2021-10-29 04:43:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 04:43:58,353 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:58,353 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:58,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 04:43:58,354 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash -501616430, now seen corresponding path program 1 times [2021-10-29 04:43:58,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:58,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982447379] [2021-10-29 04:43:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:58,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-29 04:43:58,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:58,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982447379] [2021-10-29 04:43:58,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982447379] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:58,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:58,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 04:43:58,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431497445] [2021-10-29 04:43:58,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:43:58,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:43:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:43:58,504 INFO L87 Difference]: Start difference. First operand 362 states and 398 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:58,993 INFO L93 Difference]: Finished difference Result 371 states and 408 transitions. [2021-10-29 04:43:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 04:43:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 04:43:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:58,996 INFO L225 Difference]: With dead ends: 371 [2021-10-29 04:43:58,996 INFO L226 Difference]: Without dead ends: 371 [2021-10-29 04:43:58,997 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-29 04:43:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-29 04:43:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2021-10-29 04:43:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 206 states have (on average 1.796116504854369) internal successors, (370), 348 states have internal predecessors, (370), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (22), 11 states have call predecessors, (22), 15 states have call successors, (22) [2021-10-29 04:43:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 407 transitions. [2021-10-29 04:43:59,008 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 407 transitions. Word has length 26 [2021-10-29 04:43:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:59,009 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 407 transitions. [2021-10-29 04:43:59,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:43:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 407 transitions. [2021-10-29 04:43:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:43:59,010 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:59,010 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:43:59,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 04:43:59,011 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:43:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 510736344, now seen corresponding path program 1 times [2021-10-29 04:43:59,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:59,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415930001] [2021-10-29 04:43:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:59,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:43:59,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:59,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415930001] [2021-10-29 04:43:59,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415930001] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:43:59,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414890433] [2021-10-29 04:43:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:59,298 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:43:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:43:59,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:43:59,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 04:43:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:59,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 47 conjunts are in the unsatisfiable core [2021-10-29 04:43:59,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:43:59,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 19 [2021-10-29 04:44:00,226 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-10-29 04:44:00,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2021-10-29 04:44:00,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 04:44:00,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-10-29 04:44:00,451 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-29 04:44:00,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 43 [2021-10-29 04:44:00,617 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-29 04:44:00,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 38 [2021-10-29 04:44:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:44:00,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:06,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2021-10-29 04:44:06,554 INFO L354 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2021-10-29 04:44:06,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 154 [2021-10-29 04:44:07,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2021-10-29 04:44:10,998 INFO L354 Elim1Store]: treesize reduction 5, result has 99.1 percent of original size [2021-10-29 04:44:10,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 360 treesize of output 847 [2021-10-29 04:45:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:45:12,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414890433] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 04:45:12,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596992468] [2021-10-29 04:45:12,550 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-29 04:45:12,551 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 04:45:12,558 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 04:45:12,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 04:45:12,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2021-10-29 04:45:12,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241026756] [2021-10-29 04:45:12,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-10-29 04:45:12,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:45:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-10-29 04:45:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1416, Unknown=4, NotChecked=0, Total=1560 [2021-10-29 04:45:12,574 INFO L87 Difference]: Start difference. First operand 370 states and 407 transitions. Second operand has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-29 04:45:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:45:17,559 INFO L93 Difference]: Finished difference Result 372 states and 408 transitions. [2021-10-29 04:45:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-29 04:45:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-10-29 04:45:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:45:17,564 INFO L225 Difference]: With dead ends: 372 [2021-10-29 04:45:17,564 INFO L226 Difference]: Without dead ends: 372 [2021-10-29 04:45:17,565 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=415, Invalid=2232, Unknown=5, NotChecked=0, Total=2652 [2021-10-29 04:45:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-29 04:45:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2021-10-29 04:45:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 206 states have (on average 1.7912621359223302) internal successors, (369), 347 states have internal predecessors, (369), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:45:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2021-10-29 04:45:17,580 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 37 [2021-10-29 04:45:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:45:17,581 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2021-10-29 04:45:17,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-29 04:45:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2021-10-29 04:45:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:45:17,583 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:45:17,583 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:45:17,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-29 04:45:17,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:45:17,801 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:45:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:45:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash 510736345, now seen corresponding path program 1 times [2021-10-29 04:45:17,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:45:17,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450256705] [2021-10-29 04:45:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:17,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:45:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:45:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:45:18,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:45:18,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450256705] [2021-10-29 04:45:18,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450256705] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:45:18,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362023193] [2021-10-29 04:45:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:18,246 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:45:18,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:45:18,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:45:18,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 04:45:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:45:18,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 67 conjunts are in the unsatisfiable core [2021-10-29 04:45:18,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:45:18,732 INFO L388 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 [2021-10-29 04:45:18,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 35 [2021-10-29 04:45:18,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 32 [2021-10-29 04:45:19,360 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-10-29 04:45:19,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2021-10-29 04:45:19,371 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-10-29 04:45:19,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-10-29 04:45:19,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 04:45:19,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2021-10-29 04:45:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-29 04:45:19,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2021-10-29 04:45:19,645 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-29 04:45:19,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 68 [2021-10-29 04:45:19,662 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-29 04:45:19,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 61 [2021-10-29 04:45:19,855 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-29 04:45:19,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2021-10-29 04:45:19,867 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-10-29 04:45:19,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 41 [2021-10-29 04:45:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:45:19,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:45:21,888 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int)) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|)))) (forall ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base| (store (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.base|) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0.offset| 0)) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll.offset|))))) is different from false [2021-10-29 04:45:31,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 266 [2021-10-29 04:45:31,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 469 [2021-10-29 04:45:31,306 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 04:45:31,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 615 treesize of output 599 [2021-10-29 04:45:31,357 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-29 04:45:31,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 466 [2021-10-29 04:45:33,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 267 [2021-10-29 04:45:33,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 506 [2021-10-29 04:45:35,456 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-29 04:45:35,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 165 [2021-10-29 04:45:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2021-10-29 04:45:36,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362023193] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 04:45:36,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1874456495] [2021-10-29 04:45:36,855 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-29 04:45:36,855 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 04:45:36,855 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 04:45:36,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 04:45:36,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 40 [2021-10-29 04:45:36,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930783233] [2021-10-29 04:45:36,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-29 04:45:36,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:45:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-29 04:45:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1423, Unknown=5, NotChecked=76, Total=1640 [2021-10-29 04:45:36,870 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-29 04:45:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:45:43,684 INFO L93 Difference]: Finished difference Result 368 states and 403 transitions. [2021-10-29 04:45:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-29 04:45:43,684 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-10-29 04:45:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:45:43,686 INFO L225 Difference]: With dead ends: 368 [2021-10-29 04:45:43,687 INFO L226 Difference]: Without dead ends: 368 [2021-10-29 04:45:43,688 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=458, Invalid=2403, Unknown=5, NotChecked=104, Total=2970 [2021-10-29 04:45:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-29 04:45:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-10-29 04:45:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 206 states have (on average 1.7864077669902914) internal successors, (368), 346 states have internal predecessors, (368), 15 states have call successors, (15), 10 states have call predecessors, (15), 8 states have return successors, (20), 11 states have call predecessors, (20), 15 states have call successors, (20) [2021-10-29 04:45:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 403 transitions. [2021-10-29 04:45:43,699 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 403 transitions. Word has length 37 [2021-10-29 04:45:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:45:43,699 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 403 transitions. [2021-10-29 04:45:43,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-29 04:45:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 403 transitions. [2021-10-29 04:45:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:45:43,701 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:45:43,701 INFO L513 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] [2021-10-29 04:45:43,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-29 04:45:43,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-29 04:45:43,921 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:45:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:45:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1249289076, now seen corresponding path program 1 times [2021-10-29 04:45:43,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:45:43,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82403734] [2021-10-29 04:45:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:43,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:45:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:45:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:45:44,019 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:45:44,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82403734] [2021-10-29 04:45:44,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82403734] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:45:44,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:45:44,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:45:44,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638446697] [2021-10-29 04:45:44,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:45:44,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:45:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:45:44,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:45:44,023 INFO L87 Difference]: Start difference. First operand 368 states and 403 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-29 04:45:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:45:44,066 INFO L93 Difference]: Finished difference Result 357 states and 380 transitions. [2021-10-29 04:45:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:45:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-10-29 04:45:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:45:44,069 INFO L225 Difference]: With dead ends: 357 [2021-10-29 04:45:44,069 INFO L226 Difference]: Without dead ends: 357 [2021-10-29 04:45:44,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:45:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-29 04:45:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-29 04:45:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 198 states have (on average 1.792929292929293) internal successors, (355), 338 states have internal predecessors, (355), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-10-29 04:45:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 380 transitions. [2021-10-29 04:45:44,081 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 380 transitions. Word has length 40 [2021-10-29 04:45:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:45:44,081 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 380 transitions. [2021-10-29 04:45:44,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-29 04:45:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 380 transitions. [2021-10-29 04:45:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-29 04:45:44,083 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:45:44,084 INFO L513 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] [2021-10-29 04:45:44,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 04:45:44,084 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:45:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:45:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash 715579460, now seen corresponding path program 1 times [2021-10-29 04:45:44,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:45:44,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545515010] [2021-10-29 04:45:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:44,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:45:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:45:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:45:44,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:45:44,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545515010] [2021-10-29 04:45:44,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545515010] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:45:44,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684105343] [2021-10-29 04:45:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:44,455 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:45:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:45:44,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:45:44,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 04:45:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:45:44,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 59 conjunts are in the unsatisfiable core [2021-10-29 04:45:44,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:45:44,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2021-10-29 04:46:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:46:00,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:47:19,352 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-29 04:47:19,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2021-10-29 04:47:23,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2021-10-29 04:47:23,615 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-10-29 04:47:23,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-10-29 04:47:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:47:23,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684105343] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 04:47:23,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145169949] [2021-10-29 04:47:23,694 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2021-10-29 04:47:23,694 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 04:47:23,696 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 04:47:23,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 04:47:23,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 34 [2021-10-29 04:47:23,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186268982] [2021-10-29 04:47:23,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-10-29 04:47:23,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:47:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-29 04:47:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=963, Unknown=42, NotChecked=0, Total=1122 [2021-10-29 04:47:23,702 INFO L87 Difference]: Start difference. First operand 357 states and 380 transitions. Second operand has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-10-29 04:48:06,927 WARN L207 SmtUtils]: Spent 8.03 s on a formula simplification that was a NOOP. DAG size: 48 [2021-10-29 04:48:59,406 WARN L207 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-10-29 04:49:07,481 WARN L207 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-10-29 04:49:39,220 WARN L207 SmtUtils]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 51 [2021-10-29 04:49:57,395 WARN L207 SmtUtils]: Spent 10.06 s on a formula simplification that was a NOOP. DAG size: 55 [2021-10-29 04:50:21,222 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-10-29 04:50:45,398 WARN L207 SmtUtils]: Spent 16.09 s on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-10-29 04:50:51,482 WARN L207 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-10-29 04:51:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:17,191 INFO L93 Difference]: Finished difference Result 360 states and 382 transitions. [2021-10-29 04:51:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-29 04:51:17,191 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2021-10-29 04:51:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:17,194 INFO L225 Difference]: With dead ends: 360 [2021-10-29 04:51:17,194 INFO L226 Difference]: Without dead ends: 357 [2021-10-29 04:51:17,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 242.7s TimeCoverageRelationStatistics Valid=417, Invalid=2369, Unknown=76, NotChecked=0, Total=2862 [2021-10-29 04:51:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-29 04:51:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-29 04:51:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 198 states have (on average 1.7878787878787878) internal successors, (354), 338 states have internal predecessors, (354), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-10-29 04:51:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 379 transitions. [2021-10-29 04:51:17,205 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 379 transitions. Word has length 46 [2021-10-29 04:51:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:17,205 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 379 transitions. [2021-10-29 04:51:17,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 states have internal predecessors, (55), 5 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-10-29 04:51:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 379 transitions. [2021-10-29 04:51:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-29 04:51:17,207 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:17,207 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:51:17,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 04:51:17,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:17,427 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATION === [##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION, ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION (and 156 more)] === [2021-10-29 04:51:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -633747766, now seen corresponding path program 1 times [2021-10-29 04:51:17,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:17,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108473373] [2021-10-29 04:51:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:17,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:18,712 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:18,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108473373] [2021-10-29 04:51:18,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108473373] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:51:18,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93148287] [2021-10-29 04:51:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:18,713 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:18,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:51:18,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:51:18,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 04:51:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:19,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 30 conjunts are in the unsatisfiable core [2021-10-29 04:51:19,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:51:19,144 INFO L388 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 [2021-10-29 04:51:19,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-10-29 04:51:19,460 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-29 04:51:19,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-10-29 04:51:20,001 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-10-29 04:51:20,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 47 [2021-10-29 04:51:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:51:20,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:51:44,452 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-29 04:51:44,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 293 treesize of output 401 [2021-10-29 04:52:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:52:25,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93148287] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 04:52:25,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [743574227] [2021-10-29 04:52:25,186 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2021-10-29 04:52:25,186 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 04:52:25,186 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 04:52:25,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 04:52:25,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 12] total 41 [2021-10-29 04:52:25,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244726710] [2021-10-29 04:52:25,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-10-29 04:52:25,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:52:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-10-29 04:52:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1425, Unknown=29, NotChecked=0, Total=1640 [2021-10-29 04:52:25,191 INFO L87 Difference]: Start difference. First operand 357 states and 379 transitions. Second operand has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-10-29 04:52:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:52:36,338 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2021-10-29 04:52:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 04:52:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 47 [2021-10-29 04:52:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:52:36,339 INFO L225 Difference]: With dead ends: 20 [2021-10-29 04:52:36,339 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 04:52:36,340 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 73.2s TimeCoverageRelationStatistics Valid=302, Invalid=2118, Unknown=30, NotChecked=0, Total=2450 [2021-10-29 04:52:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 04:52:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 04:52:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:52:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 04:52:36,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-10-29 04:52:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:52:36,341 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 04:52:36,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 11 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-10-29 04:52:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 04:52:36,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 04:52:36,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATION [2021-10-29 04:52:36,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATION [2021-10-29 04:52:36,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr2REQUIRES_VIOLATION [2021-10-29 04:52:36,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr3REQUIRES_VIOLATION [2021-10-29 04:52:36,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATION [2021-10-29 04:52:36,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATION [2021-10-29 04:52:36,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATION [2021-10-29 04:52:36,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATION [2021-10-29 04:52:36,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATION [2021-10-29 04:52:36,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATION [2021-10-29 04:52:36,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr10REQUIRES_VIOLATION [2021-10-29 04:52:36,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~VOIDErr11REQUIRES_VIOLATION [2021-10-29 04:52:36,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr0REQUIRES_VIOLATION [2021-10-29 04:52:36,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr1REQUIRES_VIOLATION [2021-10-29 04:52:36,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr2REQUIRES_VIOLATION [2021-10-29 04:52:36,348 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr3REQUIRES_VIOLATION [2021-10-29 04:52:36,348 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr4REQUIRES_VIOLATION [2021-10-29 04:52:36,348 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr5REQUIRES_VIOLATION [2021-10-29 04:52:36,348 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr6REQUIRES_VIOLATION [2021-10-29 04:52:36,348 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr7REQUIRES_VIOLATION [2021-10-29 04:52:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr8REQUIRES_VIOLATION [2021-10-29 04:52:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr9REQUIRES_VIOLATION [2021-10-29 04:52:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr10REQUIRES_VIOLATION [2021-10-29 04:52:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr11REQUIRES_VIOLATION [2021-10-29 04:52:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr12REQUIRES_VIOLATION [2021-10-29 04:52:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr13REQUIRES_VIOLATION [2021-10-29 04:52:36,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr14REQUIRES_VIOLATION [2021-10-29 04:52:36,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_insert_masterErr15REQUIRES_VIOLATION [2021-10-29 04:52:36,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_create_genericErr0REQUIRES_VIOLATION [2021-10-29 04:52:36,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location dll_create_genericErr1REQUIRES_VIOLATION [2021-10-29 04:52:36,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,351 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 04:52:36,351 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 04:52:36,351 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,351 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 04:52:36,351 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 04:52:36,352 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,352 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 04:52:36,352 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 04:52:36,352 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 04:52:36,352 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-29 04:52:36,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 04:52:36,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 04:52:36,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 04:52:36,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 04:52:36,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 04:52:36,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 04:52:36,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-29 04:52:36,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 04:52:36,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 04:52:36,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 04:52:36,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-29 04:52:36,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 04:52:36,355 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 04:52:36,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 04:52:36,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-29 04:52:36,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-29 04:52:36,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-29 04:52:36,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-29 04:52:36,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-29 04:52:36,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-29 04:52:36,357 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-29 04:52:36,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-29 04:52:36,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-29 04:52:36,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-29 04:52:36,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-29 04:52:36,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-29 04:52:36,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-29 04:52:36,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-29 04:52:36,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-29 04:52:36,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-29 04:52:36,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-29 04:52:36,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-29 04:52:36,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-29 04:52:36,360 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-29 04:52:36,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-29 04:52:36,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-29 04:52:36,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:52:36,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:52:36,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:52:36,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-29 04:52:36,362 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-29 04:52:36,362 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,362 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-29 04:52:36,362 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-29 04:52:36,362 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-29 04:52:36,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-29 04:52:36,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-29 04:52:36,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-29 04:52:36,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-29 04:52:36,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-29 04:52:36,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-29 04:52:36,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-29 04:52:36,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-29 04:52:36,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-29 04:52:36,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-29 04:52:36,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-29 04:52:36,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-29 04:52:36,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-29 04:52:36,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-29 04:52:36,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-29 04:52:36,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-29 04:52:36,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-29 04:52:36,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-29 04:52:36,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-29 04:52:36,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-29 04:52:36,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-29 04:52:36,368 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-29 04:52:36,368 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-29 04:52:36,368 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,368 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-29 04:52:36,368 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATION [2021-10-29 04:52:36,369 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-29 04:52:36,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:52:36,371 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:52:36,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:52:36,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:52:36,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-29 04:52:36,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:52:36,575 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:52:36,578 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:52:36,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:52:36 BoogieIcfgContainer [2021-10-29 04:52:36,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:52:36,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:52:36,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:52:36,583 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:52:36,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:51" (3/4) ... [2021-10-29 04:52:36,586 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 04:52:36,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create_slave [2021-10-29 04:52:36,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2021-10-29 04:52:36,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_insert_master [2021-10-29 04:52:36,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create_generic [2021-10-29 04:52:36,613 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-10-29 04:52:36,613 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-29 04:52:36,614 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-29 04:52:36,614 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 04:52:36,660 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 04:52:36,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:52:36,661 INFO L168 Benchmark]: Toolchain (without parser) took 527311.73 ms. Allocated memory was 127.9 MB in the beginning and 423.6 MB in the end (delta: 295.7 MB). Free memory was 102.6 MB in the beginning and 231.0 MB in the end (delta: -128.5 MB). Peak memory consumption was 167.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,662 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 92.3 MB. Free memory was 50.8 MB in the beginning and 50.8 MB in the end (delta: 80.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.55 ms. Allocated memory is still 127.9 MB. Free memory was 102.6 MB in the beginning and 94.1 MB in the end (delta: 8.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.79 ms. Allocated memory is still 127.9 MB. Free memory was 94.1 MB in the beginning and 90.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,663 INFO L168 Benchmark]: Boogie Preprocessor took 60.49 ms. Allocated memory is still 127.9 MB. Free memory was 90.7 MB in the beginning and 87.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,663 INFO L168 Benchmark]: RCFGBuilder took 1382.74 ms. Allocated memory is still 127.9 MB. Free memory was 87.0 MB in the beginning and 72.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 39.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,663 INFO L168 Benchmark]: TraceAbstraction took 525105.86 ms. Allocated memory was 127.9 MB in the beginning and 423.6 MB in the end (delta: 295.7 MB). Free memory was 71.8 MB in the beginning and 235.7 MB in the end (delta: -163.8 MB). Peak memory consumption was 132.5 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,664 INFO L168 Benchmark]: Witness Printer took 77.75 ms. Allocated memory is still 423.6 MB. Free memory was 235.7 MB in the beginning and 231.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:36,667 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 92.3 MB. Free memory was 50.8 MB in the beginning and 50.8 MB in the end (delta: 80.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 574.55 ms. Allocated memory is still 127.9 MB. Free memory was 102.6 MB in the beginning and 94.1 MB in the end (delta: 8.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 104.79 ms. Allocated memory is still 127.9 MB. Free memory was 94.1 MB in the beginning and 90.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.49 ms. Allocated memory is still 127.9 MB. Free memory was 90.7 MB in the beginning and 87.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1382.74 ms. Allocated memory is still 127.9 MB. Free memory was 87.0 MB in the beginning and 72.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 39.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 525105.86 ms. Allocated memory was 127.9 MB in the beginning and 423.6 MB in the end (delta: 295.7 MB). Free memory was 71.8 MB in the beginning and 235.7 MB in the end (delta: -163.8 MB). Peak memory consumption was 132.5 MB. Max. memory is 16.1 GB. * Witness Printer took 77.75 ms. Allocated memory is still 423.6 MB. Free memory was 235.7 MB in the beginning and 231.0 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 574]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 636]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 665]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 662]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 657]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 657]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 673]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 673]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 672]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 672]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 679]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 679]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 678]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 678]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 625]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 681]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 342 locations, 159 error locations. Started 1 CEGAR loops. OverallTime: 525.0s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 261.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6384 SDtfs, 807 SDslu, 27498 SDs, 0 SdLazy, 13404 SolverSat, 390 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 99.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 277 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 338.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=15, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 45 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 259.6s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 739 ConstructedInterpolants, 108 QuantifiedInterpolants, 11130 SizeOfPredicates, 98 NumberOfNonLiveVariables, 1546 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 125/210 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 159 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-29 04:52:36,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a21ea5c-0e4a-408c-b3e1-f053e1a32da8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...