./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 20:16:51,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:16:51,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:16:51,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:16:51,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:16:51,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:16:51,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:16:51,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:16:51,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:16:51,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:16:51,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:16:51,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:16:51,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:16:51,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:16:51,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:16:51,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:16:51,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:16:51,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:16:51,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:16:51,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:16:51,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:16:51,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:16:51,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:16:51,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:16:51,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:16:51,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:16:51,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:16:51,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:16:51,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:16:51,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:16:51,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:16:51,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:16:51,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:16:51,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:16:51,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:16:51,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:16:51,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:16:51,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:16:51,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:16:51,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:16:51,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:16:51,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-16 20:16:51,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:16:51,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:16:51,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:16:51,429 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:16:51,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:16:51,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:16:51,430 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:16:51,430 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:16:51,430 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:16:51,431 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:16:51,431 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:16:51,431 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:16:51,431 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:16:51,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:16:51,432 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:16:51,432 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:16:51,432 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:16:51,432 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:16:51,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 20:16:51,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 20:16:51,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:16:51,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:16:51,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 20:16:51,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:16:51,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:16:51,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:16:51,434 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 20:16:51,434 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 20:16:51,435 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 20:16:51,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:16:51,435 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 20:16:51,435 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:16:51,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:16:51,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:16:51,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:16:51,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:16:51,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:16:51,436 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:16:51,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:16:51,437 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:16:51,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:16:51,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:16:51,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/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_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2022-11-16 20:16:51,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:16:51,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:16:51,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:16:51,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:16:51,754 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:16:51,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2022-11-16 20:16:51,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/data/8a7028b68/e3e0b3e1890d49ed9e55e029684345bd/FLAGc905aaec4 [2022-11-16 20:16:52,367 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:16:52,367 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2022-11-16 20:16:52,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/data/8a7028b68/e3e0b3e1890d49ed9e55e029684345bd/FLAGc905aaec4 [2022-11-16 20:16:52,640 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/data/8a7028b68/e3e0b3e1890d49ed9e55e029684345bd [2022-11-16 20:16:52,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:16:52,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:16:52,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:16:52,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:16:52,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:16:52,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:16:52" (1/1) ... [2022-11-16 20:16:52,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19143307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:52, skipping insertion in model container [2022-11-16 20:16:52,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:16:52" (1/1) ... [2022-11-16 20:16:52,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:16:52,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:16:52,993 WARN L229 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_e4b5bec5-dea8-4461-a215-a4c33cf72a20/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2022-11-16 20:16:53,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:16:53,077 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:16:53,127 WARN L229 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_e4b5bec5-dea8-4461-a215-a4c33cf72a20/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2022-11-16 20:16:53,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:16:53,185 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:16:53,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53 WrapperNode [2022-11-16 20:16:53,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:16:53,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:16:53,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:16:53,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:16:53,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,241 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-11-16 20:16:53,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:16:53,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:16:53,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:16:53,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:16:53,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,280 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:16:53,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:16:53,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:16:53,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:16:53,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (1/1) ... [2022-11-16 20:16:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:16:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:16:53,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:16:53,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:16:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-16 20:16:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-16 20:16:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2022-11-16 20:16:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2022-11-16 20:16:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 20:16:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:16:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2022-11-16 20:16:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2022-11-16 20:16:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:16:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 20:16:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 20:16:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 20:16:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 20:16:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:16:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 20:16:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2022-11-16 20:16:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2022-11-16 20:16:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2022-11-16 20:16:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2022-11-16 20:16:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:16:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:16:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:16:53,523 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:16:53,525 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:16:54,372 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:16:54,522 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:16:54,522 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2022-11-16 20:16:54,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:16:54 BoogieIcfgContainer [2022-11-16 20:16:54,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:16:54,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:16:54,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:16:54,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:16:54,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:16:52" (1/3) ... [2022-11-16 20:16:54,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcf643b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:16:54, skipping insertion in model container [2022-11-16 20:16:54,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:53" (2/3) ... [2022-11-16 20:16:54,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcf643b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:16:54, skipping insertion in model container [2022-11-16 20:16:54,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:16:54" (3/3) ... [2022-11-16 20:16:54,545 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2022-11-16 20:16:54,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:16:54,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2022-11-16 20:16:54,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:16:54,654 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e4ed33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:16:54,655 INFO L358 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2022-11-16 20:16:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 103 states have (on average 2.495145631067961) internal successors, (257), 220 states have internal predecessors, (257), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-16 20:16:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 20:16:54,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:54,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:54,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~$Pointer$~TO~VOIDErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash 691826204, now seen corresponding path program 1 times [2022-11-16 20:16:54,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:54,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793949626] [2022-11-16 20:16:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:54,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793949626] [2022-11-16 20:16:54,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793949626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:54,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:54,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:16:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385958187] [2022-11-16 20:16:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:54,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:55,023 INFO L87 Difference]: Start difference. First operand has 232 states, 103 states have (on average 2.495145631067961) internal successors, (257), 220 states have internal predecessors, (257), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) 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) [2022-11-16 20:16:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:55,321 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2022-11-16 20:16:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:55,324 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 [2022-11-16 20:16:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:55,333 INFO L225 Difference]: With dead ends: 231 [2022-11-16 20:16:55,333 INFO L226 Difference]: Without dead ends: 230 [2022-11-16 20:16:55,335 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:55,338 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:55,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 355 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:16:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-16 20:16:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-11-16 20:16:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 103 states have (on average 2.174757281553398) internal successors, (224), 216 states have internal predecessors, (224), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 20:16:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2022-11-16 20:16:55,417 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 7 [2022-11-16 20:16:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:55,418 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2022-11-16 20:16:55,418 INFO L496 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) [2022-11-16 20:16:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2022-11-16 20:16:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 20:16:55,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:55,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:16:55,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~$Pointer$~TO~VOIDErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 691826205, now seen corresponding path program 1 times [2022-11-16 20:16:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:55,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909409694] [2022-11-16 20:16:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:55,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:55,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909409694] [2022-11-16 20:16:55,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909409694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:55,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:55,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:16:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654030946] [2022-11-16 20:16:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:55,571 INFO L87 Difference]: Start difference. First operand 228 states and 258 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) [2022-11-16 20:16:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:55,764 INFO L93 Difference]: Finished difference Result 228 states and 260 transitions. [2022-11-16 20:16:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:55,765 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 [2022-11-16 20:16:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:55,767 INFO L225 Difference]: With dead ends: 228 [2022-11-16 20:16:55,767 INFO L226 Difference]: Without dead ends: 228 [2022-11-16 20:16:55,767 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:55,768 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:55,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 360 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:16:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-16 20:16:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-11-16 20:16:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 103 states have (on average 2.1553398058252426) internal successors, (222), 214 states have internal predecessors, (222), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 20:16:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2022-11-16 20:16:55,781 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 7 [2022-11-16 20:16:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:55,781 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2022-11-16 20:16:55,781 INFO L496 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) [2022-11-16 20:16:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2022-11-16 20:16:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 20:16:55,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:55,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:55,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:16:55,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -892161265, now seen corresponding path program 1 times [2022-11-16 20:16:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650698962] [2022-11-16 20:16:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:55,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:55,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650698962] [2022-11-16 20:16:55,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650698962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:55,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:55,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:16:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297217113] [2022-11-16 20:16:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:55,850 INFO L87 Difference]: Start difference. First operand 226 states and 256 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) [2022-11-16 20:16:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:56,025 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-11-16 20:16:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:56,026 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 [2022-11-16 20:16:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:56,027 INFO L225 Difference]: With dead ends: 223 [2022-11-16 20:16:56,027 INFO L226 Difference]: Without dead ends: 223 [2022-11-16 20:16:56,028 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:56,029 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 346 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:16:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-16 20:16:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-11-16 20:16:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 103 states have (on average 2.1262135922330097) internal successors, (219), 211 states have internal predecessors, (219), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 20:16:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-11-16 20:16:56,038 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 9 [2022-11-16 20:16:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:56,039 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-11-16 20:16:56,039 INFO L496 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) [2022-11-16 20:16:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-11-16 20:16:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 20:16:56,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:56,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:56,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:16:56,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -892161264, now seen corresponding path program 1 times [2022-11-16 20:16:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:56,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426820764] [2022-11-16 20:16:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:56,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426820764] [2022-11-16 20:16:56,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426820764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:56,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:56,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:16:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577894629] [2022-11-16 20:16:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:56,120 INFO L87 Difference]: Start difference. First operand 223 states and 253 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) [2022-11-16 20:16:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:56,287 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-11-16 20:16:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:56,288 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 [2022-11-16 20:16:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:56,289 INFO L225 Difference]: With dead ends: 220 [2022-11-16 20:16:56,289 INFO L226 Difference]: Without dead ends: 220 [2022-11-16 20:16:56,290 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:56,291 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:56,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 351 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:16:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-16 20:16:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-16 20:16:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 103 states have (on average 2.0970873786407767) internal successors, (216), 208 states have internal predecessors, (216), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 20:16:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2022-11-16 20:16:56,298 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 9 [2022-11-16 20:16:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:56,299 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2022-11-16 20:16:56,299 INFO L496 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) [2022-11-16 20:16:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2022-11-16 20:16:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 20:16:56,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:56,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:56,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:16:56,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -874929520, now seen corresponding path program 1 times [2022-11-16 20:16:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:56,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711639112] [2022-11-16 20:16:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:56,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:56,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711639112] [2022-11-16 20:16:56,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711639112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:56,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:56,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:16:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291978013] [2022-11-16 20:16:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:56,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:16:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:56,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:16:56,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:16:56,540 INFO L87 Difference]: Start difference. First operand 220 states and 250 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) [2022-11-16 20:16:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:56,755 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2022-11-16 20:16:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:16:56,755 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 [2022-11-16 20:16:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:56,757 INFO L225 Difference]: With dead ends: 242 [2022-11-16 20:16:56,757 INFO L226 Difference]: Without dead ends: 242 [2022-11-16 20:16:56,758 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:56,761 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:56,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 867 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:16:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-16 20:16:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2022-11-16 20:16:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 112 states have (on average 2.044642857142857) internal successors, (229), 217 states have internal predecessors, (229), 29 states have call successors, (29), 8 states have call predecessors, (29), 7 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-16 20:16:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 276 transitions. [2022-11-16 20:16:56,774 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 276 transitions. Word has length 9 [2022-11-16 20:16:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:56,775 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 276 transitions. [2022-11-16 20:16:56,775 INFO L496 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) [2022-11-16 20:16:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 276 transitions. [2022-11-16 20:16:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:16:56,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:56,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:56,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:16:56,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615216, now seen corresponding path program 1 times [2022-11-16 20:16:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:56,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211242009] [2022-11-16 20:16:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:57,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:57,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211242009] [2022-11-16 20:16:57,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211242009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:57,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:57,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 20:16:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626655860] [2022-11-16 20:16:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:57,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 20:16:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 20:16:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:16:57,077 INFO L87 Difference]: Start difference. First operand 236 states and 276 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) [2022-11-16 20:16:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:57,521 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2022-11-16 20:16:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:16:57,522 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 [2022-11-16 20:16:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:57,524 INFO L225 Difference]: With dead ends: 255 [2022-11-16 20:16:57,524 INFO L226 Difference]: Without dead ends: 255 [2022-11-16 20:16:57,524 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:57,525 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 92 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:57,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 866 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:16:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-16 20:16:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2022-11-16 20:16:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 120 states have (on average 1.9916666666666667) internal successors, (239), 224 states have internal predecessors, (239), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-16 20:16:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 288 transitions. [2022-11-16 20:16:57,533 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 288 transitions. Word has length 12 [2022-11-16 20:16:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:57,533 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 288 transitions. [2022-11-16 20:16:57,533 INFO L496 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) [2022-11-16 20:16:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 288 transitions. [2022-11-16 20:16:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:16:57,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:57,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:57,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 20:16:57,538 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1118615215, now seen corresponding path program 1 times [2022-11-16 20:16:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:57,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261519985] [2022-11-16 20:16:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:57,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:57,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261519985] [2022-11-16 20:16:57,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261519985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:57,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:57,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 20:16:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772102208] [2022-11-16 20:16:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:57,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 20:16:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 20:16:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:16:57,864 INFO L87 Difference]: Start difference. First operand 245 states and 288 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) [2022-11-16 20:16:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:58,455 INFO L93 Difference]: Finished difference Result 253 states and 296 transitions. [2022-11-16 20:16:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:16:58,456 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 [2022-11-16 20:16:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:58,458 INFO L225 Difference]: With dead ends: 253 [2022-11-16 20:16:58,458 INFO L226 Difference]: Without dead ends: 253 [2022-11-16 20:16:58,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 20:16:58,459 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 60 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:58,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 732 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 20:16:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-16 20:16:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2022-11-16 20:16:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 120 states have (on average 1.975) internal successors, (237), 224 states have internal predecessors, (237), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-16 20:16:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-11-16 20:16:58,468 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 12 [2022-11-16 20:16:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:58,468 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-11-16 20:16:58,468 INFO L496 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) [2022-11-16 20:16:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-11-16 20:16:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:16:58,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:58,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:58,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 20:16:58,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting dll_insert_masterErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -317313492, now seen corresponding path program 1 times [2022-11-16 20:16:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:58,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353871103] [2022-11-16 20:16:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:58,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:58,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353871103] [2022-11-16 20:16:58,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353871103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:58,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:58,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:16:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675537677] [2022-11-16 20:16:58,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:58,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:16:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:16:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:16:58,527 INFO L87 Difference]: Start difference. First operand 245 states and 286 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) [2022-11-16 20:16:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:58,724 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2022-11-16 20:16:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:16:58,725 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 [2022-11-16 20:16:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:58,726 INFO L225 Difference]: With dead ends: 244 [2022-11-16 20:16:58,726 INFO L226 Difference]: Without dead ends: 244 [2022-11-16 20:16:58,726 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:58,727 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:58,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 478 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:16:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-16 20:16:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-11-16 20:16:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 120 states have (on average 1.9666666666666666) internal successors, (236), 223 states have internal predecessors, (236), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-16 20:16:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2022-11-16 20:16:58,739 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 13 [2022-11-16 20:16:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:58,739 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2022-11-16 20:16:58,741 INFO L496 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) [2022-11-16 20:16:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2022-11-16 20:16:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:16:58,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:58,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:58,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 20:16:58,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting dll_insert_masterErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash -317313491, now seen corresponding path program 1 times [2022-11-16 20:16:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:58,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899277262] [2022-11-16 20:16:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:58,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:58,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899277262] [2022-11-16 20:16:58,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899277262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:58,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:58,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:16:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337790424] [2022-11-16 20:16:58,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:58,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:16:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:16:58,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:16:58,865 INFO L87 Difference]: Start difference. First operand 244 states and 285 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) [2022-11-16 20:16:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:59,036 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2022-11-16 20:16:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:16:59,037 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 [2022-11-16 20:16:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:59,039 INFO L225 Difference]: With dead ends: 243 [2022-11-16 20:16:59,039 INFO L226 Difference]: Without dead ends: 243 [2022-11-16 20:16:59,039 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:16:59,043 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 24 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:59,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 547 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:16:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-16 20:16:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-16 20:16:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 120 states have (on average 1.9583333333333333) internal successors, (235), 222 states have internal predecessors, (235), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (19), 13 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-16 20:16:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2022-11-16 20:16:59,056 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 13 [2022-11-16 20:16:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:59,057 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2022-11-16 20:16:59,058 INFO L496 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) [2022-11-16 20:16:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2022-11-16 20:16:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 20:16:59,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:59,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:59,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 20:16:59,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:16:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 4412237, now seen corresponding path program 1 times [2022-11-16 20:16:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:59,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364482970] [2022-11-16 20:16:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:59,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:59,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364482970] [2022-11-16 20:16:59,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364482970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:59,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:59,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 20:16:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567843189] [2022-11-16 20:16:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:59,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 20:16:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 20:16:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 20:16:59,510 INFO L87 Difference]: Start difference. First operand 243 states and 284 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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) [2022-11-16 20:17:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:00,083 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-11-16 20:17:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 20:17:00,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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 [2022-11-16 20:17:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:00,087 INFO L225 Difference]: With dead ends: 270 [2022-11-16 20:17:00,087 INFO L226 Difference]: Without dead ends: 270 [2022-11-16 20:17:00,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-16 20:17:00,088 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 23 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:00,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1326 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 20:17:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-16 20:17:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-11-16 20:17:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 131 states have (on average 1.916030534351145) internal successors, (251), 233 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2022-11-16 20:17:00,097 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 15 [2022-11-16 20:17:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:00,097 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2022-11-16 20:17:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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) [2022-11-16 20:17:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2022-11-16 20:17:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 20:17:00,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:00,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:17:00,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 20:17:00,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~VOIDErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600924, now seen corresponding path program 1 times [2022-11-16 20:17:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:00,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723040743] [2022-11-16 20:17:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:17:00,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723040743] [2022-11-16 20:17:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723040743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:17:00,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:17:00,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:17:00,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614079714] [2022-11-16 20:17:00,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:17:00,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:17:00,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:17:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:17:00,419 INFO L87 Difference]: Start difference. First operand 257 states and 306 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) [2022-11-16 20:17:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:00,884 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2022-11-16 20:17:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:17:00,885 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 [2022-11-16 20:17:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:00,886 INFO L225 Difference]: With dead ends: 255 [2022-11-16 20:17:00,886 INFO L226 Difference]: Without dead ends: 255 [2022-11-16 20:17:00,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:17:00,887 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 49 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:00,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 637 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:17:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-16 20:17:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-16 20:17:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 131 states have (on average 1.900763358778626) internal successors, (249), 231 states have internal predecessors, (249), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2022-11-16 20:17:00,896 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 23 [2022-11-16 20:17:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:00,896 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2022-11-16 20:17:00,896 INFO L496 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) [2022-11-16 20:17:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2022-11-16 20:17:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 20:17:00,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:00,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:17:00,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 20:17:00,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~VOIDErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2063600923, now seen corresponding path program 1 times [2022-11-16 20:17:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:00,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295319989] [2022-11-16 20:17:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:17:01,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295319989] [2022-11-16 20:17:01,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295319989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:17:01,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:17:01,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 20:17:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836818198] [2022-11-16 20:17:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:17:01,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 20:17:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 20:17:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:17:01,083 INFO L87 Difference]: Start difference. First operand 255 states and 304 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) [2022-11-16 20:17:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:01,456 INFO L93 Difference]: Finished difference Result 253 states and 302 transitions. [2022-11-16 20:17:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:17:01,456 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 [2022-11-16 20:17:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:01,458 INFO L225 Difference]: With dead ends: 253 [2022-11-16 20:17:01,458 INFO L226 Difference]: Without dead ends: 253 [2022-11-16 20:17:01,458 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:17:01,458 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 45 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:01,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 874 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:17:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-16 20:17:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-11-16 20:17:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 131 states have (on average 1.8854961832061068) internal successors, (247), 229 states have internal predecessors, (247), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2022-11-16 20:17:01,466 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 23 [2022-11-16 20:17:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:01,470 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2022-11-16 20:17:01,470 INFO L496 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) [2022-11-16 20:17:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2022-11-16 20:17:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:17:01,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:01,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:17:01,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 20:17:01,473 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~VOIDErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash -452863182, now seen corresponding path program 1 times [2022-11-16 20:17:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:01,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851873958] [2022-11-16 20:17:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:17:01,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:01,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851873958] [2022-11-16 20:17:01,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851873958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:17:01,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:17:01,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:17:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598927385] [2022-11-16 20:17:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:17:01,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:17:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:17:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:17:01,577 INFO L87 Difference]: Start difference. First operand 253 states and 302 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) [2022-11-16 20:17:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:01,772 INFO L93 Difference]: Finished difference Result 252 states and 301 transitions. [2022-11-16 20:17:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:17:01,773 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 [2022-11-16 20:17:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:01,774 INFO L225 Difference]: With dead ends: 252 [2022-11-16 20:17:01,774 INFO L226 Difference]: Without dead ends: 252 [2022-11-16 20:17:01,775 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:17:01,775 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 20 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:01,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:17:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-16 20:17:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-16 20:17:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 131 states have (on average 1.8778625954198473) internal successors, (246), 228 states have internal predecessors, (246), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2022-11-16 20:17:01,783 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 24 [2022-11-16 20:17:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:01,784 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2022-11-16 20:17:01,784 INFO L496 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) [2022-11-16 20:17:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2022-11-16 20:17:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:17:01,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:01,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:17:01,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 20:17:01,785 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~VOIDErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -452863181, now seen corresponding path program 1 times [2022-11-16 20:17:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:01,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248573931] [2022-11-16 20:17:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:17:01,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:01,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248573931] [2022-11-16 20:17:01,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248573931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:17:01,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:17:01,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:17:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59181489] [2022-11-16 20:17:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:17:01,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:17:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:17:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:17:01,915 INFO L87 Difference]: Start difference. First operand 252 states and 301 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) [2022-11-16 20:17:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:02,083 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-11-16 20:17:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:17:02,083 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 [2022-11-16 20:17:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:02,085 INFO L225 Difference]: With dead ends: 251 [2022-11-16 20:17:02,085 INFO L226 Difference]: Without dead ends: 251 [2022-11-16 20:17:02,085 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:17:02,085 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 18 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:02,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 546 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:17:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-16 20:17:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-16 20:17:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 131 states have (on average 1.8702290076335877) internal successors, (245), 227 states have internal predecessors, (245), 32 states have call successors, (32), 12 states have call predecessors, (32), 8 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2022-11-16 20:17:02,093 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 24 [2022-11-16 20:17:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:02,094 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2022-11-16 20:17:02,094 INFO L496 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) [2022-11-16 20:17:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2022-11-16 20:17:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 20:17:02,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:02,095 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:17:02,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 20:17:02,095 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1409818669, now seen corresponding path program 1 times [2022-11-16 20:17:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:02,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25815044] [2022-11-16 20:17:02,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:17:02,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:02,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25815044] [2022-11-16 20:17:02,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25815044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:17:02,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:17:02,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 20:17:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157565943] [2022-11-16 20:17:02,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:17:02,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 20:17:02,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 20:17:02,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:17:02,491 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) [2022-11-16 20:17:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:02,921 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2022-11-16 20:17:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:17:02,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 [2022-11-16 20:17:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:02,923 INFO L225 Difference]: With dead ends: 260 [2022-11-16 20:17:02,923 INFO L226 Difference]: Without dead ends: 260 [2022-11-16 20:17:02,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-16 20:17:02,924 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:02,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1002 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:17:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-16 20:17:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2022-11-16 20:17:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 138 states have (on average 1.826086956521739) internal successors, (252), 235 states have internal predecessors, (252), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-16 20:17:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-11-16 20:17:02,933 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 26 [2022-11-16 20:17:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:02,933 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-11-16 20:17:02,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) [2022-11-16 20:17:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-11-16 20:17:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 20:17:02,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:02,934 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:17:02,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 20:17:02,935 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~VOIDErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -143384194, now seen corresponding path program 1 times [2022-11-16 20:17:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029859151] [2022-11-16 20:17:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:17:03,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:03,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029859151] [2022-11-16 20:17:03,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029859151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806923678] [2022-11-16 20:17:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:17:03,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:17:03,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:17:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:03,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-16 20:17:03,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:17:04,039 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:17:04,265 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 20:17:04,266 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 29 [2022-11-16 20:17:04,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:04,329 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:17:04,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:04,380 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:17:04,421 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-16 20:17:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:17:04,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:17:06,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:06,929 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 20:17:06,937 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 34 [2022-11-16 20:17:06,963 INFO L321 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-11-16 20:17:06,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 72 [2022-11-16 20:17:06,974 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 32 [2022-11-16 20:17:07,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:07,144 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 20:17:07,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:17:07,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:07,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 [2022-11-16 20:17:07,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:07,535 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 204 [2022-11-16 20:17:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:17:08,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806923678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:17:08,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [956907322] [2022-11-16 20:17:08,246 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-16 20:17:08,247 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:17:08,251 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:17:08,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:17:08,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-11-16 20:17:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561960910] [2022-11-16 20:17:08,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:17:08,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 20:17:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:08,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 20:17:08,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=826, Unknown=8, NotChecked=0, Total=930 [2022-11-16 20:17:08,256 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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) [2022-11-16 20:17:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:09,796 INFO L93 Difference]: Finished difference Result 265 states and 318 transitions. [2022-11-16 20:17:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 20:17:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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 [2022-11-16 20:17:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:09,798 INFO L225 Difference]: With dead ends: 265 [2022-11-16 20:17:09,798 INFO L226 Difference]: Without dead ends: 265 [2022-11-16 20:17:09,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=254, Invalid=1378, Unknown=8, NotChecked=0, Total=1640 [2022-11-16 20:17:09,799 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 80 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 3424 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 756 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:09,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 3424 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1194 Invalid, 0 Unknown, 756 Unchecked, 1.0s Time] [2022-11-16 20:17:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-16 20:17:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2022-11-16 20:17:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 138 states have (on average 1.818840579710145) internal successors, (251), 234 states have internal predecessors, (251), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-11-16 20:17:09,812 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 37 [2022-11-16 20:17:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:09,812 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-11-16 20:17:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 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) [2022-11-16 20:17:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-11-16 20:17:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 20:17:09,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:09,815 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:17:09,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:17:10,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 20:17:10,022 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~VOIDErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash -143384193, now seen corresponding path program 1 times [2022-11-16 20:17:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:10,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922927727] [2022-11-16 20:17:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:17:11,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922927727] [2022-11-16 20:17:11,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922927727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:11,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379472053] [2022-11-16 20:17:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:11,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:17:11,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:17:11,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:17:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:11,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 20:17:11,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:17:11,385 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:17:11,513 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:17:11,520 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:17:11,749 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 20:17:11,750 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 26 [2022-11-16 20:17:11,768 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 20:17:11,768 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-16 20:17:11,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:11,825 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-16 20:17:11,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:11,835 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:17:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:11,861 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:17:11,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:11,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:17:11,916 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-16 20:17:11,919 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-16 20:17:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:17:11,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:17:12,071 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_695) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_694) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|)))) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_695) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset|) 4)))) is different from false [2022-11-16 20:17:14,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:14,346 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-16 20:17:14,352 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 117 [2022-11-16 20:17:14,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:14,360 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 95 [2022-11-16 20:17:14,365 INFO L350 Elim1Store]: Elim1 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 148 treesize of output 132 [2022-11-16 20:17:14,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:14,412 INFO L350 Elim1Store]: Elim1 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 176 treesize of output 172 [2022-11-16 20:17:14,420 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 149 [2022-11-16 20:17:14,429 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 150 [2022-11-16 20:17:14,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:14,444 INFO L350 Elim1Store]: Elim1 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 141 treesize of output 146 [2022-11-16 20:17:14,452 INFO L350 Elim1Store]: Elim1 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 137 treesize of output 135 [2022-11-16 20:17:15,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:15,551 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-16 20:17:15,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:17:15,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:15,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 21 [2022-11-16 20:17:15,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:15,581 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-16 20:17:15,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:15,590 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-16 20:17:15,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:17:15,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:15,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 33 [2022-11-16 20:17:15,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:17:15,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:17:15,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 26 [2022-11-16 20:17:27,880 WARN L233 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:17:28,014 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 61 [2022-11-16 20:17:28,182 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-16 20:17:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-16 20:17:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379472053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:17:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249078040] [2022-11-16 20:17:28,241 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-16 20:17:28,241 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:17:28,241 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:17:28,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:17:28,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-11-16 20:17:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752603766] [2022-11-16 20:17:28,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:17:28,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 20:17:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:28,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 20:17:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=907, Unknown=3, NotChecked=60, Total=1056 [2022-11-16 20:17:28,248 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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) [2022-11-16 20:17:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:31,710 INFO L93 Difference]: Finished difference Result 269 states and 320 transitions. [2022-11-16 20:17:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 20:17:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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 [2022-11-16 20:17:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:31,713 INFO L225 Difference]: With dead ends: 269 [2022-11-16 20:17:31,713 INFO L226 Difference]: Without dead ends: 269 [2022-11-16 20:17:31,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=433, Invalid=2018, Unknown=3, NotChecked=96, Total=2550 [2022-11-16 20:17:31,714 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 137 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 909 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:31,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 3010 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1889 Invalid, 0 Unknown, 909 Unchecked, 1.5s Time] [2022-11-16 20:17:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-16 20:17:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2022-11-16 20:17:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 148 states have (on average 1.7702702702702702) internal successors, (262), 243 states have internal predecessors, (262), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) [2022-11-16 20:17:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 317 transitions. [2022-11-16 20:17:31,722 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 317 transitions. Word has length 37 [2022-11-16 20:17:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:31,723 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 317 transitions. [2022-11-16 20:17:31,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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) [2022-11-16 20:17:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 317 transitions. [2022-11-16 20:17:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 20:17:31,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:31,724 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:17:31,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:17:31,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 20:17:31,930 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -835158194, now seen corresponding path program 1 times [2022-11-16 20:17:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:31,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800808277] [2022-11-16 20:17:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:17:32,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:32,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800808277] [2022-11-16 20:17:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800808277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:17:32,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:17:32,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:17:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729120025] [2022-11-16 20:17:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:17:32,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:17:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:32,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:17:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:17:32,080 INFO L87 Difference]: Start difference. First operand 268 states and 317 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) [2022-11-16 20:17:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:32,233 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2022-11-16 20:17:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:17:32,233 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 [2022-11-16 20:17:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:32,235 INFO L225 Difference]: With dead ends: 257 [2022-11-16 20:17:32,235 INFO L226 Difference]: Without dead ends: 257 [2022-11-16 20:17:32,235 INFO L412 NwaCegarLoop]: 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 [2022-11-16 20:17:32,235 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:32,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 802 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:17:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-16 20:17:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-11-16 20:17:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.7714285714285714) internal successors, (248), 235 states have internal predecessors, (248), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-16 20:17:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 293 transitions. [2022-11-16 20:17:32,242 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 293 transitions. Word has length 40 [2022-11-16 20:17:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:32,242 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 293 transitions. [2022-11-16 20:17:32,242 INFO L496 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) [2022-11-16 20:17:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 293 transitions. [2022-11-16 20:17:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 20:17:32,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:32,244 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:17:32,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 20:17:32,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 54211896, now seen corresponding path program 1 times [2022-11-16 20:17:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:32,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969980662] [2022-11-16 20:17:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:17:33,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:33,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969980662] [2022-11-16 20:17:33,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969980662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:33,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3109878] [2022-11-16 20:17:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:33,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:33,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:17:33,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:17:33,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:17:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:33,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 20:17:33,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:17:33,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:17:33,554 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-16 20:17:33,872 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_952 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_952) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0))) is different from true [2022-11-16 20:17:33,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-16 20:17:33,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:17:34,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_55| Int) (v_ArrVal_974 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_55| v_ArrVal_974) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_55| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 20:17:34,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3109878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:34,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493342279] [2022-11-16 20:17:34,479 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-16 20:17:34,479 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:17:34,479 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:17:34,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:17:34,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2022-11-16 20:17:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163110558] [2022-11-16 20:17:34,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:17:34,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 20:17:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 20:17:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=626, Unknown=10, NotChecked=102, Total=812 [2022-11-16 20:17:34,481 INFO L87 Difference]: Start difference. First operand 257 states and 293 transitions. Second operand has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 20:17:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:40,423 INFO L93 Difference]: Finished difference Result 273 states and 313 transitions. [2022-11-16 20:17:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 20:17:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-16 20:17:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:40,425 INFO L225 Difference]: With dead ends: 273 [2022-11-16 20:17:40,426 INFO L226 Difference]: Without dead ends: 270 [2022-11-16 20:17:40,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=163, Invalid=1308, Unknown=19, NotChecked=150, Total=1640 [2022-11-16 20:17:40,427 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 121 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:40,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2279 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1912 Invalid, 0 Unknown, 782 Unchecked, 1.3s Time] [2022-11-16 20:17:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-16 20:17:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2022-11-16 20:17:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 235 states have internal predecessors, (247), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2022-11-16 20:17:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2022-11-16 20:17:40,434 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 46 [2022-11-16 20:17:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:40,439 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2022-11-16 20:17:40,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 20:17:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2022-11-16 20:17:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 20:17:40,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:40,443 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:17:40,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 20:17:40,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:40,650 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:17:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash -750347739, now seen corresponding path program 1 times [2022-11-16 20:17:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:40,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152689009] [2022-11-16 20:17:40,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:40,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:17:43,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:43,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152689009] [2022-11-16 20:17:43,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152689009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:43,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177777779] [2022-11-16 20:17:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:43,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:17:43,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:17:43,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:17:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:43,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 20:17:43,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:17:43,306 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:17:43,419 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:17:43,436 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1154 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1154))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-16 20:17:43,602 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1154 Int) (v_ArrVal_1155 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1154))) (and (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1155)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-16 20:17:43,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:43,616 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:17:43,624 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-16 20:17:43,656 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1154 Int) (v_ArrVal_1155 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1154))) (and (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (= |c_#valid| (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1155) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-16 20:17:43,712 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| Int) (v_ArrVal_1154 Int) (v_ArrVal_1155 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_1157 Int) (|v_dll_create_generic_~#dll~0.base_43| Int)) (let ((.cse0 (store |c_old(#valid)| |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1154))) (and (= |c_#valid| (store (store (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| v_ArrVal_1155) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1) |v_dll_create_generic_~#dll~0.base_43| v_ArrVal_1157)) (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_47| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_43|)))) is different from true [2022-11-16 20:17:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:43,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:43,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:17:43,817 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-16 20:17:43,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 39 [2022-11-16 20:17:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-16 20:17:43,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:17:44,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177777779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033820892] [2022-11-16 20:17:44,078 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-16 20:17:44,078 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:17:44,078 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:17:44,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:17:44,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 30 [2022-11-16 20:17:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782836386] [2022-11-16 20:17:44,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:17:44,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 20:17:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 20:17:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=627, Unknown=5, NotChecked=270, Total=992 [2022-11-16 20:17:44,080 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-16 20:18:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:18:12,422 INFO L93 Difference]: Finished difference Result 270 states and 310 transitions. [2022-11-16 20:18:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 20:18:12,422 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-11-16 20:18:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:18:12,423 INFO L225 Difference]: With dead ends: 270 [2022-11-16 20:18:12,423 INFO L226 Difference]: Without dead ends: 270 [2022-11-16 20:18:12,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=216, Invalid=1857, Unknown=17, NotChecked=460, Total=2550 [2022-11-16 20:18:12,424 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 199 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 3645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1319 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:18:12,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1282 Invalid, 3645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2255 Invalid, 0 Unknown, 1319 Unchecked, 2.4s Time] [2022-11-16 20:18:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-16 20:18:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2022-11-16 20:18:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 146 states have (on average 1.7534246575342465) internal successors, (256), 239 states have internal predecessors, (256), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:18:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 304 transitions. [2022-11-16 20:18:12,433 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 304 transitions. Word has length 47 [2022-11-16 20:18:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:18:12,434 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 304 transitions. [2022-11-16 20:18:12,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 28 states have internal predecessors, (66), 8 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-16 20:18:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 304 transitions. [2022-11-16 20:18:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 20:18:12,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:18:12,435 INFO L195 NwaCegarLoop]: 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] [2022-11-16 20:18:12,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 20:18:12,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:18:12,641 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:18:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:18:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash -750347738, now seen corresponding path program 1 times [2022-11-16 20:18:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:18:12,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646349843] [2022-11-16 20:18:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:18:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:18:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:18:14,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:18:14,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646349843] [2022-11-16 20:18:14,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646349843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:18:14,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053423614] [2022-11-16 20:18:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:18:14,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:18:14,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:18:14,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 20:18:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:18:14,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 20:18:14,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:18:14,282 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:18:14,425 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:18:14,429 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:18:14,445 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1359 Int)) (= |c_#valid| (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (exists ((v_ArrVal_1360 Int)) (= |c_#length| (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_1360))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-16 20:18:14,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:14,763 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:18:14,903 WARN L855 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_1361 Int) (v_ArrVal_1360 Int) (v_ArrVal_1363 Int) (v_ArrVal_1362 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| Int) (v_ArrVal_1359 Int)) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (let ((.cse1 (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1362))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1360) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1361) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| v_ArrVal_1363)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 |dll_create_generic_~#dll~0.base|) 1) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66|) 0))))))) is different from true [2022-11-16 20:18:15,036 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1361 Int) (v_ArrVal_1360 Int) (v_ArrVal_1363 Int) (|dll_create_generic_~#dll~0.base| Int) (v_ArrVal_1362 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| Int) (v_ArrVal_1359 Int)) (let ((.cse0 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_1359))) (let ((.cse1 (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1362))) (and (= |c_#length| (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_1360) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1361) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66| v_ArrVal_1363)) (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (= (select .cse1 |dll_create_generic_~#dll~0.base|) 1) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_66|) 0))))) is different from true [2022-11-16 20:18:15,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:15,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:15,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:15,126 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 20:18:15,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 20:18:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:15,160 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-16 20:18:15,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 63 [2022-11-16 20:18:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:18:15,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:18:17,787 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| Int)) (or (forall ((|v_dll_create_generic_~#dll~0.base_62| Int)) (or (forall ((v_ArrVal_1401 Int)) (let ((.cse1 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1401))) (or (forall ((v_ArrVal_1399 Int)) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1399))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| Int)) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84|) 0)) (forall ((v_ArrVal_1398 Int) (v_ArrVal_1400 Int) (v_ArrVal_1402 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1402) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1400) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| v_ArrVal_1398) |c_dll_insert_master_~item~1#1.base|))))) (not (= (select .cse0 |v_dll_create_generic_~#dll~0.base_62|) 1))))) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83|) 0))))) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| |c_#StackHeapBarrier|)))) (or (forall ((|v_dll_create_generic_~#dll~0.base_62| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84| Int) (v_ArrVal_1399 Int) (v_ArrVal_1401 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| Int)) (let ((.cse3 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_62| v_ArrVal_1401))) (let ((.cse2 (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| v_ArrVal_1399))) (or (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_84|) 0)) (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83|) 0)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_62|)) (not (= (select .cse2 |v_dll_create_generic_~#dll~0.base_62|) 1)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_83| |c_#StackHeapBarrier|)))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8)))) is different from false [2022-11-16 20:18:17,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053423614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:18:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482752572] [2022-11-16 20:18:17,792 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-16 20:18:17,792 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:18:17,792 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:18:17,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:18:17,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-11-16 20:18:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005800585] [2022-11-16 20:18:17,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:18:17,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 20:18:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:18:17,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 20:18:17,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=465, Unknown=4, NotChecked=188, Total=756 [2022-11-16 20:18:17,794 INFO L87 Difference]: Start difference. First operand 265 states and 304 transitions. Second operand has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-16 20:18:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:18:29,229 INFO L93 Difference]: Finished difference Result 275 states and 317 transitions. [2022-11-16 20:18:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 20:18:29,230 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2022-11-16 20:18:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:18:29,231 INFO L225 Difference]: With dead ends: 275 [2022-11-16 20:18:29,231 INFO L226 Difference]: Without dead ends: 275 [2022-11-16 20:18:29,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=157, Invalid=785, Unknown=4, NotChecked=244, Total=1190 [2022-11-16 20:18:29,233 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 183 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1188 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 20:18:29,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1121 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1948 Invalid, 0 Unknown, 1188 Unchecked, 1.5s Time] [2022-11-16 20:18:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-16 20:18:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2022-11-16 20:18:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 239 states have internal predecessors, (254), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:18:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions. [2022-11-16 20:18:29,240 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 47 [2022-11-16 20:18:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:18:29,241 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 302 transitions. [2022-11-16 20:18:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-16 20:18:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2022-11-16 20:18:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 20:18:29,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:18:29,242 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-16 20:18:29,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:18:29,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 20:18:29,448 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:18:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:18:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924258, now seen corresponding path program 1 times [2022-11-16 20:18:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:18:29,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529880221] [2022-11-16 20:18:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:18:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:18:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 20:18:30,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:18:30,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529880221] [2022-11-16 20:18:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529880221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:18:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745434377] [2022-11-16 20:18:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:30,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:18:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:18:30,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:18:30,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 20:18:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:18:30,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 20:18:30,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:18:30,957 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:18:30,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1594 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1594))) (< |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-16 20:18:31,004 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1594 Int) (|##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_1594)))) is different from true [2022-11-16 20:18:35,119 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-16 20:18:39,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:18:39,430 INFO L321 Elim1Store]: treesize reduction 67, result has 31.6 percent of original size [2022-11-16 20:18:39,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2022-11-16 20:18:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-16 20:18:39,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:18:39,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745434377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:18:39,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1735397001] [2022-11-16 20:18:39,665 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:18:39,665 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:18:39,666 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:18:39,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:18:39,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 21 [2022-11-16 20:18:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615119426] [2022-11-16 20:18:39,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:18:39,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 20:18:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:18:39,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 20:18:39,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=327, Unknown=7, NotChecked=114, Total=506 [2022-11-16 20:18:39,668 INFO L87 Difference]: Start difference. First operand 265 states and 302 transitions. Second operand has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 20:18:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:18:51,901 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2022-11-16 20:18:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 20:18:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-11-16 20:18:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:18:51,906 INFO L225 Difference]: With dead ends: 269 [2022-11-16 20:18:51,906 INFO L226 Difference]: Without dead ends: 269 [2022-11-16 20:18:51,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=12, NotChecked=198, Total=1332 [2022-11-16 20:18:51,907 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1113 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:18:51,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1443 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1479 Invalid, 0 Unknown, 1113 Unchecked, 1.4s Time] [2022-11-16 20:18:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-16 20:18:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2022-11-16 20:18:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 148 states have (on average 1.7432432432432432) internal successors, (258), 241 states have internal predecessors, (258), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:18:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 306 transitions. [2022-11-16 20:18:51,914 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 306 transitions. Word has length 48 [2022-11-16 20:18:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:18:51,915 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 306 transitions. [2022-11-16 20:18:51,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 20:18:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 306 transitions. [2022-11-16 20:18:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 20:18:51,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:18:51,916 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-16 20:18:51,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:18:52,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 20:18:52,122 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:18:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:18:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1785924257, now seen corresponding path program 1 times [2022-11-16 20:18:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:18:52,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69650790] [2022-11-16 20:18:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:18:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:18:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 20:18:53,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:18:53,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69650790] [2022-11-16 20:18:53,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69650790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:18:53,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082547667] [2022-11-16 20:18:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:18:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:18:53,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:18:53,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 20:18:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:18:53,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 20:18:53,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:18:53,823 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:18:53,828 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:18:53,890 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_1810 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1810) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:19:00,010 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1811 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_1811))))) is different from true [2022-11-16 20:19:09,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:19:09,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:19:09,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:19:09,667 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 20:19:09,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-11-16 20:19:09,685 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 20:19:09,685 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-16 20:19:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-11-16 20:19:09,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:19:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082547667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:19:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486156206] [2022-11-16 20:19:10,109 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:19:10,109 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:19:10,110 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:19:10,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:19:10,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2022-11-16 20:19:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581634100] [2022-11-16 20:19:10,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:19:10,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 20:19:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:19:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 20:19:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=664, Unknown=9, NotChecked=106, Total=870 [2022-11-16 20:19:10,113 INFO L87 Difference]: Start difference. First operand 267 states and 306 transitions. Second operand has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-16 20:19:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:19:24,281 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2022-11-16 20:19:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 20:19:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 48 [2022-11-16 20:19:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:19:24,283 INFO L225 Difference]: With dead ends: 270 [2022-11-16 20:19:24,284 INFO L226 Difference]: Without dead ends: 270 [2022-11-16 20:19:24,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=181, Invalid=1220, Unknown=13, NotChecked=146, Total=1560 [2022-11-16 20:19:24,285 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 196 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 885 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:19:24,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1513 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1689 Invalid, 0 Unknown, 885 Unchecked, 1.4s Time] [2022-11-16 20:19:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-16 20:19:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2022-11-16 20:19:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 148 states have (on average 1.7297297297297298) internal successors, (256), 241 states have internal predecessors, (256), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:19:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 304 transitions. [2022-11-16 20:19:24,301 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 304 transitions. Word has length 48 [2022-11-16 20:19:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:19:24,301 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 304 transitions. [2022-11-16 20:19:24,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-16 20:19:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 304 transitions. [2022-11-16 20:19:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-16 20:19:24,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:19:24,303 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:19:24,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 20:19:24,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:19:24,510 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting dll_insert_masterErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:19:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:19:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -410953665, now seen corresponding path program 1 times [2022-11-16 20:19:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:19:24,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536371505] [2022-11-16 20:19:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:24,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:19:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 20:19:24,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:19:24,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536371505] [2022-11-16 20:19:24,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536371505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:19:24,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791874705] [2022-11-16 20:19:24,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:24,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:19:24,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:19:24,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:19:24,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 20:19:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:25,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 20:19:25,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:19:25,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:19:25,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 20:19:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:19:25,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:19:25,659 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 20 [2022-11-16 20:19:25,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:19:25,779 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 20:19:25,779 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2022-11-16 20:19:25,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:19:25,861 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 20:19:25,862 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2022-11-16 20:19:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:19:25,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791874705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:19:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1674266403] [2022-11-16 20:19:25,947 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-16 20:19:25,947 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:19:25,948 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:19:25,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:19:25,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-11-16 20:19:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805871222] [2022-11-16 20:19:25,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:19:25,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 20:19:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:19:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 20:19:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-11-16 20:19:25,949 INFO L87 Difference]: Start difference. First operand 267 states and 304 transitions. Second operand has 24 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 13 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-16 20:19:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:19:26,618 INFO L93 Difference]: Finished difference Result 265 states and 302 transitions. [2022-11-16 20:19:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:19:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 13 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 60 [2022-11-16 20:19:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:19:26,621 INFO L225 Difference]: With dead ends: 265 [2022-11-16 20:19:26,621 INFO L226 Difference]: Without dead ends: 265 [2022-11-16 20:19:26,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-11-16 20:19:26,622 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 77 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:19:26,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 2324 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 992 Invalid, 0 Unknown, 330 Unchecked, 0.6s Time] [2022-11-16 20:19:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-16 20:19:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-11-16 20:19:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 239 states have internal predecessors, (254), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:19:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions. [2022-11-16 20:19:26,629 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 60 [2022-11-16 20:19:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:19:26,630 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 302 transitions. [2022-11-16 20:19:26,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 13 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-16 20:19:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2022-11-16 20:19:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-16 20:19:26,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:19:26,631 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:19:26,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 20:19:26,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:19:26,838 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting dll_insert_masterErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:19:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:19:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash -410953664, now seen corresponding path program 1 times [2022-11-16 20:19:26,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:19:26,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845804283] [2022-11-16 20:19:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:19:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:19:27,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:19:27,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845804283] [2022-11-16 20:19:27,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845804283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:19:27,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958316872] [2022-11-16 20:19:27,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:27,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:19:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:19:27,563 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:19:27,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 20:19:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:27,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 20:19:27,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:19:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:19:28,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 20:19:28,106 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 20:19:28,107 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-16 20:19:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:19:28,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:19:40,484 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:19:44,683 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 41 [2022-11-16 20:19:44,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:19:44,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 62 [2022-11-16 20:19:44,869 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 20:19:44,870 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-16 20:19:44,883 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 20:19:44,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 20:19:44,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:19:44,950 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 30 [2022-11-16 20:19:44,962 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 20:19:44,962 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 12 [2022-11-16 20:19:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:19:45,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958316872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:19:45,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049635144] [2022-11-16 20:19:45,052 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-16 20:19:45,052 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:19:45,052 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:19:45,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:19:45,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2022-11-16 20:19:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815543177] [2022-11-16 20:19:45,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:19:45,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 20:19:45,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:19:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 20:19:45,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-11-16 20:19:45,055 INFO L87 Difference]: Start difference. First operand 265 states and 302 transitions. Second operand has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-16 20:19:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:19:45,944 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2022-11-16 20:19:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 20:19:45,944 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 60 [2022-11-16 20:19:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:19:45,946 INFO L225 Difference]: With dead ends: 263 [2022-11-16 20:19:45,946 INFO L226 Difference]: Without dead ends: 263 [2022-11-16 20:19:45,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2022-11-16 20:19:45,947 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 104 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 20:19:45,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 2415 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1040 Invalid, 0 Unknown, 793 Unchecked, 0.7s Time] [2022-11-16 20:19:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-16 20:19:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-11-16 20:19:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 148 states have (on average 1.7027027027027026) internal successors, (252), 237 states have internal predecessors, (252), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:19:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 300 transitions. [2022-11-16 20:19:45,955 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 300 transitions. Word has length 60 [2022-11-16 20:19:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:19:45,955 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 300 transitions. [2022-11-16 20:19:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 17 states have (on average 3.411764705882353) internal successors, (58), 18 states have internal predecessors, (58), 10 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-16 20:19:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 300 transitions. [2022-11-16 20:19:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-16 20:19:45,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:19:45,957 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:19:45,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 20:19:46,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 20:19:46,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:19:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:19:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1578028647, now seen corresponding path program 1 times [2022-11-16 20:19:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:19:46,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086674717] [2022-11-16 20:19:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:19:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 20:19:47,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:19:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086674717] [2022-11-16 20:19:47,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086674717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:19:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759216171] [2022-11-16 20:19:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:47,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:19:47,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:19:47,080 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:19:47,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 20:19:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:47,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 20:19:47,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:19:47,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:19:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:19:56,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:19:56,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759216171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:19:56,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [540547313] [2022-11-16 20:19:56,689 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:19:56,689 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:19:56,689 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:19:56,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:19:56,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2022-11-16 20:19:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662312889] [2022-11-16 20:19:56,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:19:56,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 20:19:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:19:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 20:19:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=620, Unknown=8, NotChecked=0, Total=702 [2022-11-16 20:19:56,691 INFO L87 Difference]: Start difference. First operand 263 states and 300 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-16 20:20:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:04,172 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2022-11-16 20:20:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 20:20:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2022-11-16 20:20:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:04,174 INFO L225 Difference]: With dead ends: 266 [2022-11-16 20:20:04,174 INFO L226 Difference]: Without dead ends: 263 [2022-11-16 20:20:04,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=147, Invalid=1171, Unknown=14, NotChecked=0, Total=1332 [2022-11-16 20:20:04,174 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 73 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:04,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1823 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1684 Invalid, 0 Unknown, 266 Unchecked, 1.1s Time] [2022-11-16 20:20:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-16 20:20:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-11-16 20:20:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 148 states have (on average 1.695945945945946) internal successors, (251), 237 states have internal predecessors, (251), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (19), 16 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-16 20:20:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 299 transitions. [2022-11-16 20:20:04,182 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 299 transitions. Word has length 60 [2022-11-16 20:20:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:04,183 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 299 transitions. [2022-11-16 20:20:04,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-16 20:20:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 299 transitions. [2022-11-16 20:20:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 20:20:04,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:04,184 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 20:20:04,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 20:20:04,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 20:20:04,390 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:20:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602016, now seen corresponding path program 2 times [2022-11-16 20:20:04,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:04,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562468810] [2022-11-16 20:20:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:20:08,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562468810] [2022-11-16 20:20:08,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562468810] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386910434] [2022-11-16 20:20:08,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:20:08,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:20:08,279 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:20:08,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 20:20:09,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 20:20:09,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:20:09,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-16 20:20:09,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:20:09,550 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:20:09,648 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:20:09,758 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:20:09,888 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-16 20:20:09,888 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 25 treesize of output 17 [2022-11-16 20:20:09,892 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 11 [2022-11-16 20:20:09,895 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:20:10,537 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:20:10,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:10,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:20:10,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-16 20:20:10,882 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2022-11-16 20:20:10,888 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 20 [2022-11-16 20:20:11,263 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2830 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2830))) (exists ((v_ArrVal_2832 (Array Int Int))) (= (select (select (store |c_old(#memory_$Pointer$.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_2832) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base|)) (< |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-16 20:20:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:15,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:20:15,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2022-11-16 20:20:18,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:18,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:18,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:18,135 INFO L321 Elim1Store]: treesize reduction 127, result has 19.6 percent of original size [2022-11-16 20:20:18,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 75 [2022-11-16 20:20:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-16 20:20:18,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:20:19,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:19,212 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-16 20:20:19,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:20:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:19,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2022-11-16 20:20:19,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:19,234 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-16 20:20:19,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:20:19,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:19,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2022-11-16 20:20:19,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386910434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1634291894] [2022-11-16 20:20:19,385 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:20:19,386 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:20:19,386 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:20:19,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:20:19,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 49 [2022-11-16 20:20:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972525841] [2022-11-16 20:20:19,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:20:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 20:20:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 20:20:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2267, Unknown=9, NotChecked=96, Total=2550 [2022-11-16 20:20:19,390 INFO L87 Difference]: Start difference. First operand 263 states and 299 transitions. Second operand has 50 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 20:20:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:34,988 INFO L93 Difference]: Finished difference Result 288 states and 330 transitions. [2022-11-16 20:20:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 20:20:34,989 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 61 [2022-11-16 20:20:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:34,990 INFO L225 Difference]: With dead ends: 288 [2022-11-16 20:20:34,990 INFO L226 Difference]: Without dead ends: 288 [2022-11-16 20:20:34,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=338, Invalid=4065, Unknown=23, NotChecked=130, Total=4556 [2022-11-16 20:20:34,991 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 164 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 4807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2490 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:34,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 2207 Invalid, 4807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2271 Invalid, 0 Unknown, 2490 Unchecked, 2.6s Time] [2022-11-16 20:20:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-16 20:20:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2022-11-16 20:20:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 164 states have (on average 1.646341463414634) internal successors, (270), 252 states have internal predecessors, (270), 30 states have call successors, (30), 13 states have call predecessors, (30), 15 states have return successors, (23), 20 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-16 20:20:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 323 transitions. [2022-11-16 20:20:34,999 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 323 transitions. Word has length 61 [2022-11-16 20:20:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:35,000 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 323 transitions. [2022-11-16 20:20:35,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 9 states have call successors, (11), 3 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 20:20:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2022-11-16 20:20:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 20:20:35,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:35,001 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 20:20:35,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 20:20:35,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:35,202 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:20:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1299602015, now seen corresponding path program 1 times [2022-11-16 20:20:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:35,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964068475] [2022-11-16 20:20:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 20:20:37,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964068475] [2022-11-16 20:20:37,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964068475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916030157] [2022-11-16 20:20:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:37,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:20:37,280 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:20:37,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 20:20:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:37,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 20:20:37,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:20:37,648 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:20:37,799 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:20:37,997 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 20:20:37,997 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 23 [2022-11-16 20:20:38,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:38,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:38,388 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-16 20:20:38,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2022-11-16 20:20:39,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,110 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-16 20:20:39,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 46 [2022-11-16 20:20:39,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:39,177 INFO L321 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2022-11-16 20:20:39,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 145 treesize of output 155 [2022-11-16 20:20:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:20:39,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:20:48,081 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:20:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916030157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732351472] [2022-11-16 20:20:48,084 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:20:48,084 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:20:48,084 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:20:48,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:20:48,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 20:20:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745429868] [2022-11-16 20:20:48,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:20:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 20:20:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 20:20:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=684, Unknown=1, NotChecked=0, Total=812 [2022-11-16 20:20:48,087 INFO L87 Difference]: Start difference. First operand 283 states and 323 transitions. Second operand has 27 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 23 states have internal predecessors, (81), 10 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-16 20:20:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:49,615 INFO L93 Difference]: Finished difference Result 290 states and 332 transitions. [2022-11-16 20:20:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 20:20:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 23 states have internal predecessors, (81), 10 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 61 [2022-11-16 20:20:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:49,620 INFO L225 Difference]: With dead ends: 290 [2022-11-16 20:20:49,620 INFO L226 Difference]: Without dead ends: 290 [2022-11-16 20:20:49,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=154, Invalid=837, Unknown=1, NotChecked=0, Total=992 [2022-11-16 20:20:49,621 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 54 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 720 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:49,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1321 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 933 Invalid, 0 Unknown, 720 Unchecked, 0.8s Time] [2022-11-16 20:20:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-16 20:20:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2022-11-16 20:20:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 164 states have (on average 1.6341463414634145) internal successors, (268), 252 states have internal predecessors, (268), 30 states have call successors, (30), 13 states have call predecessors, (30), 15 states have return successors, (23), 20 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-16 20:20:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 321 transitions. [2022-11-16 20:20:49,629 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 321 transitions. Word has length 61 [2022-11-16 20:20:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:49,629 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 321 transitions. [2022-11-16 20:20:49,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 23 states have internal predecessors, (81), 10 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-16 20:20:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 321 transitions. [2022-11-16 20:20:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 20:20:49,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:49,631 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:20:49,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 20:20:49,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 20:20:49,838 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting dll_insert_masterErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:20:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777986, now seen corresponding path program 1 times [2022-11-16 20:20:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:49,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919934274] [2022-11-16 20:20:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:49,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 20:20:50,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:50,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919934274] [2022-11-16 20:20:50,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919934274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:50,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558564904] [2022-11-16 20:20:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:20:50,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:20:50,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 20:20:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:51,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-16 20:20:51,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:20:51,312 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:20:51,670 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 20:20:51,670 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-16 20:20:51,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:51,741 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-16 20:20:51,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:51,761 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-16 20:20:51,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:20:51,791 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-11-16 20:20:51,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:20:51,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 20:20:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:20:51,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:20:52,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| Int) (v_ArrVal_3458 (Array Int Int))) (or (not (< |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| 1) (select (select (store |c_#memory_$Pointer$.base| |v_dll_insert_master_alloc_or_die_master_~ptr~1#1.base_37| v_ArrVal_3458) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) 1))) is different from false [2022-11-16 20:20:52,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:52,571 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 20:20:52,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:52,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2022-11-16 20:20:52,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:52,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 [2022-11-16 20:20:52,617 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 28 [2022-11-16 20:20:53,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:53,042 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2022-11-16 20:20:53,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:53,073 INFO L350 Elim1Store]: Elim1 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 102 treesize of output 120 [2022-11-16 20:20:53,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:20:53,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 204 [2022-11-16 20:20:53,167 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 112 [2022-11-16 20:20:53,178 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 108 [2022-11-16 20:21:06,268 WARN L233 SmtUtils]: Spent 11.67s on a formula simplification. DAG size of input: 55 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:21:06,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:06,289 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 20:21:06,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:21:06,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:06,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 [2022-11-16 20:21:06,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:06,322 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 20:21:06,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:06,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 43 [2022-11-16 20:21:06,341 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-16 20:21:06,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:06,389 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 20:21:06,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:21:06,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:06,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 [2022-11-16 20:21:35,577 WARN L233 SmtUtils]: Spent 28.99s on a formula simplification. DAG size of input: 58 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:21:35,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:35,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 202 [2022-11-16 20:21:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:21:40,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558564904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:21:40,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1146114690] [2022-11-16 20:21:40,196 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-16 20:21:40,196 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:21:40,196 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:21:40,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:21:40,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 37 [2022-11-16 20:21:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980832174] [2022-11-16 20:21:40,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:21:40,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 20:21:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:21:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 20:21:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1148, Unknown=75, NotChecked=70, Total=1406 [2022-11-16 20:21:40,200 INFO L87 Difference]: Start difference. First operand 283 states and 321 transitions. Second operand has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 20:21:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:21:41,883 INFO L93 Difference]: Finished difference Result 296 states and 340 transitions. [2022-11-16 20:21:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 20:21:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2022-11-16 20:21:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:21:41,885 INFO L225 Difference]: With dead ends: 296 [2022-11-16 20:21:41,885 INFO L226 Difference]: Without dead ends: 296 [2022-11-16 20:21:41,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=232, Invalid=1943, Unknown=85, NotChecked=92, Total=2352 [2022-11-16 20:21:41,887 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 61 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1007 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:21:41,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3466 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1279 Invalid, 0 Unknown, 1007 Unchecked, 1.0s Time] [2022-11-16 20:21:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-16 20:21:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2022-11-16 20:21:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 174 states have (on average 1.6091954022988506) internal successors, (280), 261 states have internal predecessors, (280), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (25), 20 states have call predecessors, (25), 17 states have call successors, (25) [2022-11-16 20:21:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 336 transitions. [2022-11-16 20:21:41,895 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 336 transitions. Word has length 63 [2022-11-16 20:21:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:21:41,895 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 336 transitions. [2022-11-16 20:21:41,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 2.6) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 20:21:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 336 transitions. [2022-11-16 20:21:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 20:21:41,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:21:41,897 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:21:41,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 20:21:42,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 20:21:42,103 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting dll_insert_masterErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:21:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:21:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2044777985, now seen corresponding path program 1 times [2022-11-16 20:21:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:21:42,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792151073] [2022-11-16 20:21:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:21:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:21:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:21:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 20:21:43,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:21:43,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792151073] [2022-11-16 20:21:43,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792151073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:21:43,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191287601] [2022-11-16 20:21:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:21:43,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:21:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:21:43,363 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:21:43,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 20:21:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:21:43,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-16 20:21:43,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:21:43,955 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:21:43,961 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:21:44,297 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 20:21:44,297 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2022-11-16 20:21:44,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 20:21:44,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:21:44,367 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-16 20:21:44,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:21:44,378 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:21:44,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:21:44,397 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:21:44,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:21:44,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:21:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:21:44,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 20:21:44,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:21:44,435 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 24 [2022-11-16 20:21:44,484 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2022-11-16 20:21:44,490 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-16 20:21:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:21:44,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:21:47,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:47,648 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-11-16 20:21:47,652 INFO L350 Elim1Store]: Elim1 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 129 treesize of output 117 [2022-11-16 20:21:47,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:47,661 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2022-11-16 20:21:47,666 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 126 [2022-11-16 20:21:47,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:47,681 INFO L350 Elim1Store]: Elim1 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 170 treesize of output 166 [2022-11-16 20:21:47,687 INFO L350 Elim1Store]: Elim1 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 151 treesize of output 143 [2022-11-16 20:21:47,693 INFO L350 Elim1Store]: Elim1 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 154 treesize of output 144 [2022-11-16 20:21:47,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:47,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 142 treesize of output 160 [2022-11-16 20:21:47,726 INFO L350 Elim1Store]: Elim1 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 131 treesize of output 129 [2022-11-16 20:21:49,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:49,351 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-11-16 20:21:49,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:49,362 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2022-11-16 20:21:49,387 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 20:21:49,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 105 treesize of output 100 [2022-11-16 20:21:49,404 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 20:21:49,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 142 treesize of output 126 [2022-11-16 20:21:49,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:49,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 188 treesize of output 202 [2022-11-16 20:21:49,446 INFO L350 Elim1Store]: Elim1 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 169 treesize of output 161 [2022-11-16 20:21:49,454 INFO L350 Elim1Store]: Elim1 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 182 treesize of output 170 [2022-11-16 20:21:49,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:49,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 160 treesize of output 178 [2022-11-16 20:21:49,503 INFO L350 Elim1Store]: Elim1 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 149 treesize of output 147 [2022-11-16 20:21:50,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:50,888 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-16 20:21:50,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:21:50,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:50,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 21 [2022-11-16 20:21:50,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:50,919 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-16 20:21:50,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:50,927 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-16 20:21:50,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:21:50,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:50,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 33 [2022-11-16 20:21:50,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:21:50,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:50,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 26 [2022-11-16 20:21:59,288 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 39 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:21:59,313 INFO L350 Elim1Store]: Elim1 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 86 treesize of output 82 [2022-11-16 20:21:59,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:21:59,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 152 [2022-11-16 20:21:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:21:59,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191287601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:21:59,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2085636368] [2022-11-16 20:21:59,763 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-16 20:21:59,764 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:21:59,764 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:21:59,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:21:59,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2022-11-16 20:21:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937492157] [2022-11-16 20:21:59,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:21:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 20:21:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:21:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 20:21:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1136, Unknown=14, NotChecked=0, Total=1260 [2022-11-16 20:21:59,768 INFO L87 Difference]: Start difference. First operand 294 states and 336 transitions. Second operand has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-16 20:22:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:22:02,029 INFO L93 Difference]: Finished difference Result 296 states and 339 transitions. [2022-11-16 20:22:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 20:22:02,034 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 63 [2022-11-16 20:22:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:22:02,036 INFO L225 Difference]: With dead ends: 296 [2022-11-16 20:22:02,036 INFO L226 Difference]: Without dead ends: 296 [2022-11-16 20:22:02,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=247, Invalid=1994, Unknown=15, NotChecked=0, Total=2256 [2022-11-16 20:22:02,038 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 66 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:22:02,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 3075 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1577 Invalid, 0 Unknown, 891 Unchecked, 1.4s Time] [2022-11-16 20:22:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-16 20:22:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2022-11-16 20:22:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 175 states have (on average 1.5942857142857143) internal successors, (279), 261 states have internal predecessors, (279), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (25), 21 states have call predecessors, (25), 17 states have call successors, (25) [2022-11-16 20:22:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 335 transitions. [2022-11-16 20:22:02,046 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 335 transitions. Word has length 63 [2022-11-16 20:22:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:22:02,047 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 335 transitions. [2022-11-16 20:22:02,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 29 states have internal predecessors, (72), 13 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-16 20:22:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 335 transitions. [2022-11-16 20:22:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 20:22:02,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:22:02,048 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:22:02,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 20:22:02,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:22:02,255 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:22:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:22:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937661, now seen corresponding path program 1 times [2022-11-16 20:22:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:22:02,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641619048] [2022-11-16 20:22:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:22:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:22:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:22:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 20:22:04,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:22:04,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641619048] [2022-11-16 20:22:04,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641619048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:22:04,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634741090] [2022-11-16 20:22:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:22:04,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:22:04,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:22:04,122 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:22:04,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 20:22:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:22:04,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 20:22:04,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:22:04,568 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:22:04,601 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3991 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_3991))))) is different from true [2022-11-16 20:22:08,699 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-16 20:22:08,808 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3993 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_3993))))) is different from true [2022-11-16 20:22:32,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:22:32,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:22:32,199 INFO L321 Elim1Store]: treesize reduction 106, result has 30.3 percent of original size [2022-11-16 20:22:32,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 57 [2022-11-16 20:22:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 25 not checked. [2022-11-16 20:22:32,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:22:32,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634741090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:22:32,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005332142] [2022-11-16 20:22:32,486 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-16 20:22:32,486 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:22:32,486 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:22:32,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:22:32,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 23 [2022-11-16 20:22:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397217233] [2022-11-16 20:22:32,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:22:32,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 20:22:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:22:32,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 20:22:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=394, Unknown=16, NotChecked=126, Total=600 [2022-11-16 20:22:32,492 INFO L87 Difference]: Start difference. First operand 295 states and 335 transitions. Second operand has 24 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-16 20:22:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:22:58,118 INFO L93 Difference]: Finished difference Result 319 states and 368 transitions. [2022-11-16 20:22:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 20:22:58,118 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 62 [2022-11-16 20:22:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:22:58,120 INFO L225 Difference]: With dead ends: 319 [2022-11-16 20:22:58,120 INFO L226 Difference]: Without dead ends: 319 [2022-11-16 20:22:58,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=175, Invalid=1293, Unknown=26, NotChecked=228, Total=1722 [2022-11-16 20:22:58,121 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 254 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1353 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 20:22:58,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1292 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1156 Invalid, 0 Unknown, 1353 Unchecked, 1.8s Time] [2022-11-16 20:22:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-16 20:22:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2022-11-16 20:22:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 183 states have (on average 1.6010928961748634) internal successors, (293), 268 states have internal predecessors, (293), 32 states have call successors, (32), 15 states have call predecessors, (32), 18 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-11-16 20:22:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 352 transitions. [2022-11-16 20:22:58,152 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 352 transitions. Word has length 62 [2022-11-16 20:22:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:22:58,153 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 352 transitions. [2022-11-16 20:22:58,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 states have internal predecessors, (63), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-16 20:22:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 352 transitions. [2022-11-16 20:22:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 20:22:58,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:22:58,156 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:22:58,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 20:22:58,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-16 20:22:58,363 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:22:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:22:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1632937660, now seen corresponding path program 1 times [2022-11-16 20:22:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:22:58,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502277182] [2022-11-16 20:22:58,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:22:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:22:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 20:23:01,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:01,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502277182] [2022-11-16 20:23:01,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502277182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:01,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93689965] [2022-11-16 20:23:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:01,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:23:01,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:23:01,740 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:23:01,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 20:23:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:02,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 20:23:02,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:23:02,458 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:23:02,463 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:23:02,556 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4281 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4281) |c_#length|)))) is different from true [2022-11-16 20:23:06,720 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4282 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4282))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:23:13,003 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4283 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4283))))) is different from true [2022-11-16 20:23:22,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:22,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:22,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:22,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:23:22,092 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 20:23:22,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 52 [2022-11-16 20:23:22,111 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 20:23:22,111 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-16 20:23:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 25 not checked. [2022-11-16 20:23:22,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:23:24,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93689965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:24,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1187730432] [2022-11-16 20:23:24,697 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-16 20:23:24,697 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:23:24,698 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:23:24,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:23:24,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 37 [2022-11-16 20:23:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784815425] [2022-11-16 20:23:24,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:23:24,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 20:23:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 20:23:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1139, Unknown=11, NotChecked=210, Total=1482 [2022-11-16 20:23:24,700 INFO L87 Difference]: Start difference. First operand 306 states and 352 transitions. Second operand has 38 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 20:23:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:59,586 INFO L93 Difference]: Finished difference Result 331 states and 379 transitions. [2022-11-16 20:23:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 20:23:59,586 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2022-11-16 20:23:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:59,589 INFO L225 Difference]: With dead ends: 331 [2022-11-16 20:23:59,589 INFO L226 Difference]: Without dead ends: 331 [2022-11-16 20:23:59,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=311, Invalid=2646, Unknown=25, NotChecked=324, Total=3306 [2022-11-16 20:23:59,591 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 250 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1244 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:59,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1986 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2754 Invalid, 0 Unknown, 1244 Unchecked, 3.7s Time] [2022-11-16 20:23:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-16 20:23:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 304. [2022-11-16 20:23:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 181 states have (on average 1.6022099447513811) internal successors, (290), 267 states have internal predecessors, (290), 32 states have call successors, (32), 15 states have call predecessors, (32), 18 states have return successors, (26), 24 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-16 20:23:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 348 transitions. [2022-11-16 20:23:59,602 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 348 transitions. Word has length 62 [2022-11-16 20:23:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:59,602 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 348 transitions. [2022-11-16 20:23:59,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-16 20:23:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 348 transitions. [2022-11-16 20:23:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 20:23:59,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:59,604 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:23:59,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 20:23:59,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-16 20:23:59,812 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:23:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1272622706, now seen corresponding path program 1 times [2022-11-16 20:23:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:59,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727220686] [2022-11-16 20:23:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:24:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-16 20:24:00,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:24:00,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727220686] [2022-11-16 20:24:00,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727220686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:24:00,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229034107] [2022-11-16 20:24:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:24:00,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:24:00,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:24:00,921 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:24:00,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 20:24:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:24:01,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 20:24:01,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:24:01,656 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:24:01,733 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4770 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4770))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:24:03,847 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4771 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4771))))) is different from true [2022-11-16 20:24:06,018 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1))) is different from true [2022-11-16 20:24:10,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:10,595 INFO L321 Elim1Store]: treesize reduction 106, result has 30.3 percent of original size [2022-11-16 20:24:10,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 57 [2022-11-16 20:24:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 100 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 25 not checked. [2022-11-16 20:24:10,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:24:10,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229034107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:24:10,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968008791] [2022-11-16 20:24:10,963 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-16 20:24:10,963 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:24:10,963 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:24:10,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:24:10,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 29 [2022-11-16 20:24:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826098695] [2022-11-16 20:24:10,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:24:10,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 20:24:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:24:10,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 20:24:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=642, Unknown=7, NotChecked=156, Total=870 [2022-11-16 20:24:10,965 INFO L87 Difference]: Start difference. First operand 304 states and 348 transitions. Second operand has 29 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 14 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-16 20:24:17,285 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4771 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4771))))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4770 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4770))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)))) is different from true [2022-11-16 20:24:19,467 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4771 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_4771))))) (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| 1)))) is different from true [2022-11-16 20:24:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:24:21,407 INFO L93 Difference]: Finished difference Result 322 states and 360 transitions. [2022-11-16 20:24:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 20:24:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 14 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 110 [2022-11-16 20:24:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:24:21,410 INFO L225 Difference]: With dead ends: 322 [2022-11-16 20:24:21,410 INFO L226 Difference]: Without dead ends: 322 [2022-11-16 20:24:21,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=260, Invalid=2096, Unknown=16, NotChecked=490, Total=2862 [2022-11-16 20:24:21,411 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 160 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 3854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1557 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:24:21,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 2413 Invalid, 3854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2243 Invalid, 0 Unknown, 1557 Unchecked, 1.4s Time] [2022-11-16 20:24:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-16 20:24:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 305. [2022-11-16 20:24:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 268 states have internal predecessors, (290), 32 states have call successors, (32), 15 states have call predecessors, (32), 18 states have return successors, (26), 24 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-16 20:24:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 348 transitions. [2022-11-16 20:24:21,419 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 348 transitions. Word has length 110 [2022-11-16 20:24:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:24:21,419 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 348 transitions. [2022-11-16 20:24:21,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 14 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-16 20:24:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 348 transitions. [2022-11-16 20:24:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 20:24:21,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:24:21,421 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:24:21,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 20:24:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:24:21,629 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:24:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:24:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1662358504, now seen corresponding path program 1 times [2022-11-16 20:24:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:24:21,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645017119] [2022-11-16 20:24:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:24:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:24:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:24:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 114 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 20:24:26,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:24:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645017119] [2022-11-16 20:24:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645017119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:24:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130740711] [2022-11-16 20:24:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:24:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:24:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:24:26,905 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:24:26,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 20:24:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:24:27,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 20:24:27,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:24:27,909 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:24:27,912 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:24:28,015 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:24:28,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:28,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:28,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:24:28,337 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5272 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5272) |c_#length|)))) is different from true [2022-11-16 20:24:28,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:28,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:28,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:24:28,593 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5273 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_5273) |c_#length|)))) is different from true [2022-11-16 20:24:31,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,169 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 20:24:31,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 42 [2022-11-16 20:24:31,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:24:31,194 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 20:24:31,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-16 20:24:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 100 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 25 not checked. [2022-11-16 20:24:31,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:24:37,862 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:24:37,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130740711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:24:37,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2000981814] [2022-11-16 20:24:37,865 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-16 20:24:37,865 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:24:37,865 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:24:37,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:24:37,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 49 [2022-11-16 20:24:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186766861] [2022-11-16 20:24:37,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:24:37,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 20:24:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:24:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 20:24:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2159, Unknown=3, NotChecked=190, Total=2550 [2022-11-16 20:24:37,868 INFO L87 Difference]: Start difference. First operand 305 states and 348 transitions. Second operand has 50 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 states have internal predecessors, (126), 15 states have call successors, (22), 8 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2022-11-16 20:24:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:24:50,287 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2022-11-16 20:24:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 20:24:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 states have internal predecessors, (126), 15 states have call successors, (22), 8 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) Word has length 111 [2022-11-16 20:24:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:24:50,289 INFO L225 Difference]: With dead ends: 310 [2022-11-16 20:24:50,289 INFO L226 Difference]: Without dead ends: 310 [2022-11-16 20:24:50,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=514, Invalid=5652, Unknown=4, NotChecked=310, Total=6480 [2022-11-16 20:24:50,292 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 134 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 4469 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 5577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1072 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:24:50,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 3113 Invalid, 5577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4469 Invalid, 0 Unknown, 1072 Unchecked, 5.4s Time] [2022-11-16 20:24:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-16 20:24:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2022-11-16 20:24:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 267 states have internal predecessors, (287), 32 states have call successors, (32), 15 states have call predecessors, (32), 18 states have return successors, (26), 23 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-16 20:24:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 345 transitions. [2022-11-16 20:24:50,300 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 345 transitions. Word has length 111 [2022-11-16 20:24:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:24:50,300 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 345 transitions. [2022-11-16 20:24:50,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 states have internal predecessors, (126), 15 states have call successors, (22), 8 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2022-11-16 20:24:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 345 transitions. [2022-11-16 20:24:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-16 20:24:50,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:24:50,305 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:24:50,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 20:24:50,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:24:50,515 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting dll_insert_masterErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:24:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:24:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -467489353, now seen corresponding path program 1 times [2022-11-16 20:24:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:24:50,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167093704] [2022-11-16 20:24:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:24:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:24:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:24:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 153 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-16 20:24:57,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:24:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167093704] [2022-11-16 20:24:57,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167093704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:24:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504845925] [2022-11-16 20:24:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:24:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:24:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:24:57,530 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:24:57,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 20:24:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:24:58,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-16 20:24:58,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:24:58,205 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:24:58,304 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:24:58,600 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:24:58,798 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 20:24:58,798 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2022-11-16 20:24:58,803 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-16 20:24:59,302 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 32 [2022-11-16 20:24:59,489 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-16 20:24:59,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-11-16 20:24:59,878 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:25:00,190 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-16 20:25:00,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-11-16 20:25:00,621 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5842 (Array Int Int))) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~next~0#1.base| (select (select (store |c_old(#memory_$Pointer$.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5842) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (< |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5840 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_5840)))) is different from true [2022-11-16 20:25:01,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:01,051 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 24 [2022-11-16 20:25:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:02,120 INFO L321 Elim1Store]: treesize reduction 268, result has 14.9 percent of original size [2022-11-16 20:25:02,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 66 treesize of output 93 [2022-11-16 20:25:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 141 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 3 not checked. [2022-11-16 20:25:02,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:25:04,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:25:04,018 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 20:25:04,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:25:04,033 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 45 [2022-11-16 20:25:04,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504845925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:25:04,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070243487] [2022-11-16 20:25:04,254 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-16 20:25:04,255 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:25:04,255 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:25:04,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:25:04,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 58 [2022-11-16 20:25:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327291397] [2022-11-16 20:25:04,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:25:04,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-16 20:25:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:25:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-16 20:25:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3168, Unknown=12, NotChecked=114, Total=3540 [2022-11-16 20:25:04,262 INFO L87 Difference]: Start difference. First operand 303 states and 345 transitions. Second operand has 59 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 11 states have call successors, (16), 3 states have call predecessors, (16), 11 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-16 20:25:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:25:13,221 INFO L93 Difference]: Finished difference Result 327 states and 376 transitions. [2022-11-16 20:25:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 20:25:13,224 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 11 states have call successors, (16), 3 states have call predecessors, (16), 11 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) Word has length 124 [2022-11-16 20:25:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:25:13,226 INFO L225 Difference]: With dead ends: 327 [2022-11-16 20:25:13,226 INFO L226 Difference]: Without dead ends: 327 [2022-11-16 20:25:13,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=445, Invalid=5386, Unknown=25, NotChecked=150, Total=6006 [2022-11-16 20:25:13,228 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 101 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 6036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2398 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:25:13,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 2961 Invalid, 6036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3604 Invalid, 0 Unknown, 2398 Unchecked, 5.3s Time] [2022-11-16 20:25:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-16 20:25:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2022-11-16 20:25:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 197 states have (on average 1.5634517766497462) internal successors, (308), 282 states have internal predecessors, (308), 33 states have call successors, (33), 16 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 19 states have call successors, (31) [2022-11-16 20:25:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 372 transitions. [2022-11-16 20:25:13,237 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 372 transitions. Word has length 124 [2022-11-16 20:25:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:25:13,237 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 372 transitions. [2022-11-16 20:25:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 11 states have call successors, (16), 3 states have call predecessors, (16), 11 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-16 20:25:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 372 transitions. [2022-11-16 20:25:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-16 20:25:13,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:25:13,239 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:25:13,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 20:25:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:25:13,449 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting dll_insert_masterErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:25:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:25:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -467489352, now seen corresponding path program 1 times [2022-11-16 20:25:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:25:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794665182] [2022-11-16 20:25:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:25:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:25:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:25:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 132 proven. 46 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-16 20:25:18,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:25:18,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794665182] [2022-11-16 20:25:18,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794665182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:25:18,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435920742] [2022-11-16 20:25:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:25:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:25:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:25:18,171 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:25:18,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 20:25:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:25:18,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-16 20:25:18,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:25:18,942 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:25:19,204 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:25:19,209 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:25:19,609 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:25:19,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:19,847 INFO L350 Elim1Store]: Elim1 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 3 [2022-11-16 20:25:19,852 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-16 20:25:20,502 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 20:25:20,634 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 59 [2022-11-16 20:25:20,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:20,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:20,890 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-16 20:25:20,891 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 31 [2022-11-16 20:25:20,897 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2022-11-16 20:25:21,479 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 59 [2022-11-16 20:25:21,531 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6428 Int) (v_ArrVal_6417 Int) (v_arrayElimCell_232 Int) (v_ArrVal_6416 Int) (v_ArrVal_6427 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (v_ArrVal_6413 Int) (v_ArrVal_6412 Int) (v_arrayElimCell_236 Int) (v_ArrVal_6411 Int) (v_ArrVal_6410 Int)) (let ((.cse2 (store |c_old(#valid)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_6411))) (let ((.cse1 (store .cse2 v_arrayElimCell_232 v_ArrVal_6412))) (let ((.cse0 (store .cse1 v_arrayElimCell_236 v_ArrVal_6416))) (and (= (select .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (store (store (store (store |c_old(#length)| |c_dll_create_generic_~#dll~0.base| v_ArrVal_6410) v_arrayElimCell_232 v_ArrVal_6413) v_arrayElimCell_236 v_ArrVal_6417) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6427) |c_#length|) (< v_arrayElimCell_236 |c_#StackHeapBarrier|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store .cse0 |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6428)) (= (select .cse1 v_arrayElimCell_236) 0) (< v_arrayElimCell_232 |c_#StackHeapBarrier|) (= (select .cse2 v_arrayElimCell_232) 0)))))) (< |c_#StackHeapBarrier| |c_dll_create_generic_~#dll~0.base|)) is different from true [2022-11-16 20:25:21,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:21,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:21,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:21,694 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-16 20:25:21,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 68 treesize of output 68 [2022-11-16 20:25:22,015 WARN L855 $PredicateComparison]: unable to prove that (exists ((|dll_create_generic_~#dll~0.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (exists ((v_ArrVal_6417 Int) (v_ArrVal_6428 Int) (v_ArrVal_6427 Int) (v_ArrVal_6416 Int) (v_ArrVal_6426 Int) (v_ArrVal_6413 Int) (v_arrayElimCell_236 Int) (v_ArrVal_6412 Int) (v_ArrVal_6411 Int) (v_ArrVal_6410 Int) (v_arrayElimCell_232 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| Int)) (let ((.cse2 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_6411))) (let ((.cse0 (store .cse2 v_arrayElimCell_232 v_ArrVal_6412))) (let ((.cse1 (store .cse0 v_arrayElimCell_236 v_ArrVal_6416))) (and (= |c_#length| (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_6410) v_arrayElimCell_232 v_ArrVal_6413) v_arrayElimCell_236 v_ArrVal_6417) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| v_ArrVal_6427) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6426)) (= (select .cse0 v_arrayElimCell_236) 0) (< v_arrayElimCell_236 |c_#StackHeapBarrier|) (= (select (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| v_ArrVal_6428) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| |c_#StackHeapBarrier|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse2 v_arrayElimCell_232) 0) (< v_arrayElimCell_232 |c_#StackHeapBarrier|)))))))) is different from true [2022-11-16 20:25:22,315 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6417 Int) (v_ArrVal_6428 Int) (v_ArrVal_6427 Int) (v_ArrVal_6416 Int) (v_ArrVal_6426 Int) (v_ArrVal_6413 Int) (v_arrayElimCell_236 Int) (v_ArrVal_6412 Int) (v_ArrVal_6411 Int) (v_ArrVal_6410 Int) (|dll_create_generic_~#dll~0.base| Int) (v_arrayElimCell_232 Int) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| Int)) (let ((.cse2 (store |c_old(#valid)| |dll_create_generic_~#dll~0.base| v_ArrVal_6411))) (let ((.cse0 (store .cse2 v_arrayElimCell_232 v_ArrVal_6412))) (let ((.cse1 (store .cse0 v_arrayElimCell_236 v_ArrVal_6416))) (and (= |c_#length| (store (store (store (store (store |c_old(#length)| |dll_create_generic_~#dll~0.base| v_ArrVal_6410) v_arrayElimCell_232 v_ArrVal_6413) v_arrayElimCell_236 v_ArrVal_6417) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| v_ArrVal_6427) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_6426)) (= (select .cse0 v_arrayElimCell_236) 0) (< v_arrayElimCell_236 |c_#StackHeapBarrier|) (= (select (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| v_ArrVal_6428) |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base|) 0) (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475|) 0) (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_475| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |dll_create_generic_~#dll~0.base|) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select .cse2 v_arrayElimCell_232) 0) (< v_arrayElimCell_232 |c_#StackHeapBarrier|)))))) is different from true [2022-11-16 20:25:22,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,552 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-16 20:25:22,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 57 [2022-11-16 20:25:22,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:25:22,666 INFO L321 Elim1Store]: treesize reduction 55, result has 32.1 percent of original size [2022-11-16 20:25:22,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 275 treesize of output 288 [2022-11-16 20:25:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 146 proven. 44 refuted. 0 times theorem prover too weak. 34 trivial. 7 not checked. [2022-11-16 20:25:22,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:25:27,599 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500| Int)) (or (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500| |c_#StackHeapBarrier|)) (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| Int)) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| Int)) (or (forall ((|v_dll_create_generic_~#dll~0.base_243| Int)) (or (forall ((v_ArrVal_6509 Int)) (let ((.cse2 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_243| v_ArrVal_6509))) (or (forall ((v_ArrVal_6511 Int)) (let ((.cse1 (store .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| v_ArrVal_6511))) (or (forall ((|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| Int) (v_ArrVal_6515 Int) (v_ArrVal_6513 Int)) (let ((.cse0 (store .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| v_ArrVal_6513))) (or (not (= (select .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501|) 0)) (not (= (select (store .cse0 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| v_ArrVal_6515) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500|) 0)) (forall ((v_ArrVal_6517 Int) (v_ArrVal_6516 Int) (v_ArrVal_6514 Int) (v_ArrVal_6512 Int) (v_ArrVal_6510 Int)) (<= (+ |c_dll_insert_master_~item~1#1.offset| 12) (select (store (store (store (store (store |c_#length| |v_dll_create_generic_~#dll~0.base_243| v_ArrVal_6517) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| v_ArrVal_6510) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| v_ArrVal_6512) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| v_ArrVal_6514) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500| v_ArrVal_6516) |c_dll_insert_master_~item~1#1.base|))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| |c_#StackHeapBarrier|))))) (not (= (select .cse1 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396|) 0))))) (not (= (select .cse2 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397|) 0))))) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_243|)))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| |c_#StackHeapBarrier|)))) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| |c_#StackHeapBarrier|)))))) (or (forall ((v_ArrVal_6509 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| Int) (v_ArrVal_6515 Int) (|v_dll_create_generic_~#dll~0.base_243| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| Int) (v_ArrVal_6513 Int) (v_ArrVal_6511 Int) (|v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500| Int)) (let ((.cse4 (store |c_#valid| |v_dll_create_generic_~#dll~0.base_243| v_ArrVal_6509))) (let ((.cse5 (store .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| v_ArrVal_6511))) (let ((.cse3 (store .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| v_ArrVal_6513))) (or (not (= (select .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396| |c_#StackHeapBarrier|)) (not (= (select (store .cse3 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| v_ArrVal_6515) |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500|) 0)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_500| |c_#StackHeapBarrier|)) (not (< |c_#StackHeapBarrier| |v_dll_create_generic_~#dll~0.base_243|)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397| |c_#StackHeapBarrier|)) (not (< |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base_501| |c_#StackHeapBarrier|)) (not (= (select .cse4 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_397|) 0)) (not (= (select .cse5 |v_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_#res#1.base_396|) 0))))))) (<= 0 (+ |c_dll_insert_master_~item~1#1.offset| 8)))) is different from false [2022-11-16 20:25:27,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435920742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:25:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2078524463] [2022-11-16 20:25:27,605 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-16 20:25:27,605 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:25:27,606 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:25:27,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:25:27,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 43 [2022-11-16 20:25:27,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760817250] [2022-11-16 20:25:27,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:25:27,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-16 20:25:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:25:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-16 20:25:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1493, Unknown=12, NotChecked=332, Total=2070 [2022-11-16 20:25:27,612 INFO L87 Difference]: Start difference. First operand 324 states and 372 transitions. Second operand has 44 states, 39 states have (on average 3.230769230769231) internal successors, (126), 39 states have internal predecessors, (126), 12 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-16 20:26:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:26:25,983 INFO L93 Difference]: Finished difference Result 333 states and 383 transitions. [2022-11-16 20:26:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 20:26:25,984 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 3.230769230769231) internal successors, (126), 39 states have internal predecessors, (126), 12 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) Word has length 124 [2022-11-16 20:26:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:26:25,985 INFO L225 Difference]: With dead ends: 333 [2022-11-16 20:26:25,986 INFO L226 Difference]: Without dead ends: 333 [2022-11-16 20:26:25,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=404, Invalid=2780, Unknown=24, NotChecked=452, Total=3660 [2022-11-16 20:26:25,987 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 250 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2078 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:26:25,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1079 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1545 Invalid, 0 Unknown, 2078 Unchecked, 2.4s Time] [2022-11-16 20:26:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-16 20:26:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 324. [2022-11-16 20:26:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 282 states have internal predecessors, (305), 33 states have call successors, (33), 16 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 19 states have call successors, (31) [2022-11-16 20:26:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 369 transitions. [2022-11-16 20:26:25,997 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 369 transitions. Word has length 124 [2022-11-16 20:26:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:26:25,997 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 369 transitions. [2022-11-16 20:26:25,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 3.230769230769231) internal successors, (126), 39 states have internal predecessors, (126), 12 states have call successors, (17), 3 states have call predecessors, (17), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-16 20:26:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 369 transitions. [2022-11-16 20:26:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-16 20:26:25,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:26:25,999 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:26:26,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 20:26:26,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-16 20:26:26,209 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting dll_insert_masterErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:26:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:26:26,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1607248884, now seen corresponding path program 1 times [2022-11-16 20:26:26,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:26:26,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759543763] [2022-11-16 20:26:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:26:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:26:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:26:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-16 20:26:29,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:26:29,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759543763] [2022-11-16 20:26:29,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759543763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:26:29,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956429348] [2022-11-16 20:26:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:26:29,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:26:29,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:26:29,469 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:26:29,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 20:26:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:26:30,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 20:26:30,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:26:30,256 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:26:30,298 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_7047 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7047))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:26:34,406 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7048 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7048))))) is different from true [2022-11-16 20:26:42,322 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7049 Int)) (= |c_#valid| (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7049))))) is different from true [2022-11-16 20:26:52,532 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7050 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7050))) is different from true [2022-11-16 20:26:52,539 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7050 Int)) (= |c_#valid| (store |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| v_ArrVal_7050))) is different from true [2022-11-16 20:27:09,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:09,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:09,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:27:09,467 INFO L321 Elim1Store]: treesize reduction 164, result has 28.1 percent of original size [2022-11-16 20:27:09,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 75 [2022-11-16 20:27:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 51 not checked. [2022-11-16 20:27:09,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:27:09,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956429348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:09,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350535731] [2022-11-16 20:27:09,909 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-16 20:27:09,909 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:27:09,910 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:27:09,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:27:09,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 28 [2022-11-16 20:27:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316437011] [2022-11-16 20:27:09,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:27:09,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 20:27:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:27:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 20:27:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=503, Unknown=23, NotChecked=250, Total=870 [2022-11-16 20:27:09,912 INFO L87 Difference]: Start difference. First operand 324 states and 369 transitions. Second operand has 29 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 13 states have call successors, (19), 4 states have call predecessors, (19), 8 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-16 20:27:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:27:33,489 INFO L93 Difference]: Finished difference Result 340 states and 387 transitions. [2022-11-16 20:27:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 20:27:33,490 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 13 states have call successors, (19), 4 states have call predecessors, (19), 8 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) Word has length 125 [2022-11-16 20:27:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:27:33,491 INFO L225 Difference]: With dead ends: 340 [2022-11-16 20:27:33,492 INFO L226 Difference]: Without dead ends: 340 [2022-11-16 20:27:33,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 139 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 60.4s TimeCoverageRelationStatistics Valid=218, Invalid=1492, Unknown=32, NotChecked=420, Total=2162 [2022-11-16 20:27:33,493 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 151 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 3975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2274 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 20:27:33,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1728 Invalid, 3975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1660 Invalid, 0 Unknown, 2274 Unchecked, 2.7s Time] [2022-11-16 20:27:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-16 20:27:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 325. [2022-11-16 20:27:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 198 states have (on average 1.5555555555555556) internal successors, (308), 284 states have internal predecessors, (308), 33 states have call successors, (33), 16 states have call predecessors, (33), 21 states have return successors, (31), 27 states have call predecessors, (31), 19 states have call successors, (31) [2022-11-16 20:27:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 372 transitions. [2022-11-16 20:27:33,502 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 372 transitions. Word has length 125 [2022-11-16 20:27:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:27:33,503 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 372 transitions. [2022-11-16 20:27:33,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 13 states have call successors, (19), 4 states have call predecessors, (19), 8 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-16 20:27:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 372 transitions. [2022-11-16 20:27:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-16 20:27:33,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:27:33,505 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:27:33,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-16 20:27:33,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-16 20:27:33,715 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:27:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:27:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1607248883, now seen corresponding path program 2 times [2022-11-16 20:27:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:27:33,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022596093] [2022-11-16 20:27:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:27:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:27:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:27:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 134 proven. 75 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 20:27:41,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:27:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022596093] [2022-11-16 20:27:41,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022596093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:27:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159258662] [2022-11-16 20:27:41,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:27:41,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:27:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:27:41,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:27:41,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 20:28:26,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 20:28:26,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:28:26,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 20:28:26,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:28:26,925 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:28:26,929 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:28:27,415 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_7626 Int)) (= |c_#length| (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7626))) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:28:35,719 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_7627 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7627) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:28:50,128 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7628 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7628) |c_#length|)))) is different from true [2022-11-16 20:29:06,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:06,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:06,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:06,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:06,996 INFO L321 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-11-16 20:29:06,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 70 [2022-11-16 20:29:07,043 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-16 20:29:07,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 34 [2022-11-16 20:29:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 51 not checked. [2022-11-16 20:29:07,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:29:13,877 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 20:29:13,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159258662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:13,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1673035861] [2022-11-16 20:29:13,881 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-16 20:29:13,881 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:29:13,882 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-16 20:29:13,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:29:13,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 19] total 50 [2022-11-16 20:29:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661260269] [2022-11-16 20:29:13,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:29:13,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 20:29:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:29:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 20:29:13,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2137, Unknown=24, NotChecked=288, Total=2652 [2022-11-16 20:29:13,888 INFO L87 Difference]: Start difference. First operand 325 states and 372 transitions. Second operand has 51 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 44 states have internal predecessors, (145), 16 states have call successors, (23), 8 states have call predecessors, (23), 11 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-16 20:30:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:30:38,804 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2022-11-16 20:30:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 20:30:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 44 states have internal predecessors, (145), 16 states have call successors, (23), 8 states have call predecessors, (23), 11 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) Word has length 125 [2022-11-16 20:30:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:30:38,807 INFO L225 Difference]: With dead ends: 328 [2022-11-16 20:30:38,807 INFO L226 Difference]: Without dead ends: 328 [2022-11-16 20:30:38,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 128.5s TimeCoverageRelationStatistics Valid=543, Invalid=5573, Unknown=58, NotChecked=468, Total=6642 [2022-11-16 20:30:38,809 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 194 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 4732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1563 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:30:38,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 2539 Invalid, 4732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3105 Invalid, 0 Unknown, 1563 Unchecked, 5.1s Time] [2022-11-16 20:30:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-16 20:30:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 317. [2022-11-16 20:30:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 192 states have (on average 1.5625) internal successors, (300), 279 states have internal predecessors, (300), 33 states have call successors, (33), 16 states have call predecessors, (33), 19 states have return successors, (27), 24 states have call predecessors, (27), 19 states have call successors, (27) [2022-11-16 20:30:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 360 transitions. [2022-11-16 20:30:38,820 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 360 transitions. Word has length 125 [2022-11-16 20:30:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:30:38,821 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 360 transitions. [2022-11-16 20:30:38,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 44 states have internal predecessors, (145), 16 states have call successors, (23), 8 states have call predecessors, (23), 11 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-16 20:30:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 360 transitions. [2022-11-16 20:30:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 20:30:38,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:30:38,823 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-11-16 20:30:38,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 20:30:39,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:39,038 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting dll_insert_masterErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [dll_insert_masterErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, dll_insert_masterErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 95 more)] === [2022-11-16 20:30:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:30:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1767470999, now seen corresponding path program 2 times [2022-11-16 20:30:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:30:39,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177180100] [2022-11-16 20:30:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:30:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:30:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:30:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:30:47,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:30:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177180100] [2022-11-16 20:30:47,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177180100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:30:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079107369] [2022-11-16 20:30:47,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:30:47,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:47,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:30:47,073 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:30:47,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4b5bec5-dea8-4461-a215-a4c33cf72a20/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 20:30:53,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 20:30:53,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:30:53,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 20:30:53,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:30:53,897 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 20:30:54,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:54,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 20:30:54,506 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:30:54,510 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:30:54,647 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:30:54,716 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_7998 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7998) |c_#length|)))) is different from true [2022-11-16 20:30:56,922 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:30:56,935 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_7999 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_7999) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:30:59,311 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:30:59,321 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_8000 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_8000) |c_#length|)) (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 20:31:05,695 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2022-11-16 20:31:05,706 WARN L855 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_8001 Int)) (= (store |c_old(#length)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_8001) |c_#length|)))) is different from true