./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS --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 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb --- 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-8393723 [2022-11-19 08:13:37,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:13:37,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:13:37,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:13:37,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:13:37,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:13:37,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:13:37,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:13:37,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:13:37,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:13:37,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:13:37,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:13:37,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:13:37,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:13:37,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:13:37,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:13:37,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:13:37,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:13:37,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:13:37,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:13:37,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:13:37,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:13:37,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:13:37,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:13:37,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:13:37,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:13:37,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:13:37,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:13:37,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:13:37,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:13:37,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:13:37,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:13:37,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:13:37,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:13:37,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:13:37,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:13:37,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:13:37,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:13:37,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:13:37,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:13:37,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:13:37,267 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:13:37,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:13:37,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:13:37,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:13:37,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:13:37,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:13:37,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:13:37,321 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:13:37,321 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:13:37,321 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:13:37,322 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:13:37,323 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:13:37,323 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:13:37,323 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:13:37,323 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:13:37,324 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:13:37,324 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:13:37,324 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:13:37,324 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:13:37,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:13:37,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:13:37,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:13:37,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:13:37,326 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:13:37,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:13:37,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:13:37,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:13:37,327 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:13:37,327 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:13:37,328 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:13:37,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:13:37,328 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:13:37,328 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:13:37,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:13:37,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:13:37,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:13:37,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:13:37,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:13:37,337 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:13:37,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:13:37,337 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:13:37,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:13:37,338 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:13:37,338 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_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/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_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS 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 -> 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb [2022-11-19 08:13:37,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:13:37,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:13:37,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:13:37,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:13:37,628 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:13:37,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2022-11-19 08:13:37,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/data/af84dc97f/5a5e7aa4e55e454bb3611681e547f12e/FLAGfcc77ed87 [2022-11-19 08:13:38,364 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:13:38,364 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2022-11-19 08:13:38,379 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/data/af84dc97f/5a5e7aa4e55e454bb3611681e547f12e/FLAGfcc77ed87 [2022-11-19 08:13:38,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/data/af84dc97f/5a5e7aa4e55e454bb3611681e547f12e [2022-11-19 08:13:38,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:13:38,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:13:38,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:13:38,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:13:38,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:13:38,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:13:38" (1/1) ... [2022-11-19 08:13:38,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6f615a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:38, skipping insertion in model container [2022-11-19 08:13:38,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:13:38" (1/1) ... [2022-11-19 08:13:38,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:13:38,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:13:39,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:13:39,398 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:13:39,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:13:39,518 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:13:39,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39 WrapperNode [2022-11-19 08:13:39,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:13:39,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:13:39,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:13:39,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:13:39,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,571 INFO L138 Inliner]: procedures = 370, calls = 29, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 114 [2022-11-19 08:13:39,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:13:39,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:13:39,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:13:39,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:13:39,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:13:39,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:13:39,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:13:39,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:13:39,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (1/1) ... [2022-11-19 08:13:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:13:39,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:39,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:13:39,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:13:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:13:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:13:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:13:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:13:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:13:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-19 08:13:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:13:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:13:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:13:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-19 08:13:39,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-19 08:13:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:13:39,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:13:39,689 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:13:39,894 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:13:39,897 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:13:40,360 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:13:40,370 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:13:40,371 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 08:13:40,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:13:40 BoogieIcfgContainer [2022-11-19 08:13:40,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:13:40,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:13:40,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:13:40,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:13:40,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:13:38" (1/3) ... [2022-11-19 08:13:40,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27aa02c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:13:40, skipping insertion in model container [2022-11-19 08:13:40,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:13:39" (2/3) ... [2022-11-19 08:13:40,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27aa02c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:13:40, skipping insertion in model container [2022-11-19 08:13:40,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:13:40" (3/3) ... [2022-11-19 08:13:40,396 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2022-11-19 08:13:40,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:13:40,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-19 08:13:40,420 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:13:40,562 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:13:40,619 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:13:40,641 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 185 transitions, 375 flow [2022-11-19 08:13:40,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 185 transitions, 375 flow [2022-11-19 08:13:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 185 transitions, 375 flow [2022-11-19 08:13:40,736 INFO L130 PetriNetUnfolder]: 4/184 cut-off events. [2022-11-19 08:13:40,737 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:13:40,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 184 events. 4/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-19 08:13:40,745 INFO L119 LiptonReduction]: Number of co-enabled transitions 3136 [2022-11-19 08:14:31,772 WARN L233 SmtUtils]: Spent 11.45s on a formula simplification. DAG size of input: 259 DAG size of output: 246 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-19 08:14:36,996 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-19 08:14:53,437 WARN L233 SmtUtils]: Spent 16.44s on a formula simplification. DAG size of input: 268 DAG size of output: 255 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-19 08:14:59,298 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 236 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-19 08:14:59,463 INFO L134 LiptonReduction]: Checked pairs total: 11772 [2022-11-19 08:14:59,463 INFO L136 LiptonReduction]: Total number of compositions: 248 [2022-11-19 08:14:59,471 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 61 transitions, 127 flow [2022-11-19 08:14:59,504 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 371 states, 248 states have (on average 2.75) internal successors, (682), 370 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:59,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:14:59,527 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;@6e352683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:14:59,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-19 08:14:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 248 states have (on average 2.75) internal successors, (682), 370 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 08:14:59,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:59,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 08:14:59,537 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:14:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash 21628, now seen corresponding path program 1 times [2022-11-19 08:14:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:59,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783107734] [2022-11-19 08:14:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:59,873 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-19 08:14:59,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:59,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783107734] [2022-11-19 08:14:59,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783107734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:59,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:59,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:14:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120345886] [2022-11-19 08:14:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:59,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:14:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:14:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:14:59,916 INFO L87 Difference]: Start difference. First operand has 371 states, 248 states have (on average 2.75) internal successors, (682), 370 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:00,188 INFO L93 Difference]: Finished difference Result 322 states and 603 transitions. [2022-11-19 08:15:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:15:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-19 08:15:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:00,214 INFO L225 Difference]: With dead ends: 322 [2022-11-19 08:15:00,215 INFO L226 Difference]: Without dead ends: 322 [2022-11-19 08:15:00,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 08:15:00,225 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:00,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-19 08:15:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-19 08:15:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 233 states have (on average 2.587982832618026) internal successors, (603), 321 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 603 transitions. [2022-11-19 08:15:00,299 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 603 transitions. Word has length 2 [2022-11-19 08:15:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:00,300 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 603 transitions. [2022-11-19 08:15:00,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 603 transitions. [2022-11-19 08:15:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:15:00,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:00,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:15:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:15:00,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 669125, now seen corresponding path program 1 times [2022-11-19 08:15:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:00,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774678107] [2022-11-19 08:15:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:00,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774678107] [2022-11-19 08:15:00,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774678107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:00,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081023911] [2022-11-19 08:15:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:00,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:00,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:00,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:00,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:15:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:00,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:15:00,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:00,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:00,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081023911] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:00,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [730787446] [2022-11-19 08:15:00,711 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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-19 08:15:00,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:15:00,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-19 08:15:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108719155] [2022-11-19 08:15:00,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:15:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:15:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:15:00,724 INFO L87 Difference]: Start difference. First operand 322 states and 603 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:01,285 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2022-11-19 08:15:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:15:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:15:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:01,288 INFO L225 Difference]: With dead ends: 325 [2022-11-19 08:15:01,288 INFO L226 Difference]: Without dead ends: 325 [2022-11-19 08:15:01,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:15:01,290 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:01,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:15:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-19 08:15:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-19 08:15:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 236 states have (on average 2.5677966101694913) internal successors, (606), 324 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 606 transitions. [2022-11-19 08:15:01,306 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 606 transitions. Word has length 3 [2022-11-19 08:15:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:01,306 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 606 transitions. [2022-11-19 08:15:01,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 606 transitions. [2022-11-19 08:15:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:15:01,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:01,308 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-19 08:15:01,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:01,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:01,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1542267204, now seen corresponding path program 2 times [2022-11-19 08:15:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:01,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877522489] [2022-11-19 08:15:01,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:01,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:01,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877522489] [2022-11-19 08:15:01,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877522489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:01,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674928491] [2022-11-19 08:15:01,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:15:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:01,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:01,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:15:01,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:15:01,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:01,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 08:15:01,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 08:15:01,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:15:01,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674928491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:01,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:15:01,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-19 08:15:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788703233] [2022-11-19 08:15:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:01,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:15:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:15:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:15:01,974 INFO L87 Difference]: Start difference. First operand 325 states and 606 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:02,138 INFO L93 Difference]: Finished difference Result 292 states and 543 transitions. [2022-11-19 08:15:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:15:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 08:15:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:02,140 INFO L225 Difference]: With dead ends: 292 [2022-11-19 08:15:02,140 INFO L226 Difference]: Without dead ends: 292 [2022-11-19 08:15:02,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:15:02,141 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:02,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-19 08:15:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-19 08:15:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 216 states have (on average 2.513888888888889) internal successors, (543), 291 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 543 transitions. [2022-11-19 08:15:02,175 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 543 transitions. Word has length 6 [2022-11-19 08:15:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:02,175 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 543 transitions. [2022-11-19 08:15:02,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 543 transitions. [2022-11-19 08:15:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:15:02,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:02,176 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-19 08:15:02,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:02,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-19 08:15:02,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1878875245, now seen corresponding path program 1 times [2022-11-19 08:15:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:02,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379114799] [2022-11-19 08:15:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:02,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379114799] [2022-11-19 08:15:02,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379114799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169573206] [2022-11-19 08:15:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:02,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:02,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:15:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:02,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:15:02,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:02,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:15:02,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169573206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:02,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [542844654] [2022-11-19 08:15:02,844 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) 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-19 08:15:02,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:15:02,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-19 08:15:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613572134] [2022-11-19 08:15:02,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:02,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 08:15:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 08:15:02,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:15:02,858 INFO L87 Difference]: Start difference. First operand 292 states and 543 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:03,227 INFO L93 Difference]: Finished difference Result 298 states and 549 transitions. [2022-11-19 08:15:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:15:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 08:15:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:03,229 INFO L225 Difference]: With dead ends: 298 [2022-11-19 08:15:03,229 INFO L226 Difference]: Without dead ends: 298 [2022-11-19 08:15:03,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-19 08:15:03,230 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:03,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:15:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-19 08:15:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-11-19 08:15:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 222 states have (on average 2.472972972972973) internal successors, (549), 297 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 549 transitions. [2022-11-19 08:15:03,242 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 549 transitions. Word has length 9 [2022-11-19 08:15:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:03,242 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 549 transitions. [2022-11-19 08:15:03,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 549 transitions. [2022-11-19 08:15:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:15:03,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:03,244 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-19 08:15:03,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:03,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:03,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1494985997, now seen corresponding path program 2 times [2022-11-19 08:15:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89597874] [2022-11-19 08:15:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:06,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:06,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89597874] [2022-11-19 08:15:06,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89597874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:06,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:06,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:15:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669978429] [2022-11-19 08:15:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:06,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:15:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:15:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:15:06,167 INFO L87 Difference]: Start difference. First operand 298 states and 549 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:06,353 INFO L93 Difference]: Finished difference Result 294 states and 540 transitions. [2022-11-19 08:15:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:15:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 08:15:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:06,355 INFO L225 Difference]: With dead ends: 294 [2022-11-19 08:15:06,355 INFO L226 Difference]: Without dead ends: 294 [2022-11-19 08:15:06,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-19 08:15:06,356 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:06,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-19 08:15:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-11-19 08:15:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 219 states have (on average 2.4657534246575343) internal successors, (540), 293 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 540 transitions. [2022-11-19 08:15:06,365 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 540 transitions. Word has length 15 [2022-11-19 08:15:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:06,366 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 540 transitions. [2022-11-19 08:15:06,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 540 transitions. [2022-11-19 08:15:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:15:06,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:06,367 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-11-19 08:15:06,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:15:06,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1494985758, now seen corresponding path program 1 times [2022-11-19 08:15:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:06,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766685170] [2022-11-19 08:15:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:06,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:06,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766685170] [2022-11-19 08:15:06,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766685170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:06,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:06,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:15:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140082567] [2022-11-19 08:15:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:15:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:15:06,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:15:06,465 INFO L87 Difference]: Start difference. First operand 294 states and 540 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:06,670 INFO L93 Difference]: Finished difference Result 479 states and 881 transitions. [2022-11-19 08:15:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:15:06,670 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 08:15:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:06,672 INFO L225 Difference]: With dead ends: 479 [2022-11-19 08:15:06,673 INFO L226 Difference]: Without dead ends: 479 [2022-11-19 08:15:06,673 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-19 08:15:06,673 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:06,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-19 08:15:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 292. [2022-11-19 08:15:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 217 states have (on average 2.4700460829493087) internal successors, (536), 291 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 536 transitions. [2022-11-19 08:15:06,684 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 536 transitions. Word has length 15 [2022-11-19 08:15:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:06,685 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 536 transitions. [2022-11-19 08:15:06,685 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 536 transitions. [2022-11-19 08:15:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:15:06,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:06,686 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:06,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:15:06,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -900081219, now seen corresponding path program 1 times [2022-11-19 08:15:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:06,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121180801] [2022-11-19 08:15:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:10,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121180801] [2022-11-19 08:15:10,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121180801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:10,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:10,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:15:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698466445] [2022-11-19 08:15:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:10,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:15:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:15:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:15:10,487 INFO L87 Difference]: Start difference. First operand 292 states and 536 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:10,788 INFO L93 Difference]: Finished difference Result 288 states and 527 transitions. [2022-11-19 08:15:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:15:10,789 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:15:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:10,790 INFO L225 Difference]: With dead ends: 288 [2022-11-19 08:15:10,790 INFO L226 Difference]: Without dead ends: 288 [2022-11-19 08:15:10,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:15:10,791 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:10,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:15:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-19 08:15:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-19 08:15:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 214 states have (on average 2.4626168224299065) internal successors, (527), 287 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 527 transitions. [2022-11-19 08:15:10,803 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 527 transitions. Word has length 16 [2022-11-19 08:15:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:10,804 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 527 transitions. [2022-11-19 08:15:10,804 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 527 transitions. [2022-11-19 08:15:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:15:10,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:10,805 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:10,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:15:10,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash -900081553, now seen corresponding path program 1 times [2022-11-19 08:15:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761048864] [2022-11-19 08:15:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:12,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:12,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761048864] [2022-11-19 08:15:12,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761048864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:12,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:12,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:15:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008675439] [2022-11-19 08:15:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:15:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:15:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:15:12,751 INFO L87 Difference]: Start difference. First operand 288 states and 527 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:13,111 INFO L93 Difference]: Finished difference Result 286 states and 523 transitions. [2022-11-19 08:15:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:15:13,111 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:15:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:13,113 INFO L225 Difference]: With dead ends: 286 [2022-11-19 08:15:13,113 INFO L226 Difference]: Without dead ends: 286 [2022-11-19 08:15:13,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:15:13,114 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:13,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 7 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:15:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-19 08:15:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-19 08:15:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 212 states have (on average 2.4669811320754715) internal successors, (523), 285 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 523 transitions. [2022-11-19 08:15:13,123 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 523 transitions. Word has length 16 [2022-11-19 08:15:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:13,124 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 523 transitions. [2022-11-19 08:15:13,124 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 523 transitions. [2022-11-19 08:15:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:15:13,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:13,125 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:13,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:15:13,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash -900023577, now seen corresponding path program 1 times [2022-11-19 08:15:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:13,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243227400] [2022-11-19 08:15:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:13,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243227400] [2022-11-19 08:15:13,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243227400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:13,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:13,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:15:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240514048] [2022-11-19 08:15:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:13,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:15:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:13,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:15:13,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:15:13,275 INFO L87 Difference]: Start difference. First operand 286 states and 523 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:13,472 INFO L93 Difference]: Finished difference Result 271 states and 496 transitions. [2022-11-19 08:15:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:15:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:15:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:13,474 INFO L225 Difference]: With dead ends: 271 [2022-11-19 08:15:13,475 INFO L226 Difference]: Without dead ends: 271 [2022-11-19 08:15:13,475 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-19 08:15:13,475 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:13,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-19 08:15:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-11-19 08:15:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 204 states have (on average 2.4313725490196076) internal successors, (496), 270 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 496 transitions. [2022-11-19 08:15:13,485 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 496 transitions. Word has length 16 [2022-11-19 08:15:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:13,486 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 496 transitions. [2022-11-19 08:15:13,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 496 transitions. [2022-11-19 08:15:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:15:13,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:13,487 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:13,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:15:13,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -900023640, now seen corresponding path program 1 times [2022-11-19 08:15:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:13,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591507438] [2022-11-19 08:15:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:13,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:13,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591507438] [2022-11-19 08:15:13,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591507438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:13,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:15:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955804211] [2022-11-19 08:15:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:13,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:15:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:13,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:15:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:15:13,585 INFO L87 Difference]: Start difference. First operand 271 states and 496 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:13,823 INFO L93 Difference]: Finished difference Result 307 states and 549 transitions. [2022-11-19 08:15:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:15:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 08:15:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:13,825 INFO L225 Difference]: With dead ends: 307 [2022-11-19 08:15:13,825 INFO L226 Difference]: Without dead ends: 307 [2022-11-19 08:15:13,825 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-19 08:15:13,826 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:13,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-19 08:15:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2022-11-19 08:15:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 200 states have (on average 2.43) internal successors, (486), 258 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 486 transitions. [2022-11-19 08:15:13,844 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 486 transitions. Word has length 16 [2022-11-19 08:15:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:13,845 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 486 transitions. [2022-11-19 08:15:13,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 486 transitions. [2022-11-19 08:15:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:15:13,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:13,847 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:13,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:15:13,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2132307920, now seen corresponding path program 1 times [2022-11-19 08:15:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:13,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254704876] [2022-11-19 08:15:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:14,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254704876] [2022-11-19 08:15:14,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254704876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:14,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:14,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:15:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235711136] [2022-11-19 08:15:14,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:14,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:15:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:15:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:15:14,203 INFO L87 Difference]: Start difference. First operand 259 states and 486 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:14,469 INFO L93 Difference]: Finished difference Result 333 states and 595 transitions. [2022-11-19 08:15:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:15:14,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:15:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:14,472 INFO L225 Difference]: With dead ends: 333 [2022-11-19 08:15:14,472 INFO L226 Difference]: Without dead ends: 333 [2022-11-19 08:15:14,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:15:14,473 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 100 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:14,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 6 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:15:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-19 08:15:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 245. [2022-11-19 08:15:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 2.365979381443299) internal successors, (459), 244 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 459 transitions. [2022-11-19 08:15:14,481 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 459 transitions. Word has length 17 [2022-11-19 08:15:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:14,482 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 459 transitions. [2022-11-19 08:15:14,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 459 transitions. [2022-11-19 08:15:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:15:14,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:14,483 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:15:14,483 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2132716696, now seen corresponding path program 1 times [2022-11-19 08:15:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:14,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689253414] [2022-11-19 08:15:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:16,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:16,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689253414] [2022-11-19 08:15:16,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689253414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:16,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:16,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:15:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902886420] [2022-11-19 08:15:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:16,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:15:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:15:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:15:16,975 INFO L87 Difference]: Start difference. First operand 245 states and 459 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:17,600 INFO L93 Difference]: Finished difference Result 337 states and 621 transitions. [2022-11-19 08:15:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:15:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:15:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:17,602 INFO L225 Difference]: With dead ends: 337 [2022-11-19 08:15:17,603 INFO L226 Difference]: Without dead ends: 337 [2022-11-19 08:15:17,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:15:17,603 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:17,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 17 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:15:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-19 08:15:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 255. [2022-11-19 08:15:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 204 states have (on average 2.343137254901961) internal successors, (478), 254 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 478 transitions. [2022-11-19 08:15:17,612 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 478 transitions. Word has length 17 [2022-11-19 08:15:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:17,612 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 478 transitions. [2022-11-19 08:15:17,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 478 transitions. [2022-11-19 08:15:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:15:17,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:17,614 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:17,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:15:17,614 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2130928469, now seen corresponding path program 1 times [2022-11-19 08:15:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:17,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597769217] [2022-11-19 08:15:17,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-19 08:15:18,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597769217] [2022-11-19 08:15:18,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597769217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:15:18,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:15:18,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:15:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233248603] [2022-11-19 08:15:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:15:18,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:15:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:15:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:15:18,314 INFO L87 Difference]: Start difference. First operand 255 states and 478 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:18,637 INFO L93 Difference]: Finished difference Result 296 states and 538 transitions. [2022-11-19 08:15:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:15:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 08:15:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:18,640 INFO L225 Difference]: With dead ends: 296 [2022-11-19 08:15:18,640 INFO L226 Difference]: Without dead ends: 296 [2022-11-19 08:15:18,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:15:18,641 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 83 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:18,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 8 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:15:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-19 08:15:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 248. [2022-11-19 08:15:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 201 states have (on average 2.343283582089552) internal successors, (471), 247 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 471 transitions. [2022-11-19 08:15:18,649 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 471 transitions. Word has length 17 [2022-11-19 08:15:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:18,650 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 471 transitions. [2022-11-19 08:15:18,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:15:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 471 transitions. [2022-11-19 08:15:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:15:18,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:18,651 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:18,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 08:15:18,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-19 08:15:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2130928452, now seen corresponding path program 1 times [2022-11-19 08:15:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:18,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248427585] [2022-11-19 08:15:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:15:18,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:15:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:15:18,793 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:15:18,793 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:15:18,794 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2022-11-19 08:15:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2022-11-19 08:15:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2022-11-19 08:15:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2022-11-19 08:15:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2022-11-19 08:15:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2022-11-19 08:15:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2022-11-19 08:15:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2022-11-19 08:15:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2022-11-19 08:15:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2022-11-19 08:15:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2022-11-19 08:15:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2022-11-19 08:15:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2022-11-19 08:15:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2022-11-19 08:15:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2022-11-19 08:15:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2022-11-19 08:15:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2022-11-19 08:15:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2022-11-19 08:15:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2022-11-19 08:15:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2022-11-19 08:15:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2022-11-19 08:15:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2022-11-19 08:15:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2022-11-19 08:15:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2022-11-19 08:15:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2022-11-19 08:15:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2022-11-19 08:15:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2022-11-19 08:15:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2022-11-19 08:15:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2022-11-19 08:15:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2022-11-19 08:15:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2022-11-19 08:15:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2022-11-19 08:15:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2022-11-19 08:15:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2022-11-19 08:15:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2022-11-19 08:15:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2022-11-19 08:15:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2022-11-19 08:15:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2022-11-19 08:15:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2022-11-19 08:15:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2022-11-19 08:15:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2022-11-19 08:15:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2022-11-19 08:15:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2022-11-19 08:15:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2022-11-19 08:15:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2022-11-19 08:15:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2022-11-19 08:15:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2022-11-19 08:15:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2022-11-19 08:15:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2022-11-19 08:15:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2022-11-19 08:15:18,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2022-11-19 08:15:18,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2022-11-19 08:15:18,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:15:18,817 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:18,825 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:15:18,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:15:18,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:15:18 BasicIcfg [2022-11-19 08:15:18,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:15:18,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:15:18,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:15:18,887 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:15:18,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:13:40" (3/4) ... [2022-11-19 08:15:18,889 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 08:15:18,967 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 08:15:18,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:15:18,967 INFO L158 Benchmark]: Toolchain (without parser) took 100346.97ms. Allocated memory was 107.0MB in the beginning and 461.4MB in the end (delta: 354.4MB). Free memory was 81.8MB in the beginning and 263.8MB in the end (delta: -182.0MB). Peak memory consumption was 172.3MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,968 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:15:18,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 897.65ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 52.6MB in the end (delta: 29.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.97ms. Allocated memory is still 107.0MB. Free memory was 52.6MB in the beginning and 49.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,968 INFO L158 Benchmark]: Boogie Preprocessor took 35.63ms. Allocated memory is still 107.0MB. Free memory was 49.5MB in the beginning and 47.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,969 INFO L158 Benchmark]: RCFGBuilder took 765.29ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 47.4MB in the beginning and 89.2MB in the end (delta: -41.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,969 INFO L158 Benchmark]: TraceAbstraction took 98493.48ms. Allocated memory was 130.0MB in the beginning and 461.4MB in the end (delta: 331.4MB). Free memory was 88.4MB in the beginning and 268.0MB in the end (delta: -179.5MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,969 INFO L158 Benchmark]: Witness Printer took 83.96ms. Allocated memory is still 461.4MB. Free memory was 268.0MB in the beginning and 263.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 08:15:18,972 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 897.65ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 52.6MB in the end (delta: 29.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.97ms. Allocated memory is still 107.0MB. Free memory was 52.6MB in the beginning and 49.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.63ms. Allocated memory is still 107.0MB. Free memory was 49.5MB in the beginning and 47.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 765.29ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 47.4MB in the beginning and 89.2MB in the end (delta: -41.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 98493.48ms. Allocated memory was 130.0MB in the beginning and 461.4MB in the end (delta: 331.4MB). Free memory was 88.4MB in the beginning and 268.0MB in the end (delta: -179.5MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. * Witness Printer took 83.96ms. Allocated memory is still 461.4MB. Free memory was 268.0MB in the beginning and 263.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.8s, 185 PlacesBefore, 64 PlacesAfterwards, 185 TransitionsBefore, 61 TransitionsAfterwards, 3136 CoEnabledTransitionPairs, 8 FixpointIterations, 149 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 248 TotalNumberOfCompositions, 11772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5320, independent: 4869, independent conditional: 0, independent unconditional: 4869, dependent: 451, dependent conditional: 0, dependent unconditional: 451, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2309, independent: 2220, independent conditional: 0, independent unconditional: 2220, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2309, independent: 2152, independent conditional: 0, independent unconditional: 2152, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 157, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 427, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 333, dependent conditional: 0, dependent unconditional: 333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5320, independent: 2649, independent conditional: 0, independent unconditional: 2649, dependent: 362, dependent conditional: 0, dependent unconditional: 362, unknown: 2309, unknown conditional: 0, unknown unconditional: 2309] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1256] 0 int i = 0; VAL [c={1:0}, i=0] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=1] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=2] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=3] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=4] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=5] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=6] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=7] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=8] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=9] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=10] [L1256] COND FALSE 0 !(i < 10) [L1258] 0 int j = __VERIFIER_nondet_int(); [L1259] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1259] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1260] 0 struct s *p; [L1261] 0 pthread_t t1; [L1262] CALL, EXPR 0 new(1) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1262] RET, EXPR 0 new(1) [L1262] 0 c.slots[j] = new(1) [L1263] CALL, EXPR 0 new(2) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1263] RET, EXPR 0 new(2) [L1263] EXPR 0 c.slots[j] [L1263] CALL 0 list_add(new(2), c.slots[j]) [L1243] EXPR 0 list->next [L1243] 0 struct s *temp = list->next; [L1244] 0 list->next = node [L1245] 0 node->next = temp [L1263] RET 0 list_add(new(2), c.slots[j]) [L1264] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [c={1:0}, i=10, j=8, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={12:0}] [L1248] 1 int i = __VERIFIER_nondet_int(); [L1249] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1249] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1251] CALL, EXPR 1 new(3) [L1237] 1 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=3, \old(x)=2, \result={10:0}, c={1:0}, malloc(sizeof(struct s))={5:0}, p={5:0}, p={10:0}, x=3, x=2] [L1238] 1 p->datum = x VAL [\old(x)=3, \old(x)=2, \result={10:0}, c={1:0}, p={10:0}, p={5:0}, x=2, x=3] [L1239] 1 p->next = ((void *)0) [L1240] 1 return p; [L1251] RET, EXPR 1 new(3) [L1251] EXPR 1 c.slots[i] [L1251] CALL 1 list_add(new(3), c.slots[i]) [L1243] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1264]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 239 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 98.2s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 78.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1395 IncrementalHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 62 mSDtfsCounter, 1395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 453 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 200 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 505/548 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 08:15:19,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb059a0-7220-4491-bf61-2f17c500d5b3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)