./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/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_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/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_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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:12:01,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:12:01,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:12:01,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:12:01,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:12:01,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:12:01,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:12:01,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:12:01,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:12:01,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:12:01,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:12:01,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:12:01,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:12:01,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:12:01,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:12:01,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:12:01,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:12:01,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:12:01,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:12:01,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:12:01,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:12:01,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:12:01,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:12:01,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:12:01,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:12:01,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:12:01,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:12:01,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:12:01,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:12:01,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:12:01,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:12:01,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:12:01,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:12:01,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:12:01,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:12:01,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:12:01,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:12:01,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:12:01,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:12:01,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:12:01,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:12:01,182 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:12:01,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:12:01,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:12:01,210 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:12:01,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:12:01,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:12:01,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:12:01,212 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:12:01,212 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:12:01,212 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:12:01,213 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:12:01,213 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:12:01,213 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:12:01,213 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:12:01,214 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:12:01,214 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:12:01,214 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:12:01,215 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:12:01,215 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:12:01,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:12:01,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:12:01,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:12:01,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:12:01,217 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:12:01,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:12:01,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:12:01,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:12:01,218 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:12:01,219 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:12:01,219 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:12:01,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:12:01,220 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:12:01,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:12:01,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:12:01,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:12:01,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:12:01,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:12:01,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:12:01,222 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:12:01,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:12:01,223 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:12:01,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:12:01,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:12:01,223 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_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/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_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-19 08:12:01,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:12:01,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:12:01,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:12:01,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:12:01,641 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:12:01,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-19 08:12:01,747 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/data/cbfba0a02/92d048d0325a479384f7d83170d1cf87/FLAGa2c9b7f3b [2022-11-19 08:12:02,520 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:12:02,521 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-19 08:12:02,548 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/data/cbfba0a02/92d048d0325a479384f7d83170d1cf87/FLAGa2c9b7f3b [2022-11-19 08:12:02,732 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/data/cbfba0a02/92d048d0325a479384f7d83170d1cf87 [2022-11-19 08:12:02,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:12:02,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:12:02,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:12:02,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:12:02,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:12:02,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:12:02" (1/1) ... [2022-11-19 08:12:02,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad6aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:02, skipping insertion in model container [2022-11-19 08:12:02,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:12:02" (1/1) ... [2022-11-19 08:12:02,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:12:02,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:12:03,442 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-19 08:12:03,447 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-19 08:12:03,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:12:03,465 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:12:03,519 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-19 08:12:03,523 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-19 08:12:03,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:12:03,594 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:12:03,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03 WrapperNode [2022-11-19 08:12:03,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:12:03,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:12:03,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:12:03,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:12:03,606 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:12:03" (1/1) ... [2022-11-19 08:12:03,626 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:12:03" (1/1) ... [2022-11-19 08:12:03,658 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-19 08:12:03,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:12:03,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:12:03,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:12:03,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:12:03,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:12:03,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:12:03,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:12:03,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:12:03,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (1/1) ... [2022-11-19 08:12:03,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:12:03,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:12:03,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:12:03,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:12:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-19 08:12:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-19 08:12:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-19 08:12:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-19 08:12:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:12:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:12:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:12:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:12:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-19 08:12:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:12:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:12:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:12:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:12:03,815 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:12:03,995 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:12:03,997 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:12:04,656 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:12:04,667 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:12:04,667 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 08:12:04,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:12:04 BoogieIcfgContainer [2022-11-19 08:12:04,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:12:04,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:12:04,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:12:04,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:12:04,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:12:02" (1/3) ... [2022-11-19 08:12:04,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b0730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:12:04, skipping insertion in model container [2022-11-19 08:12:04,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:12:03" (2/3) ... [2022-11-19 08:12:04,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b0730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:12:04, skipping insertion in model container [2022-11-19 08:12:04,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:12:04" (3/3) ... [2022-11-19 08:12:04,720 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-19 08:12:04,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:12:04,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-19 08:12:04,744 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:12:04,959 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-19 08:12:05,002 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:12:05,019 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-19 08:12:05,023 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-19 08:12:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-19 08:12:05,167 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-19 08:12:05,167 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-19 08:12:05,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-19 08:12:05,209 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-19 08:12:33,006 INFO L134 LiptonReduction]: Checked pairs total: 60988 [2022-11-19 08:12:33,006 INFO L136 LiptonReduction]: Total number of compositions: 455 [2022-11-19 08:12:33,016 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-19 08:12:33,304 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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:12:33,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:12:33,334 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;@594af9e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:12:33,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-19 08:12:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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:12:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:12:33,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:33,359 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:12:33,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-19 08:12:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660953454] [2022-11-19 08:12:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:33,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:33,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660953454] [2022-11-19 08:12:33,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660953454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:33,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:33,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:12:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723315283] [2022-11-19 08:12:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:33,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:12:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:12:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:12:33,600 INFO L87 Difference]: Start difference. First operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:12:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:33,878 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-19 08:12:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:12:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-19 08:12:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:33,939 INFO L225 Difference]: With dead ends: 2668 [2022-11-19 08:12:33,939 INFO L226 Difference]: Without dead ends: 2668 [2022-11-19 08:12:33,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:12:33,946 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:33,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-19 08:12:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-19 08:12:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2340 states have (on average 3.2854700854700853) internal successors, (7688), 2667 states have internal predecessors, (7688), 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:12:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-19 08:12:34,149 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-19 08:12:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:34,149 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-19 08:12:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:12:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-19 08:12:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:12:34,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:34,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:12:34,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:12:34,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1276633, now seen corresponding path program 1 times [2022-11-19 08:12:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:34,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319812396] [2022-11-19 08:12:34,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:34,428 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:12:34,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:34,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319812396] [2022-11-19 08:12:34,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319812396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:34,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:34,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:34,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644974915] [2022-11-19 08:12:34,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:34,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:34,443 INFO L87 Difference]: Start difference. First operand 2668 states and 7688 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:12:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:34,613 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-19 08:12:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:34,613 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 3 [2022-11-19 08:12:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:34,635 INFO L225 Difference]: With dead ends: 2618 [2022-11-19 08:12:34,635 INFO L226 Difference]: Without dead ends: 2618 [2022-11-19 08:12:34,636 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:12:34,638 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:34,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-19 08:12:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-19 08:12:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2310 states have (on average 3.2826839826839826) internal successors, (7583), 2617 states have internal predecessors, (7583), 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:12:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-19 08:12:34,843 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-19 08:12:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:34,844 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-19 08:12:34,846 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:12:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-19 08:12:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:12:34,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:34,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:12:34,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:12:34,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:34,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1276634, now seen corresponding path program 1 times [2022-11-19 08:12:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:34,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190558966] [2022-11-19 08:12:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:35,021 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:12:35,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190558966] [2022-11-19 08:12:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190558966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:35,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085248024] [2022-11-19 08:12:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:35,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:35,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:35,026 INFO L87 Difference]: Start difference. First operand 2618 states and 7583 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:12:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:35,182 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-19 08:12:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:35,183 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 3 [2022-11-19 08:12:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:35,203 INFO L225 Difference]: With dead ends: 2568 [2022-11-19 08:12:35,203 INFO L226 Difference]: Without dead ends: 2568 [2022-11-19 08:12:35,204 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:12:35,205 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:35,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-19 08:12:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-19 08:12:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2280 states have (on average 3.2798245614035086) internal successors, (7478), 2567 states have internal predecessors, (7478), 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:12:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-19 08:12:35,305 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-19 08:12:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:35,306 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-19 08:12:35,306 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:12:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-19 08:12:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:12:35,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:35,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:12:35,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:12:35,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811491, now seen corresponding path program 1 times [2022-11-19 08:12:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:35,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350243282] [2022-11-19 08:12:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:35,702 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:12:35,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:35,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350243282] [2022-11-19 08:12:35,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350243282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:35,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:35,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881262075] [2022-11-19 08:12:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:35,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:35,709 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:35,868 INFO L93 Difference]: Finished difference Result 2196 states and 6425 transitions. [2022-11-19 08:12:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-19 08:12:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:35,885 INFO L225 Difference]: With dead ends: 2196 [2022-11-19 08:12:35,885 INFO L226 Difference]: Without dead ends: 2196 [2022-11-19 08:12:35,886 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:12:35,889 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:35,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2022-11-19 08:12:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2022-11-19 08:12:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2007 states have (on average 3.201295465869457) internal successors, (6425), 2195 states have internal predecessors, (6425), 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:12:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 6425 transitions. [2022-11-19 08:12:35,977 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 6425 transitions. Word has length 5 [2022-11-19 08:12:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:35,977 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 6425 transitions. [2022-11-19 08:12:35,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 6425 transitions. [2022-11-19 08:12:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:12:35,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:35,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:12:35,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:12:35,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811492, now seen corresponding path program 1 times [2022-11-19 08:12:35,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:35,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828462983] [2022-11-19 08:12:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:36,155 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:12:36,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828462983] [2022-11-19 08:12:36,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828462983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:36,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:36,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70802294] [2022-11-19 08:12:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:36,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:36,159 INFO L87 Difference]: Start difference. First operand 2196 states and 6425 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:36,289 INFO L93 Difference]: Finished difference Result 1930 states and 5670 transitions. [2022-11-19 08:12:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:36,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-19 08:12:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:36,302 INFO L225 Difference]: With dead ends: 1930 [2022-11-19 08:12:36,302 INFO L226 Difference]: Without dead ends: 1930 [2022-11-19 08:12:36,303 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:12:36,304 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:36,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-11-19 08:12:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2022-11-19 08:12:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1804 states have (on average 3.1430155210643016) internal successors, (5670), 1929 states have internal predecessors, (5670), 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:12:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5670 transitions. [2022-11-19 08:12:36,368 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5670 transitions. Word has length 5 [2022-11-19 08:12:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:36,368 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 5670 transitions. [2022-11-19 08:12:36,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5670 transitions. [2022-11-19 08:12:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:12:36,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:36,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:12:36,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:12:36,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811565, now seen corresponding path program 1 times [2022-11-19 08:12:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:36,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374336641] [2022-11-19 08:12:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:36,680 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:12:36,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:36,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374336641] [2022-11-19 08:12:36,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374336641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:36,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:36,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984455649] [2022-11-19 08:12:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:36,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:36,683 INFO L87 Difference]: Start difference. First operand 1930 states and 5670 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:36,863 INFO L93 Difference]: Finished difference Result 1936 states and 5683 transitions. [2022-11-19 08:12:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-19 08:12:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:36,887 INFO L225 Difference]: With dead ends: 1936 [2022-11-19 08:12:36,887 INFO L226 Difference]: Without dead ends: 1936 [2022-11-19 08:12:36,887 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:12:36,888 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:36,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-11-19 08:12:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1931. [2022-11-19 08:12:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1805 states have (on average 3.1429362880886424) internal successors, (5673), 1930 states have internal predecessors, (5673), 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:12:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5673 transitions. [2022-11-19 08:12:36,961 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 5673 transitions. Word has length 5 [2022-11-19 08:12:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:36,961 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 5673 transitions. [2022-11-19 08:12:36,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 5673 transitions. [2022-11-19 08:12:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:12:36,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:36,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:12:36,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:12:36,963 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1226869626, now seen corresponding path program 1 times [2022-11-19 08:12:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:36,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556272741] [2022-11-19 08:12:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:37,013 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:12:37,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:37,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556272741] [2022-11-19 08:12:37,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556272741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:37,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:37,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601888641] [2022-11-19 08:12:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:37,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:37,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:37,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:37,016 INFO L87 Difference]: Start difference. First operand 1931 states and 5673 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:37,135 INFO L93 Difference]: Finished difference Result 1471 states and 4187 transitions. [2022-11-19 08:12:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-19 08:12:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:37,145 INFO L225 Difference]: With dead ends: 1471 [2022-11-19 08:12:37,146 INFO L226 Difference]: Without dead ends: 1471 [2022-11-19 08:12:37,146 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:12:37,147 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:37,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2022-11-19 08:12:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2022-11-19 08:12:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1387 states have (on average 3.0187454938716654) internal successors, (4187), 1470 states have internal predecessors, (4187), 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:12:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4187 transitions. [2022-11-19 08:12:37,201 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4187 transitions. Word has length 5 [2022-11-19 08:12:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:37,202 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 4187 transitions. [2022-11-19 08:12:37,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:12:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4187 transitions. [2022-11-19 08:12:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:12:37,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:37,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:12:37,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:12:37,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1226869625, now seen corresponding path program 1 times [2022-11-19 08:12:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:37,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671117003] [2022-11-19 08:12:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:37,293 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:12:37,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:37,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671117003] [2022-11-19 08:12:37,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671117003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:37,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:37,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:12:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136394833] [2022-11-19 08:12:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:37,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:12:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:12:37,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:12:37,296 INFO L87 Difference]: Start difference. First operand 1471 states and 4187 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:12:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:37,406 INFO L93 Difference]: Finished difference Result 1011 states and 2701 transitions. [2022-11-19 08:12:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:37,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-19 08:12:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:37,413 INFO L225 Difference]: With dead ends: 1011 [2022-11-19 08:12:37,413 INFO L226 Difference]: Without dead ends: 1011 [2022-11-19 08:12:37,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:12:37,414 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:37,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-19 08:12:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-11-19 08:12:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 969 states have (on average 2.787409700722394) internal successors, (2701), 1010 states have internal predecessors, (2701), 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:12:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-19 08:12:37,474 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-19 08:12:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:37,474 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-19 08:12:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:12:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-19 08:12:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:12:37,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:37,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:12:37,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:12:37,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -623492074, now seen corresponding path program 1 times [2022-11-19 08:12:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900800534] [2022-11-19 08:12:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:38,013 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:12:38,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:38,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900800534] [2022-11-19 08:12:38,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900800534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:38,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:38,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:12:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413757496] [2022-11-19 08:12:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:38,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:12:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:38,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:12:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:12:38,016 INFO L87 Difference]: Start difference. First operand 1011 states and 2701 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:12:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:38,244 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-19 08:12:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:12:38,245 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 6 [2022-11-19 08:12:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:38,251 INFO L225 Difference]: With dead ends: 1286 [2022-11-19 08:12:38,251 INFO L226 Difference]: Without dead ends: 1286 [2022-11-19 08:12:38,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:12:38,252 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:38,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-19 08:12:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-19 08:12:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1052 states have (on average 2.826045627376426) internal successors, (2973), 1093 states have internal predecessors, (2973), 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:12:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-19 08:12:38,316 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-19 08:12:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:38,316 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-19 08:12:38,317 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:12:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-19 08:12:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:12:38,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:38,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:12:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:12:38,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -623548494, now seen corresponding path program 1 times [2022-11-19 08:12:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296116423] [2022-11-19 08:12:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:38,676 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:12:38,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296116423] [2022-11-19 08:12:38,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296116423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:38,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:38,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:12:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125580043] [2022-11-19 08:12:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:38,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:12:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:12:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:12:38,679 INFO L87 Difference]: Start difference. First operand 1094 states and 2973 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:12:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:38,910 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-19 08:12:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:12:38,911 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 6 [2022-11-19 08:12:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:38,917 INFO L225 Difference]: With dead ends: 1280 [2022-11-19 08:12:38,917 INFO L226 Difference]: Without dead ends: 1280 [2022-11-19 08:12:38,918 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:12:38,918 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:38,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 12 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-19 08:12:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-19 08:12:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 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:12:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-19 08:12:38,955 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-19 08:12:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:38,955 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-19 08:12:38,956 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:12:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-19 08:12:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:12:38,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:38,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:38,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:12:38,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1780105148, now seen corresponding path program 1 times [2022-11-19 08:12:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:38,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132612500] [2022-11-19 08:12:38,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:39,031 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:12:39,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:39,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132612500] [2022-11-19 08:12:39,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132612500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:39,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:39,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:12:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823377408] [2022-11-19 08:12:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:39,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:39,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:39,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:39,033 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:12:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:39,149 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-19 08:12:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:39,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:12:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:39,151 INFO L225 Difference]: With dead ends: 434 [2022-11-19 08:12:39,151 INFO L226 Difference]: Without dead ends: 426 [2022-11-19 08:12:39,152 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:12:39,152 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:39,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-19 08:12:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-19 08:12:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 387 states have (on average 2.41343669250646) internal successors, (934), 399 states have internal predecessors, (934), 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:12:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-19 08:12:39,167 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-19 08:12:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:39,167 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-19 08:12:39,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:12:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-19 08:12:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:12:39,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:39,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:39,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:12:39,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1257894729, now seen corresponding path program 1 times [2022-11-19 08:12:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:39,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743410417] [2022-11-19 08:12:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:39,296 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:12:39,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743410417] [2022-11-19 08:12:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743410417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:39,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:39,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:12:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099734980] [2022-11-19 08:12:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:12:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:12:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:12:39,299 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:12:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:39,385 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-19 08:12:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:12:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-11-19 08:12:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:39,388 INFO L225 Difference]: With dead ends: 380 [2022-11-19 08:12:39,388 INFO L226 Difference]: Without dead ends: 380 [2022-11-19 08:12:39,388 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:12:39,389 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:39,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-19 08:12:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-19 08:12:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 2.4054054054054053) internal successors, (890), 379 states have internal predecessors, (890), 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:12:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-19 08:12:39,401 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-19 08:12:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:39,401 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-19 08:12:39,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:12:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-19 08:12:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:12:39,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:39,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:39,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:12:39,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1257894728, now seen corresponding path program 1 times [2022-11-19 08:12:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:39,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275312486] [2022-11-19 08:12:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:39,826 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:12:39,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:39,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275312486] [2022-11-19 08:12:39,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275312486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:39,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:39,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:12:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769819586] [2022-11-19 08:12:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:39,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:12:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:12:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:12:39,829 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:12:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:40,040 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-19 08:12:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:12:40,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-19 08:12:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:40,042 INFO L225 Difference]: With dead ends: 390 [2022-11-19 08:12:40,043 INFO L226 Difference]: Without dead ends: 390 [2022-11-19 08:12:40,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:12:40,044 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:40,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-19 08:12:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-19 08:12:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 2.4010695187165774) internal successors, (898), 383 states have internal predecessors, (898), 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:12:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-19 08:12:40,055 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-19 08:12:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:40,056 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-19 08:12:40,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:12:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-19 08:12:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:12:40,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:40,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 08:12:40,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1098205855, now seen corresponding path program 1 times [2022-11-19 08:12:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:40,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652857085] [2022-11-19 08:12:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:40,310 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:12:40,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:40,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652857085] [2022-11-19 08:12:40,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652857085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:40,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:40,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:12:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967178797] [2022-11-19 08:12:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:12:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:12:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:12:40,313 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:40,502 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-19 08:12:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:12:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-11-19 08:12:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:40,504 INFO L225 Difference]: With dead ends: 475 [2022-11-19 08:12:40,505 INFO L226 Difference]: Without dead ends: 475 [2022-11-19 08:12:40,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:12:40,505 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:40,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 9 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-19 08:12:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-19 08:12:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.372043010752688) internal successors, (1103), 474 states have internal predecessors, (1103), 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:12:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-19 08:12:40,522 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-19 08:12:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:40,522 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-19 08:12:40,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-19 08:12:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:12:40,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:40,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:12:40,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 315359300, now seen corresponding path program 1 times [2022-11-19 08:12:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749579460] [2022-11-19 08:12:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:41,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:41,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749579460] [2022-11-19 08:12:41,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749579460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:41,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:41,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:12:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366481712] [2022-11-19 08:12:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:12:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:41,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:12:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:12:41,471 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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:12:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:41,832 INFO L93 Difference]: Finished difference Result 490 states and 1112 transitions. [2022-11-19 08:12:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:12:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-11-19 08:12:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:41,834 INFO L225 Difference]: With dead ends: 490 [2022-11-19 08:12:41,835 INFO L226 Difference]: Without dead ends: 490 [2022-11-19 08:12:41,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:12:41,836 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:41,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 21 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:12:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-19 08:12:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 464. [2022-11-19 08:12:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 454 states have (on average 2.350220264317181) internal successors, (1067), 463 states have internal predecessors, (1067), 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:12:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1067 transitions. [2022-11-19 08:12:41,850 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1067 transitions. Word has length 13 [2022-11-19 08:12:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:41,851 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1067 transitions. [2022-11-19 08:12:41,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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:12:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1067 transitions. [2022-11-19 08:12:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:12:41,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:41,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:41,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 08:12:41,853 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1993996946, now seen corresponding path program 1 times [2022-11-19 08:12:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:41,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053874199] [2022-11-19 08:12:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:42,977 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:12:42,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:12:42,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053874199] [2022-11-19 08:12:42,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053874199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:12:42,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912622805] [2022-11-19 08:12:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:42,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:12:42,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:12:42,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:12:43,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:12:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:43,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-19 08:12:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:43,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:12:43,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:12:43,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:12:43,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:12:43,403 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:12:43,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:12:43,423 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:12:43,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:12:43,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:12:43,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:12:44,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:12:44,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:12:44,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:12:44,387 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:12:44,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:12:44,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:12:44,458 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:12:44,478 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_500 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-19 08:12:44,513 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_496 Int) (v_ArrVal_500 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_496) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_496 Int) (v_ArrVal_500 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_496) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2022-11-19 08:12:44,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:12:44,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-19 08:12:52,856 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:12:52,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912622805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:12:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159345186] [2022-11-19 08:12:52,866 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:12:52,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:12:52,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-19 08:12:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149652566] [2022-11-19 08:12:52,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:12:52,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 08:12:52,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:12:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 08:12:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=360, Unknown=4, NotChecked=172, Total=650 [2022-11-19 08:12:52,878 INFO L87 Difference]: Start difference. First operand 464 states and 1067 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 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:12:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:54,055 INFO L93 Difference]: Finished difference Result 466 states and 1072 transitions. [2022-11-19 08:12:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 08:12:54,056 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 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 13 [2022-11-19 08:12:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:54,058 INFO L225 Difference]: With dead ends: 466 [2022-11-19 08:12:54,058 INFO L226 Difference]: Without dead ends: 466 [2022-11-19 08:12:54,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=179, Invalid=589, Unknown=4, NotChecked=220, Total=992 [2022-11-19 08:12:54,059 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 421 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:54,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 421 Unchecked, 0.4s Time] [2022-11-19 08:12:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-19 08:12:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2022-11-19 08:12:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 455 states have (on average 2.3516483516483517) internal successors, (1070), 464 states have internal predecessors, (1070), 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:12:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1070 transitions. [2022-11-19 08:12:54,076 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1070 transitions. Word has length 13 [2022-11-19 08:12:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:54,076 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1070 transitions. [2022-11-19 08:12:54,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 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:12:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1070 transitions. [2022-11-19 08:12:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:12:54,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:54,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:12:54,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:54,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 08:12:54,286 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:12:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1143154647, now seen corresponding path program 1 times [2022-11-19 08:12:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:12:54,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53338966] [2022-11-19 08:12:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:12:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:13,958 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:13:13,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:13,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53338966] [2022-11-19 08:13:13,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53338966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:13:13,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661515797] [2022-11-19 08:13:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:13:13,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:13,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:13:13,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:13:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:14,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-19 08:13:14,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:14,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:14,244 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:13:14,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:13:14,272 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:13:14,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:13:14,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-19 08:13:14,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:13:15,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:13:15,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-19 08:13:15,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:15,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-19 08:13:15,839 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:13:15,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:16,413 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_596 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_596 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:13:16,446 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_593 Int) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_593) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_593 Int) (v_ArrVal_596 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_593) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-19 08:13:16,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:13:16,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-19 08:13:18,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_3) .cse2 .cse3)) |c_~#stored_elements~0.base| v_prenex_4) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_593 Int) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_593) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-19 08:13:23,188 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:13:23,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661515797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:13:23,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [796103945] [2022-11-19 08:13:23,189 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:13:23,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:13:23,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 27 [2022-11-19 08:13:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810259324] [2022-11-19 08:13:23,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:13:23,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:13:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:13:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=523, Unknown=9, NotChecked=150, Total=812 [2022-11-19 08:13:23,193 INFO L87 Difference]: Start difference. First operand 465 states and 1070 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:13:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:25,175 INFO L93 Difference]: Finished difference Result 475 states and 1091 transitions. [2022-11-19 08:13:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:13:25,176 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 14 [2022-11-19 08:13:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:25,178 INFO L225 Difference]: With dead ends: 475 [2022-11-19 08:13:25,178 INFO L226 Difference]: Without dead ends: 475 [2022-11-19 08:13:25,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=180, Invalid=693, Unknown=9, NotChecked=174, Total=1056 [2022-11-19 08:13:25,179 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:25,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 287 Unchecked, 1.1s Time] [2022-11-19 08:13:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-19 08:13:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-19 08:13:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.346236559139785) internal successors, (1091), 474 states have internal predecessors, (1091), 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:13:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1091 transitions. [2022-11-19 08:13:25,194 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1091 transitions. Word has length 14 [2022-11-19 08:13:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:25,195 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1091 transitions. [2022-11-19 08:13:25,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:13:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1091 transitions. [2022-11-19 08:13:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:13:25,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:25,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:25,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 08:13:25,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 08:13:25,403 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:13:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash -9132515, now seen corresponding path program 2 times [2022-11-19 08:13:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999838809] [2022-11-19 08:13:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:13:26,794 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:13:26,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:13:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999838809] [2022-11-19 08:13:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999838809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:13:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945842956] [2022-11-19 08:13:26,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:13:26,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:13:26,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:13:26,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:13:26,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:13:27,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:13:27,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:13:27,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-19 08:13:27,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:27,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:27,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:13:27,101 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:13:27,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:13:27,131 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:13:27,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:13:27,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-11-19 08:13:27,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:13:27,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:13:27,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:13:28,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:13:28,136 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:13:28,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:28,201 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_693 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:13:28,495 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_689) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_689) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-19 08:13:28,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:13:28,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-19 08:13:49,312 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:13:57,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| .cse0)) (forall ((v_ArrVal_687 Int) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int) (v_ArrVal_686 (Array Int Int))) (< (* (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store (select .cse1 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| 4) |c_~#queue~0.offset|) v_ArrVal_687))) (store (store .cse2 .cse3 v_ArrVal_689) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse4) 4) 1609)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| .cse0)) (forall ((v_ArrVal_687 Int) (v_prenex_6 Int) (v_prenex_5 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| 4) |c_~#queue~0.offset|) v_ArrVal_687))) (store (store .cse6 .cse3 v_prenex_6) .cse4 (+ (select .cse6 .cse4) 1))))) |c_~#stored_elements~0.base| v_prenex_5) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-11-19 08:13:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 08:13:57,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945842956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:13:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515560115] [2022-11-19 08:13:57,532 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:13:57,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:13:57,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-19 08:13:57,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542624759] [2022-11-19 08:13:57,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:13:57,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 08:13:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:13:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 08:13:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=479, Unknown=29, NotChecked=144, Total=756 [2022-11-19 08:13:57,536 INFO L87 Difference]: Start difference. First operand 475 states and 1091 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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:13:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:13:58,709 INFO L93 Difference]: Finished difference Result 582 states and 1332 transitions. [2022-11-19 08:13:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 08:13:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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 14 [2022-11-19 08:13:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:13:58,712 INFO L225 Difference]: With dead ends: 582 [2022-11-19 08:13:58,712 INFO L226 Difference]: Without dead ends: 582 [2022-11-19 08:13:58,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=155, Invalid=698, Unknown=29, NotChecked=174, Total=1056 [2022-11-19 08:13:58,713 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 568 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:13:58,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 114 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 242 Invalid, 0 Unknown, 568 Unchecked, 0.5s Time] [2022-11-19 08:13:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-19 08:13:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 542. [2022-11-19 08:13:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 532 states have (on average 2.3609022556390977) internal successors, (1256), 541 states have internal predecessors, (1256), 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:13:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1256 transitions. [2022-11-19 08:13:58,731 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1256 transitions. Word has length 14 [2022-11-19 08:13:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:13:58,732 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1256 transitions. [2022-11-19 08:13:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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:13:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1256 transitions. [2022-11-19 08:13:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:13:58,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:13:58,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:13:58,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:13:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 08:13:58,941 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:13:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:13:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1010142995, now seen corresponding path program 3 times [2022-11-19 08:13:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:13:58,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135820265] [2022-11-19 08:13:58,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:13:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:13:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:00,213 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:14:00,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:00,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135820265] [2022-11-19 08:14:00,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135820265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:00,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115665811] [2022-11-19 08:14:00,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:14:00,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:00,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:00,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:14:00,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:14:00,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:00,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-19 08:14:00,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:00,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:00,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:14:00,485 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:14:00,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:14:00,518 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:14:00,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:14:00,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:14:00,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-19 08:14:01,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:14:01,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:14:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:01,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:14:01,608 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:14:01,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:01,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_790 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_790 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:14:01,693 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_790 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_790 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:14:01,712 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_790 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_790 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:14:01,748 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_786) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-19 08:14:01,775 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_785))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_786) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_785))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_786) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:14:01,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:14:01,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2022-11-19 08:14:01,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_785))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_786) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int)) (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_9))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_prenex_7) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_8) |c_~#queue~0.base|) .cse4) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-19 08:14:05,126 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:14:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115665811] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692567986] [2022-11-19 08:14:05,128 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:14:05,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:14:05,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-19 08:14:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685116749] [2022-11-19 08:14:05,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:05,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:14:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:14:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=420, Unknown=7, NotChecked=282, Total=812 [2022-11-19 08:14:05,132 INFO L87 Difference]: Start difference. First operand 542 states and 1256 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:07,199 INFO L93 Difference]: Finished difference Result 826 states and 1923 transitions. [2022-11-19 08:14:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-19 08:14:07,200 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 14 [2022-11-19 08:14:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:07,203 INFO L225 Difference]: With dead ends: 826 [2022-11-19 08:14:07,203 INFO L226 Difference]: Without dead ends: 826 [2022-11-19 08:14:07,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=178, Invalid=769, Unknown=7, NotChecked=378, Total=1332 [2022-11-19 08:14:07,204 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 216 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1357 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:07,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 161 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 528 Invalid, 0 Unknown, 1357 Unchecked, 0.9s Time] [2022-11-19 08:14:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-11-19 08:14:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 542. [2022-11-19 08:14:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 532 states have (on average 2.3609022556390977) internal successors, (1256), 541 states have internal predecessors, (1256), 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:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1256 transitions. [2022-11-19 08:14:07,225 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1256 transitions. Word has length 14 [2022-11-19 08:14:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:07,225 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1256 transitions. [2022-11-19 08:14:07,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1256 transitions. [2022-11-19 08:14:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:14:07,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:07,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:07,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:07,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:07,440 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:14:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1858908543, now seen corresponding path program 4 times [2022-11-19 08:14:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:07,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835828791] [2022-11-19 08:14:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:08,695 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:14:08,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835828791] [2022-11-19 08:14:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835828791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253600595] [2022-11-19 08:14:08,696 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:14:08,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:08,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:08,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:14:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:08,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-19 08:14:08,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:08,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:08,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:08,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:08,974 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:14:08,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:14:09,010 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:14:09,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:14:09,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:14:09,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:14:09,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:14:09,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:14:10,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:10,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:14:10,129 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:14:10,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:10,195 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_888 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_888 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-19 08:14:12,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:14:12,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-19 08:14:14,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_10)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_12))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_11) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_884 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_884)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_885))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse5))))))) is different from false [2022-11-19 08:14:29,467 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:14:29,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253600595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:29,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335630725] [2022-11-19 08:14:29,468 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:14:29,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:14:29,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-19 08:14:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975927746] [2022-11-19 08:14:29,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:29,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 08:14:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 08:14:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=505, Unknown=43, NotChecked=98, Total=756 [2022-11-19 08:14:29,472 INFO L87 Difference]: Start difference. First operand 542 states and 1256 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:30,719 INFO L93 Difference]: Finished difference Result 708 states and 1644 transitions. [2022-11-19 08:14:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:14:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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 14 [2022-11-19 08:14:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:30,723 INFO L225 Difference]: With dead ends: 708 [2022-11-19 08:14:30,723 INFO L226 Difference]: Without dead ends: 708 [2022-11-19 08:14:30,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=135, Invalid=642, Unknown=43, NotChecked=110, Total=930 [2022-11-19 08:14:30,725 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 183 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:30,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 116 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 786 Unchecked, 0.5s Time] [2022-11-19 08:14:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-11-19 08:14:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 569. [2022-11-19 08:14:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 559 states have (on average 2.370304114490161) internal successors, (1325), 568 states have internal predecessors, (1325), 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:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1325 transitions. [2022-11-19 08:14:30,744 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1325 transitions. Word has length 14 [2022-11-19 08:14:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:30,744 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 1325 transitions. [2022-11-19 08:14:30,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1325 transitions. [2022-11-19 08:14:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:14:30,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:30,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:30,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:30,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:30,953 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:14:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1525846337, now seen corresponding path program 5 times [2022-11-19 08:14:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:30,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636300606] [2022-11-19 08:14:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:30,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:32,634 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:14:32,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:32,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636300606] [2022-11-19 08:14:32,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636300606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:32,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735772573] [2022-11-19 08:14:32,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:14:32,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:32,640 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:32,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:14:32,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:14:32,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:32,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-19 08:14:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:32,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:32,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:32,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:14:32,997 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:14:32,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:14:33,062 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:14:33,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:14:33,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:14:33,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:14:33,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:14:34,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:14:34,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:14:34,615 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:14:34,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:34,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-19 08:14:34,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_985 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1) 4) 1605)))) is different from false [2022-11-19 08:14:34,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1) 4) 1605)) (forall ((v_ArrVal_985 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-19 08:14:35,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (< (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_982))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse3) 4) 1605)) (forall ((v_ArrVal_985 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_982))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:14:35,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_982 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_981)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_982))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (v_ArrVal_982 (Array Int Int))) (< (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_981)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_982))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) .cse5) 4) 1605)))) is different from false [2022-11-19 08:14:38,194 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:14:38,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735772573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:38,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1805386362] [2022-11-19 08:14:38,195 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:14:38,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:14:38,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-19 08:14:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248463844] [2022-11-19 08:14:38,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:38,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 08:14:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 08:14:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=368, Unknown=14, NotChecked=172, Total=650 [2022-11-19 08:14:38,198 INFO L87 Difference]: Start difference. First operand 569 states and 1325 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:40,877 INFO L93 Difference]: Finished difference Result 774 states and 1835 transitions. [2022-11-19 08:14:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:14:40,880 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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 14 [2022-11-19 08:14:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:40,883 INFO L225 Difference]: With dead ends: 774 [2022-11-19 08:14:40,884 INFO L226 Difference]: Without dead ends: 774 [2022-11-19 08:14:40,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=207, Invalid=850, Unknown=15, NotChecked=260, Total=1332 [2022-11-19 08:14:40,885 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:40,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 136 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 570 Unchecked, 0.7s Time] [2022-11-19 08:14:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-19 08:14:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 573. [2022-11-19 08:14:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 563 states have (on average 2.369449378330373) internal successors, (1334), 572 states have internal predecessors, (1334), 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:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1334 transitions. [2022-11-19 08:14:40,904 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1334 transitions. Word has length 14 [2022-11-19 08:14:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:40,904 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 1334 transitions. [2022-11-19 08:14:40,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 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:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1334 transitions. [2022-11-19 08:14:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:14:40,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:40,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:40,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:41,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 08:14:41,114 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:14:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1686717737, now seen corresponding path program 6 times [2022-11-19 08:14:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:41,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169508647] [2022-11-19 08:14:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:42,329 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:14:42,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:14:42,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169508647] [2022-11-19 08:14:42,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169508647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:42,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64636439] [2022-11-19 08:14:42,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:14:42,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:42,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:42,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:14:42,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:14:42,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:42,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-19 08:14:42,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:42,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:42,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:42,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:42,648 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:14:42,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:14:42,704 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:14:42,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:14:43,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:14:43,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:14:43,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2022-11-19 08:14:43,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:14:44,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:14:44,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:14:44,228 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:14:44,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:44,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1083 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:14:44,458 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1083 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1083 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:14:44,499 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1083 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1083 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_1083) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-19 08:14:44,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:14:44,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 137 [2022-11-19 08:14:59,500 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:14:59,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64636439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [368173028] [2022-11-19 08:14:59,501 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:14:59,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:14:59,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-19 08:14:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602404016] [2022-11-19 08:14:59,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:59,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 08:14:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:14:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 08:14:59,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=459, Unknown=17, NotChecked=144, Total=756 [2022-11-19 08:14:59,505 INFO L87 Difference]: Start difference. First operand 573 states and 1334 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:01,363 INFO L93 Difference]: Finished difference Result 764 states and 1774 transitions. [2022-11-19 08:15:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 08:15:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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 14 [2022-11-19 08:15:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:01,367 INFO L225 Difference]: With dead ends: 764 [2022-11-19 08:15:01,367 INFO L226 Difference]: Without dead ends: 764 [2022-11-19 08:15:01,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=201, Invalid=724, Unknown=17, NotChecked=180, Total=1122 [2022-11-19 08:15:01,369 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 132 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:01,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 134 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 719 Unchecked, 0.9s Time] [2022-11-19 08:15:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-19 08:15:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 575. [2022-11-19 08:15:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 565 states have (on average 2.368141592920354) internal successors, (1338), 574 states have internal predecessors, (1338), 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,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1338 transitions. [2022-11-19 08:15:01,387 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1338 transitions. Word has length 14 [2022-11-19 08:15:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:01,388 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1338 transitions. [2022-11-19 08:15:01,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 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,388 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1338 transitions. [2022-11-19 08:15:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:15:01,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:01,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:01,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-19 08:15:01,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 08:15:01,596 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:15:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1684353677, now seen corresponding path program 7 times [2022-11-19 08:15:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:01,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478734951] [2022-11-19 08:15:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:04,187 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:04,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:04,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478734951] [2022-11-19 08:15:04,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478734951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:04,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51108078] [2022-11-19 08:15:04,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:15:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:04,192 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:04,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:15:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:04,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-19 08:15:04,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:04,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:04,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:04,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:04,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:15:04,526 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:15:04,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:15:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:04,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:04,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:04,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-19 08:15:04,613 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:15:04,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:15:05,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:15:05,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:15:05,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:15:05,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:15:05,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:05,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:15:06,109 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:06,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:06,197 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1182 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1182 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:15:06,219 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-19 08:15:06,248 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:15:06,273 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:15:06,322 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 Int) (v_ArrVal_1182 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1177) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse4))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 Int) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1177) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse4)))))))) is different from false [2022-11-19 08:15:06,378 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1176 Int) (v_ArrVal_1177 Int) (v_ArrVal_1182 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1176))) (store (store .cse0 .cse1 v_ArrVal_1177) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1176 Int) (v_ArrVal_1177 Int) (v_ArrVal_1182 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1176))) (store (store .cse6 .cse1 v_ArrVal_1177) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1181) |c_~#stored_elements~0.base| v_ArrVal_1182) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2022-11-19 08:15:16,964 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:16,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51108078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:16,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427860591] [2022-11-19 08:15:16,968 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:16,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:15:16,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-19 08:15:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417915203] [2022-11-19 08:15:16,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-19 08:15:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-19 08:15:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=333, Unknown=7, NotChecked=258, Total=702 [2022-11-19 08:15:16,977 INFO L87 Difference]: Start difference. First operand 575 states and 1338 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 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:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:19,895 INFO L93 Difference]: Finished difference Result 740 states and 1733 transitions. [2022-11-19 08:15:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 08:15:19,896 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 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 14 [2022-11-19 08:15:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:19,899 INFO L225 Difference]: With dead ends: 740 [2022-11-19 08:15:19,899 INFO L226 Difference]: Without dead ends: 740 [2022-11-19 08:15:19,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=160, Invalid=507, Unknown=7, NotChecked=318, Total=992 [2022-11-19 08:15:19,900 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 151 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1056 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:19,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 112 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 503 Invalid, 0 Unknown, 1056 Unchecked, 1.4s Time] [2022-11-19 08:15:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-19 08:15:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2022-11-19 08:15:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 563 states have (on average 2.369449378330373) internal successors, (1334), 572 states have internal predecessors, (1334), 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:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1334 transitions. [2022-11-19 08:15:19,920 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1334 transitions. Word has length 14 [2022-11-19 08:15:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:19,920 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 1334 transitions. [2022-11-19 08:15:19,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 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:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1334 transitions. [2022-11-19 08:15:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:15:19,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:19,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:19,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:20,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:20,129 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:15:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1684365767, now seen corresponding path program 8 times [2022-11-19 08:15:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:20,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237885329] [2022-11-19 08:15:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:21,867 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:21,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237885329] [2022-11-19 08:15:21,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237885329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:21,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196046504] [2022-11-19 08:15:21,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:15:21,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:21,869 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:21,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 08:15:22,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:15:22,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:22,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-19 08:15:22,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:22,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:22,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:22,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:15:22,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:15:22,266 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:15:22,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:15:22,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:15:22,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:15:23,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:15:23,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:15:23,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:15:23,857 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:23,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:24,090 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1280) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1280) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:15:32,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:15:32,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-19 08:15:45,314 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:45,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196046504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:45,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038360393] [2022-11-19 08:15:45,315 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:45,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:15:45,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-19 08:15:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996036073] [2022-11-19 08:15:45,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:45,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:15:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:15:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:15:45,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=576, Unknown=48, NotChecked=52, Total=812 [2022-11-19 08:15:45,318 INFO L87 Difference]: Start difference. First operand 573 states and 1334 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:49,838 INFO L93 Difference]: Finished difference Result 738 states and 1728 transitions. [2022-11-19 08:15:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:15:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 14 [2022-11-19 08:15:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:49,842 INFO L225 Difference]: With dead ends: 738 [2022-11-19 08:15:49,842 INFO L226 Difference]: Without dead ends: 738 [2022-11-19 08:15:49,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=169, Invalid=714, Unknown=51, NotChecked=58, Total=992 [2022-11-19 08:15:49,843 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 138 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:49,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 101 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 342 Invalid, 0 Unknown, 461 Unchecked, 1.0s Time] [2022-11-19 08:15:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-19 08:15:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 573. [2022-11-19 08:15:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 563 states have (on average 2.369449378330373) internal successors, (1334), 572 states have internal predecessors, (1334), 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:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1334 transitions. [2022-11-19 08:15:49,864 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1334 transitions. Word has length 14 [2022-11-19 08:15:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:49,864 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 1334 transitions. [2022-11-19 08:15:49,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1334 transitions. [2022-11-19 08:15:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:15:49,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:49,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:49,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:50,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:50,074 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:15:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 350223819, now seen corresponding path program 9 times [2022-11-19 08:15:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:15:50,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685538318] [2022-11-19 08:15:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:15:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:51,838 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:51,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:15:51,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685538318] [2022-11-19 08:15:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685538318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:51,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116279658] [2022-11-19 08:15:51,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:15:51,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:51,840 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:51,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 08:15:52,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:15:52,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:52,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-19 08:15:52,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:52,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:52,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:52,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:52,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:15:52,183 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:15:52,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:15:52,249 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:15:52,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:15:52,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:15:52,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-19 08:15:53,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:15:53,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:15:53,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:15:53,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:15:54,147 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:54,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:54,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1377 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1377) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1377 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1377) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:15:54,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:15:54,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-19 08:15:57,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_19 Int)) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_19) .cse2 .cse3)) |c_~#stored_elements~0.base| v_prenex_20) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_1373 Int) (v_ArrVal_1377 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1373) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1377) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-19 08:15:57,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1373 Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1372))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1373) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1377) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_prenex_19 Int)) (< (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1372))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_prenex_19) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_20) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-19 08:15:59,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1371 Int) (v_ArrVal_1373 Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1371)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1372))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1373) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1377) |c_~#queue~0.base|) .cse6) 4)))) (forall ((v_ArrVal_1371 Int) (v_prenex_20 (Array Int Int)) (v_ArrVal_1372 (Array Int Int)) (v_prenex_19 Int)) (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1371)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1372))) (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse8 .cse2 v_prenex_19) .cse3 (+ (select .cse8 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_20) |c_~#queue~0.base|) .cse6) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-19 08:16:03,802 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:16:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116279658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:03,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1764421071] [2022-11-19 08:16:03,803 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:16:03,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:03,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-19 08:16:03,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077203000] [2022-11-19 08:16:03,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:03,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:16:03,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:03,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:16:03,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=476, Unknown=21, NotChecked=196, Total=812 [2022-11-19 08:16:03,805 INFO L87 Difference]: Start difference. First operand 573 states and 1334 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:16:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:09,272 INFO L93 Difference]: Finished difference Result 756 states and 1756 transitions. [2022-11-19 08:16:09,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 08:16:09,273 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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 14 [2022-11-19 08:16:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:09,276 INFO L225 Difference]: With dead ends: 756 [2022-11-19 08:16:09,276 INFO L226 Difference]: Without dead ends: 756 [2022-11-19 08:16:09,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=232, Invalid=946, Unknown=28, NotChecked=276, Total=1482 [2022-11-19 08:16:09,277 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 211 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1146 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:09,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 144 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 0 Unknown, 1146 Unchecked, 1.0s Time] [2022-11-19 08:16:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-11-19 08:16:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 566. [2022-11-19 08:16:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 556 states have (on average 2.366906474820144) internal successors, (1316), 565 states have internal predecessors, (1316), 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:16:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1316 transitions. [2022-11-19 08:16:09,295 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1316 transitions. Word has length 14 [2022-11-19 08:16:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:09,296 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 1316 transitions. [2022-11-19 08:16:09,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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:16:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1316 transitions. [2022-11-19 08:16:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:16:09,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:09,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:16:09,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-19 08:16:09,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-19 08:16:09,505 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:16:09,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1801719991, now seen corresponding path program 1 times [2022-11-19 08:16:09,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:09,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730509540] [2022-11-19 08:16:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:11,174 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:16:11,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:11,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730509540] [2022-11-19 08:16:11,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730509540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:11,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407168187] [2022-11-19 08:16:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:11,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:11,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:11,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 08:16:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:11,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-19 08:16:11,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:11,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:11,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:11,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:11,480 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:16:11,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:16:11,535 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:16:11,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:16:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:16:12,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:16:12,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:16:13,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:16:13,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:13,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:16:13,528 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:16:13,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:14,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1474 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1474) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1474 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1474) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-19 08:16:14,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1471))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1474) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1471))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1474) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:16:14,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:16:14,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-19 08:16:24,526 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:16:24,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407168187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:24,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1256207161] [2022-11-19 08:16:24,527 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:16:24,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:24,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-19 08:16:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609404915] [2022-11-19 08:16:24,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:24,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:16:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:24,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:16:24,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=553, Unknown=33, NotChecked=102, Total=812 [2022-11-19 08:16:24,531 INFO L87 Difference]: Start difference. First operand 566 states and 1316 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:16:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:29,936 INFO L93 Difference]: Finished difference Result 748 states and 1741 transitions. [2022-11-19 08:16:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 08:16:29,937 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:16:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:29,942 INFO L225 Difference]: With dead ends: 748 [2022-11-19 08:16:29,942 INFO L226 Difference]: Without dead ends: 748 [2022-11-19 08:16:29,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=235, Invalid=994, Unknown=39, NotChecked=138, Total=1406 [2022-11-19 08:16:29,944 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 148 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 929 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:29,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 164 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 462 Invalid, 0 Unknown, 929 Unchecked, 1.3s Time] [2022-11-19 08:16:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-19 08:16:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 539. [2022-11-19 08:16:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 529 states have (on average 2.3572778827977316) internal successors, (1247), 538 states have internal predecessors, (1247), 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:16:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1247 transitions. [2022-11-19 08:16:29,967 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1247 transitions. Word has length 15 [2022-11-19 08:16:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:29,968 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 1247 transitions. [2022-11-19 08:16:29,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:16:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1247 transitions. [2022-11-19 08:16:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:16:29,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:29,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:16:29,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:30,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 08:16:30,181 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:16:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -139118327, now seen corresponding path program 2 times [2022-11-19 08:16:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:30,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276557743] [2022-11-19 08:16:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:31,864 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:16:31,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276557743] [2022-11-19 08:16:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276557743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061877464] [2022-11-19 08:16:31,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:16:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:31,866 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:31,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 08:16:32,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:16:32,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:16:32,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-19 08:16:32,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:32,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:32,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:32,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:16:32,203 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:16:32,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:16:32,257 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:16:32,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:16:32,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:16:32,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:16:33,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:16:33,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:16:33,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:16:33,771 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:16:33,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:33,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-19 08:16:34,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1571 (Array Int Int))) (< (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse1)) 1605)))) is different from false [2022-11-19 08:16:34,099 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse1) 4) 1605)) (forall ((v_ArrVal_1571 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:16:34,155 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (< (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1568))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse3)) 1605)) (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1568))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:16:34,206 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1566 Int) (v_ArrVal_1571 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1566)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1568))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1566 Int) (v_ArrVal_1571 (Array Int Int))) (< (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1566)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1568))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1571) |c_~#queue~0.base|) .cse5) 4) 1605)))) is different from false [2022-11-19 08:16:38,319 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:16:38,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061877464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022537337] [2022-11-19 08:16:38,320 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:16:38,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:16:38,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-19 08:16:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121847714] [2022-11-19 08:16:38,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:16:38,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-19 08:16:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:16:38,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-19 08:16:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=402, Unknown=21, NotChecked=180, Total=702 [2022-11-19 08:16:38,323 INFO L87 Difference]: Start difference. First operand 539 states and 1247 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 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:16:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:42,163 INFO L93 Difference]: Finished difference Result 755 states and 1779 transitions. [2022-11-19 08:16:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-19 08:16:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 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:16:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:42,166 INFO L225 Difference]: With dead ends: 755 [2022-11-19 08:16:42,166 INFO L226 Difference]: Without dead ends: 755 [2022-11-19 08:16:42,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=244, Invalid=1082, Unknown=22, NotChecked=292, Total=1640 [2022-11-19 08:16:42,167 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 155 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:42,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 124 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 638 Unchecked, 0.7s Time] [2022-11-19 08:16:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-11-19 08:16:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 551. [2022-11-19 08:16:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 541 states have (on average 2.386321626617375) internal successors, (1291), 550 states have internal predecessors, (1291), 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:16:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1291 transitions. [2022-11-19 08:16:42,186 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1291 transitions. Word has length 15 [2022-11-19 08:16:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:42,186 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 1291 transitions. [2022-11-19 08:16:42,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 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:16:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1291 transitions. [2022-11-19 08:16:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:16:42,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:42,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:16:42,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-19 08:16:42,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:42,410 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:16:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -66726197, now seen corresponding path program 3 times [2022-11-19 08:16:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932898453] [2022-11-19 08:16:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:16:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:44,112 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:16:44,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:16:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932898453] [2022-11-19 08:16:44,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932898453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:16:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681940242] [2022-11-19 08:16:44,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:16:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:44,114 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:44,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 08:16:44,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:16:44,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:16:44,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 08:16:44,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:44,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:44,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:44,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:44,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:16:44,435 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:16:44,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:16:44,490 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:16:44,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:16:44,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:16:45,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:16:45,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:16:46,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:16:46,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:16:46,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:16:46,415 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:16:46,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:46,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1667 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1667 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:16:46,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1667 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1667 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:16:46,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1664 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1664))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1664 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1664))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:16:47,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:16:47,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-19 08:16:47,260 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_25 Int) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_25)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_26))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_24) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1662)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1664))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1667) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:17:02,730 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:17:09,278 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:17:09,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681940242] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:09,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [284916972] [2022-11-19 08:17:09,279 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:17:09,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:17:09,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-19 08:17:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013037060] [2022-11-19 08:17:09,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:09,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:17:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:09,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:17:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=471, Unknown=28, NotChecked=196, Total=812 [2022-11-19 08:17:09,282 INFO L87 Difference]: Start difference. First operand 551 states and 1291 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:17:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:12,398 INFO L93 Difference]: Finished difference Result 754 states and 1776 transitions. [2022-11-19 08:17:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-19 08:17:12,399 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:17:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:12,401 INFO L225 Difference]: With dead ends: 754 [2022-11-19 08:17:12,401 INFO L226 Difference]: Without dead ends: 754 [2022-11-19 08:17:12,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=190, Invalid=919, Unknown=29, NotChecked=268, Total=1406 [2022-11-19 08:17:12,402 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:12,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 117 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 599 Unchecked, 0.9s Time] [2022-11-19 08:17:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-19 08:17:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 545. [2022-11-19 08:17:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 535 states have (on average 2.3757009345794393) internal successors, (1271), 544 states have internal predecessors, (1271), 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:17:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1271 transitions. [2022-11-19 08:17:12,420 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1271 transitions. Word has length 15 [2022-11-19 08:17:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:12,420 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 1271 transitions. [2022-11-19 08:17:12,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:17:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1271 transitions. [2022-11-19 08:17:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:17:12,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:12,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:12,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:12,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-19 08:17:12,629 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:17:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2014977094, now seen corresponding path program 1 times [2022-11-19 08:17:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:12,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137409915] [2022-11-19 08:17:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:12,772 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:17:12,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:12,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137409915] [2022-11-19 08:17:12,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137409915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:12,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:12,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:17:12,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044645085] [2022-11-19 08:17:12,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:12,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:12,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:17:12,776 INFO L87 Difference]: Start difference. First operand 545 states and 1271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:17:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:13,091 INFO L93 Difference]: Finished difference Result 557 states and 1279 transitions. [2022-11-19 08:17:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:13,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:17:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:13,094 INFO L225 Difference]: With dead ends: 557 [2022-11-19 08:17:13,094 INFO L226 Difference]: Without dead ends: 557 [2022-11-19 08:17:13,094 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:17:13,095 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:13,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:17:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-11-19 08:17:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 531. [2022-11-19 08:17:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 521 states have (on average 2.3685220729366603) internal successors, (1234), 530 states have internal predecessors, (1234), 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:17:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1234 transitions. [2022-11-19 08:17:13,112 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 1234 transitions. Word has length 15 [2022-11-19 08:17:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:13,112 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 1234 transitions. [2022-11-19 08:17:13,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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:17:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1234 transitions. [2022-11-19 08:17:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:17:13,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:13,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-19 08:17:13,114 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:17:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 135274878, now seen corresponding path program 1 times [2022-11-19 08:17:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:13,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018708800] [2022-11-19 08:17:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:13,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:13,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018708800] [2022-11-19 08:17:13,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018708800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:13,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:13,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:17:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851379249] [2022-11-19 08:17:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:13,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:17:13,271 INFO L87 Difference]: Start difference. First operand 531 states and 1234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:17:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:13,557 INFO L93 Difference]: Finished difference Result 351 states and 708 transitions. [2022-11-19 08:17:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:17:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:13,559 INFO L225 Difference]: With dead ends: 351 [2022-11-19 08:17:13,559 INFO L226 Difference]: Without dead ends: 349 [2022-11-19 08:17:13,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17:13,560 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:13,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:17:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-19 08:17:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2022-11-19 08:17:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 335 states have (on average 2.080597014925373) internal successors, (697), 344 states have internal predecessors, (697), 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:17:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 697 transitions. [2022-11-19 08:17:13,571 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 697 transitions. Word has length 16 [2022-11-19 08:17:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:13,571 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 697 transitions. [2022-11-19 08:17:13,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:17:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 697 transitions. [2022-11-19 08:17:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:17:13,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:13,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:13,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-19 08:17:13,573 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:17:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash 106645727, now seen corresponding path program 1 times [2022-11-19 08:17:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:13,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628757368] [2022-11-19 08:17:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:16,351 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:17:16,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:16,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628757368] [2022-11-19 08:17:16,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628757368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:16,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160934043] [2022-11-19 08:17:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:16,360 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:16,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 08:17:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:16,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-19 08:17:16,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:16,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:16,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:16,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:16,769 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:17:16,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:17:16,844 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:17:16,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:17:17,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:17:17,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:17:18,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-19 08:17:18,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:17:18,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:18,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:17:19,116 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:17:19,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:19,242 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1840 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1840 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:17:19,473 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1840 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1840 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-19 08:17:19,536 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:17:19,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1836 Int) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1836)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1836 Int) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1836)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2022-11-19 08:17:19,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:17:19,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-19 08:17:21,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_27 Int) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_27)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_29))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_28) |c_~#queue~0.base|) .cse5) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_1836 Int) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1836)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1840) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2022-11-19 08:17:32,093 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:17:34,917 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:17:34,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160934043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:34,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836967921] [2022-11-19 08:17:34,918 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:17:34,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:17:34,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-19 08:17:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854709373] [2022-11-19 08:17:34,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:34,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:17:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:17:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=449, Unknown=13, NotChecked=240, Total=812 [2022-11-19 08:17:34,921 INFO L87 Difference]: Start difference. First operand 345 states and 697 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 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:17:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:37,654 INFO L93 Difference]: Finished difference Result 423 states and 832 transitions. [2022-11-19 08:17:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-19 08:17:37,655 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 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:17:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:37,656 INFO L225 Difference]: With dead ends: 423 [2022-11-19 08:17:37,656 INFO L226 Difference]: Without dead ends: 423 [2022-11-19 08:17:37,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=192, Invalid=807, Unknown=13, NotChecked=320, Total=1332 [2022-11-19 08:17:37,657 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:37,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 328 Invalid, 0 Unknown, 626 Unchecked, 1.0s Time] [2022-11-19 08:17:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-11-19 08:17:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 342. [2022-11-19 08:17:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 332 states have (on average 2.0813253012048194) internal successors, (691), 341 states have internal predecessors, (691), 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:17:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 691 transitions. [2022-11-19 08:17:37,668 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 691 transitions. Word has length 16 [2022-11-19 08:17:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:37,669 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 691 transitions. [2022-11-19 08:17:37,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 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:17:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 691 transitions. [2022-11-19 08:17:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:17:37,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:37,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:37,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-19 08:17:37,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:37,878 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:17:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1479654891, now seen corresponding path program 2 times [2022-11-19 08:17:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:37,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371761676] [2022-11-19 08:17:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:39,845 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:17:39,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371761676] [2022-11-19 08:17:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371761676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59097329] [2022-11-19 08:17:39,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:17:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:39,850 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:39,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 08:17:40,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 08:17:40,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:17:40,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-19 08:17:40,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:40,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:40,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:40,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:40,256 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:17:40,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:17:40,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:40,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:40,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:40,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-19 08:17:40,365 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:17:40,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:17:40,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:17:41,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-19 08:17:41,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:17:42,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-19 08:17:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:42,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:17:42,607 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:17:42,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:43,144 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1939 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1939) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1939 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1939) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:17:43,199 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1936 Int) (v_ArrVal_1939 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1936) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1939) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1939 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1936) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1939) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-19 08:17:50,845 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:17:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59097329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520045023] [2022-11-19 08:17:50,846 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:17:50,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:17:50,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-19 08:17:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350001083] [2022-11-19 08:17:50,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:50,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 08:17:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:50,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 08:17:50,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=533, Unknown=12, NotChecked=98, Total=756 [2022-11-19 08:17:50,848 INFO L87 Difference]: Start difference. First operand 342 states and 691 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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:17:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:57,534 INFO L93 Difference]: Finished difference Result 425 states and 837 transitions. [2022-11-19 08:17:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:17:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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:17:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:57,537 INFO L225 Difference]: With dead ends: 425 [2022-11-19 08:17:57,537 INFO L226 Difference]: Without dead ends: 425 [2022-11-19 08:17:57,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=204, Invalid=843, Unknown=17, NotChecked=126, Total=1190 [2022-11-19 08:17:57,538 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 62 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:57,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 69 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 230 Invalid, 0 Unknown, 576 Unchecked, 0.7s Time] [2022-11-19 08:17:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-19 08:17:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 334. [2022-11-19 08:17:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 2.1018518518518516) internal successors, (681), 333 states have internal predecessors, (681), 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:17:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 681 transitions. [2022-11-19 08:17:57,550 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 681 transitions. Word has length 16 [2022-11-19 08:17:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:57,550 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 681 transitions. [2022-11-19 08:17:57,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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:17:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 681 transitions. [2022-11-19 08:17:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 08:17:57,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:57,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:57,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-19 08:17:57,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:57,759 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:17:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -144042823, now seen corresponding path program 1 times [2022-11-19 08:17:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:57,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086275991] [2022-11-19 08:17:57,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:59,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086275991] [2022-11-19 08:17:59,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086275991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:59,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271650629] [2022-11-19 08:17:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:59,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:59,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:59,209 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:59,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 08:17:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:59,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-19 08:17:59,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:59,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:59,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:59,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:59,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-19 08:18:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:18:00,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:18:00,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271650629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:18:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1618155758] [2022-11-19 08:18:00,498 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:18:00,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:18:00,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-19 08:18:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209824178] [2022-11-19 08:18:00,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:18:00,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-19 08:18:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-19 08:18:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:18:00,502 INFO L87 Difference]: Start difference. First operand 334 states and 681 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 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:18:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:03,530 INFO L93 Difference]: Finished difference Result 892 states and 1815 transitions. [2022-11-19 08:18:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 08:18:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 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 19 [2022-11-19 08:18:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:03,534 INFO L225 Difference]: With dead ends: 892 [2022-11-19 08:18:03,534 INFO L226 Difference]: Without dead ends: 892 [2022-11-19 08:18:03,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-11-19 08:18:03,536 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 346 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:03,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 48 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-19 08:18:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-11-19 08:18:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 562. [2022-11-19 08:18:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 552 states have (on average 2.085144927536232) internal successors, (1151), 561 states have internal predecessors, (1151), 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:18:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1151 transitions. [2022-11-19 08:18:03,554 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1151 transitions. Word has length 19 [2022-11-19 08:18:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:03,555 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1151 transitions. [2022-11-19 08:18:03,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 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:18:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1151 transitions. [2022-11-19 08:18:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:18:03,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:03,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:18:03,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-19 08:18:03,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-19 08:18:03,764 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:18:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash -678653597, now seen corresponding path program 1 times [2022-11-19 08:18:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:18:03,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337334758] [2022-11-19 08:18:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:18:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:18:06,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:06,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337334758] [2022-11-19 08:18:06,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337334758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:06,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356581603] [2022-11-19 08:18:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:06,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:06,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:18:06,704 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:18:06,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 08:18:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:06,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-19 08:18:06,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:07,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:18:07,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:07,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:18:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:18:08,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:08,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2118 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2118) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_2118 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2118) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:18:08,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:18:08,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-19 08:18:08,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:18:08,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-19 08:18:08,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:18:08,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:18:08,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-19 08:18:08,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:18:08,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:08,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-19 08:18:08,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:18:08,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-11-19 08:18:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 08:18:09,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356581603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:18:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882684206] [2022-11-19 08:18:09,261 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:18:09,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:18:09,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2022-11-19 08:18:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150363117] [2022-11-19 08:18:09,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:18:09,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-19 08:18:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-19 08:18:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2022-11-19 08:18:09,264 INFO L87 Difference]: Start difference. First operand 562 states and 1151 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 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:18:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:14,503 INFO L93 Difference]: Finished difference Result 791 states and 1603 transitions. [2022-11-19 08:18:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 08:18:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 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 21 [2022-11-19 08:18:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:14,506 INFO L225 Difference]: With dead ends: 791 [2022-11-19 08:18:14,506 INFO L226 Difference]: Without dead ends: 791 [2022-11-19 08:18:14,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=293, Invalid=900, Unknown=1, NotChecked=66, Total=1260 [2022-11-19 08:18:14,507 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 484 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:14,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 41 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 577 Invalid, 0 Unknown, 87 Unchecked, 2.5s Time] [2022-11-19 08:18:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-19 08:18:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 616. [2022-11-19 08:18:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 606 states have (on average 2.097359735973597) internal successors, (1271), 615 states have internal predecessors, (1271), 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:18:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1271 transitions. [2022-11-19 08:18:14,525 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1271 transitions. Word has length 21 [2022-11-19 08:18:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:14,525 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 1271 transitions. [2022-11-19 08:18:14,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 states have internal predecessors, (63), 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:18:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1271 transitions. [2022-11-19 08:18:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:18:14,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:14,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-19 08:18:14,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 08:18:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-19 08:18:14,735 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:18:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1029172945, now seen corresponding path program 2 times [2022-11-19 08:18:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:18:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177912133] [2022-11-19 08:18:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:18:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:16,919 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:18:16,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:16,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177912133] [2022-11-19 08:18:16,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177912133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:16,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689016214] [2022-11-19 08:18:16,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:18:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:18:16,922 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:18:16,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 08:18:17,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 08:18:17,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:18:17,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-19 08:18:17,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:17,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:17,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:17,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:18:17,505 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:18:17,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:18:17,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:17,602 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 08:18:17,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-19 08:18:17,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:17,695 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-19 08:18:17,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:18:18,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:18:18,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:18:19,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-19 08:18:19,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-19 08:18:20,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-19 08:18:20,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-19 08:18:21,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2022-11-19 08:18:21,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 105 [2022-11-19 08:18:22,139 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:18:22,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:22,274 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2233 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_2233 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:18:22,830 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2229 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2229) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2229 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2229) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-19 08:18:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-19 08:18:49,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689016214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:18:49,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650530174] [2022-11-19 08:18:49,677 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:18:49,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:18:49,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 38 [2022-11-19 08:18:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927960886] [2022-11-19 08:18:49,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:18:49,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-19 08:18:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-19 08:18:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1129, Unknown=38, NotChecked=146, Total=1560 [2022-11-19 08:18:49,681 INFO L87 Difference]: Start difference. First operand 616 states and 1271 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 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:19:03,483 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 .cse9))) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (or (not (<= (+ |c_~#queue~0.offset| 1612) .cse0)) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2224 Int)) (or (forall ((v_ArrVal_2226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1311| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2224)) |c_~#stored_elements~0.base| v_ArrVal_2226))) (let ((.cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1311| 4) |c_~#queue~0.offset|)) (.cse6 (select .cse2 |c_~#queue~0.base|))) (or (not (<= 0 .cse1)) (forall ((v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2227 Int) (v_ArrVal_2229 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse1 v_ArrVal_2227))) (store (store .cse3 .cse4 v_ArrVal_2229) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse5) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1311| (select .cse6 .cse5))))))) (not (<= v_ArrVal_2224 .cse9)))) (forall ((v_ArrVal_2224 Int)) (or (forall ((v_ArrVal_2226 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1311| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2224)) |c_~#stored_elements~0.base| v_ArrVal_2226))) (let ((.cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1311| 4) |c_~#queue~0.offset|)) (.cse13 (select .cse11 |c_~#queue~0.base|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2227 Int) (v_ArrVal_2229 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2227))) (store (store .cse12 .cse4 v_ArrVal_2229) .cse5 (+ (select .cse12 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse5) 4)) .cse0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1311| (select .cse13 .cse5))))))) (not (<= v_ArrVal_2224 .cse9))))))) (forall ((v_ArrVal_2233 (Array Int Int))) (<= (+ (* (select (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse0)) (forall ((v_ArrVal_2233 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_2233) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-19 08:19:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:11,907 INFO L93 Difference]: Finished difference Result 632 states and 1301 transitions. [2022-11-19 08:19:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-19 08:19:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 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 21 [2022-11-19 08:19:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:11,909 INFO L225 Difference]: With dead ends: 632 [2022-11-19 08:19:11,909 INFO L226 Difference]: Without dead ends: 632 [2022-11-19 08:19:11,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=570, Invalid=2399, Unknown=123, NotChecked=330, Total=3422 [2022-11-19 08:19:11,911 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:11,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 125 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 401 Unchecked, 0.5s Time] [2022-11-19 08:19:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-19 08:19:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 622. [2022-11-19 08:19:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 612 states have (on average 2.0947712418300655) internal successors, (1282), 621 states have internal predecessors, (1282), 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:19:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1282 transitions. [2022-11-19 08:19:11,926 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1282 transitions. Word has length 21 [2022-11-19 08:19:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:11,926 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1282 transitions. [2022-11-19 08:19:11,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 states have internal predecessors, (63), 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:19:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1282 transitions. [2022-11-19 08:19:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:19:11,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:11,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 08:19:11,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:12,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:12,136 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:19:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 393525912, now seen corresponding path program 10 times [2022-11-19 08:19:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:19:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430106649] [2022-11-19 08:19:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:19:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:17,860 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:19:17,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:19:17,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430106649] [2022-11-19 08:19:17,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430106649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:17,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723296651] [2022-11-19 08:19:17,861 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 08:19:17,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:17,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:17,863 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:17,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-19 08:19:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:18,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-19 08:19:18,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:18,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:18,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:18,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:18,265 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:19:18,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-19 08:19:18,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:18,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:18,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:18,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-19 08:19:18,343 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-19 08:19:18,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:19:18,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-19 08:19:18,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-19 08:19:19,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-19 08:19:19,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-19 08:19:20,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:20,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-19 08:19:20,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2022-11-19 08:19:20,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-19 08:19:21,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-11-19 08:19:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:21,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2022-11-19 08:19:21,543 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:19:21,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:21,898 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2356 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2356) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_2356 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2356) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:19:22,264 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2353 Int) (v_ArrVal_2356 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2353) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2356) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2353 Int) (v_ArrVal_2356 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2353) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2356) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-19 08:19:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-19 08:19:41,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723296651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:19:41,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725038604] [2022-11-19 08:19:41,761 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:19:41,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:41,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 40 [2022-11-19 08:19:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228587897] [2022-11-19 08:19:41,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:19:41,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-19 08:19:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:19:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-19 08:19:41,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1248, Unknown=39, NotChecked=154, Total=1722 [2022-11-19 08:19:41,763 INFO L87 Difference]: Start difference. First operand 622 states and 1282 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 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:19:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:52,686 INFO L93 Difference]: Finished difference Result 999 states and 1960 transitions. [2022-11-19 08:19:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-19 08:19:52,687 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 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 22 [2022-11-19 08:19:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:52,689 INFO L225 Difference]: With dead ends: 999 [2022-11-19 08:19:52,689 INFO L226 Difference]: Without dead ends: 999 [2022-11-19 08:19:52,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 19 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=637, Invalid=2522, Unknown=41, NotChecked=222, Total=3422 [2022-11-19 08:19:52,690 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 210 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1272 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:52,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 100 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 462 Invalid, 0 Unknown, 1272 Unchecked, 1.6s Time] [2022-11-19 08:19:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-11-19 08:19:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 906. [2022-11-19 08:19:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 896 states have (on average 1.9944196428571428) internal successors, (1787), 905 states have internal predecessors, (1787), 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:19:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1787 transitions. [2022-11-19 08:19:52,711 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1787 transitions. Word has length 22 [2022-11-19 08:19:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:52,712 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1787 transitions. [2022-11-19 08:19:52,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 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:19:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1787 transitions. [2022-11-19 08:19:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:19:52,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:52,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 08:19:52,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:52,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-19 08:19:52,930 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:19:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1101303214, now seen corresponding path program 11 times [2022-11-19 08:19:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:19:52,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083629349] [2022-11-19 08:19:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:19:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:56,624 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:19:56,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:19:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083629349] [2022-11-19 08:19:56,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083629349] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993711769] [2022-11-19 08:19:56,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:19:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:56,627 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:56,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-19 08:19:57,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 08:19:57,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:19:57,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-19 08:19:57,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:57,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-19 08:19:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-19 08:19:57,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:57,495 INFO L321 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2022-11-19 08:19:57,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 62 [2022-11-19 08:19:57,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-19 08:19:58,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:19:58,210 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 08:19:58,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-19 08:19:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:58,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:19:58,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 08:19:59,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 08:19:59,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:19:59,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:19:59,508 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-19 08:19:59,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-19 08:19:59,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 08:20:00,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-19 08:20:00,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-19 08:20:00,351 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:20:00,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:20:00,484 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2474 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2474 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-19 08:20:00,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2474 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_2474 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:20:00,842 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2470 Int) (v_ArrVal_2474 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2470) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2470 Int) (v_ArrVal_2474 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2470) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-19 08:20:00,894 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_2469))) (store (store .cse0 .cse1 v_ArrVal_2470) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_2469))) (store (store .cse6 .cse1 v_ArrVal_2470) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-19 08:20:02,935 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse3 .cse2)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (or (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2469))) (store (store .cse0 .cse1 v_ArrVal_2470) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| .cse4)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| .cse4)) (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2469))) (store (store .cse5 .cse1 v_ArrVal_2470) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2022-11-19 08:20:03,002 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2467 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2469))) (store (store .cse1 .cse2 v_ArrVal_2470) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| (select .cse4 .cse3))))))) (forall ((v_ArrVal_2467 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2469))) (store (store .cse6 .cse2 v_ArrVal_2470) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| (select .cse7 .cse3))))))))) is different from false [2022-11-19 08:20:03,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_2467 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| (select .cse0 .cse1))) (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2469))) (store (store .cse3 .cse4 v_ArrVal_2470) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_2467 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2467))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2470 Int) (v_ArrVal_2469 Int) (v_ArrVal_2474 (Array Int Int))) (<= (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2469))) (store (store .cse7 .cse4 v_ArrVal_2470) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2474) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| (select .cse8 .cse1))))))))) is different from false [2022-11-19 08:20:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-19 08:20:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993711769] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:20:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1989880436] [2022-11-19 08:20:51,181 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:20:51,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:20:51,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 38 [2022-11-19 08:20:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089971167] [2022-11-19 08:20:51,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:20:51,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-19 08:20:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:20:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-19 08:20:51,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=897, Unknown=49, NotChecked=476, Total=1560 [2022-11-19 08:20:51,185 INFO L87 Difference]: Start difference. First operand 906 states and 1787 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 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:21:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:16,538 INFO L93 Difference]: Finished difference Result 1633 states and 3242 transitions. [2022-11-19 08:21:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-19 08:21:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 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 22 [2022-11-19 08:21:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:16,542 INFO L225 Difference]: With dead ends: 1633 [2022-11-19 08:21:16,542 INFO L226 Difference]: Without dead ends: 1633 [2022-11-19 08:21:16,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 25 SyntacticMatches, 37 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=493, Invalid=2455, Unknown=50, NotChecked=784, Total=3782 [2022-11-19 08:21:16,544 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 701 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2117 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:16,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 201 Invalid, 4091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1852 Invalid, 0 Unknown, 2117 Unchecked, 5.6s Time] [2022-11-19 08:21:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-19 08:21:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 774. [2022-11-19 08:21:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 764 states have (on average 2.0654450261780104) internal successors, (1578), 773 states have internal predecessors, (1578), 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:21:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1578 transitions. [2022-11-19 08:21:16,568 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1578 transitions. Word has length 22 [2022-11-19 08:21:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:16,569 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1578 transitions. [2022-11-19 08:21:16,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 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:21:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1578 transitions. [2022-11-19 08:21:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:21:16,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:16,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:16,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-19 08:21:16,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:21:16,778 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:21:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1378414052, now seen corresponding path program 1 times [2022-11-19 08:21:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:21:16,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103221655] [2022-11-19 08:21:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:21:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:16,903 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:21:16,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:21:16,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103221655] [2022-11-19 08:21:16,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103221655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:21:16,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110078322] [2022-11-19 08:21:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:16,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:21:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:21:16,905 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:21:16,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-19 08:21:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:17,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:21:17,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:17,309 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:21:17,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:21:17,455 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:21:17,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110078322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:21:17,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1846287708] [2022-11-19 08:21:17,457 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:21:17,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:21:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-19 08:21:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865474426] [2022-11-19 08:21:17,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:21:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:21:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:21:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:21:17,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:21:17,461 INFO L87 Difference]: Start difference. First operand 774 states and 1578 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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:21:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:21:18,022 INFO L93 Difference]: Finished difference Result 988 states and 1976 transitions. [2022-11-19 08:21:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:21:18,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 30 [2022-11-19 08:21:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:21:18,025 INFO L225 Difference]: With dead ends: 988 [2022-11-19 08:21:18,025 INFO L226 Difference]: Without dead ends: 988 [2022-11-19 08:21:18,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:21:18,025 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 133 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:21:18,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 21 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 08:21:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2022-11-19 08:21:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 968. [2022-11-19 08:21:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 958 states have (on average 2.046972860125261) internal successors, (1961), 967 states have internal predecessors, (1961), 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:21:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1961 transitions. [2022-11-19 08:21:18,045 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1961 transitions. Word has length 30 [2022-11-19 08:21:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:21:18,045 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1961 transitions. [2022-11-19 08:21:18,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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:21:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1961 transitions. [2022-11-19 08:21:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:21:18,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:21:18,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-19 08:21:18,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-19 08:21:18,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-19 08:21:18,254 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-19 08:21:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1043252373, now seen corresponding path program 12 times [2022-11-19 08:21:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:21:18,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470715962] [2022-11-19 08:21:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:21:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:21:21,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:21:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470715962] [2022-11-19 08:21:21,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470715962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:21:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832471051] [2022-11-19 08:21:21,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:21:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:21:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:21:21,727 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:21:21,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_426250c8-a1cd-44f7-b4a1-fc1e8425f4dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-19 08:21:22,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:21:22,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:21:22,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-19 08:21:22,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:22,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:22,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:22,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:22,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:21:22,132 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:21:22,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-19 08:21:22,161 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:21:22,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:21:22,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-19 08:21:22,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-19 08:21:23,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-19 08:21:23,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:23,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-19 08:21:24,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-19 08:21:24,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-19 08:21:25,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-11-19 08:21:25,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:25,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2022-11-19 08:21:26,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-11-19 08:21:27,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2022-11-19 08:21:32,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2022-11-19 08:21:32,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-11-19 08:21:33,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:33,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-19 08:21:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:21:33,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:21:33,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:21:33,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-11-19 08:21:33,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:21:33,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-11-19 08:21:33,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-19 08:21:33,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:21:34,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-19 08:21:34,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:21:34,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:21:34,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-19 08:21:40,872 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:21:47,230 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:22:01,741 WARN L233 SmtUtils]: Spent 14.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:22:11,180 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:22:25,516 WARN L233 SmtUtils]: Spent 9.36s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:22:34,855 WARN L233 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:23:24,132 WARN L233 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:23:43,277 WARN L233 SmtUtils]: Spent 14.20s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:24:19,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:24:19,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 742 treesize of output 746 [2022-11-19 08:24:28,208 WARN L233 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:24:52,442 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 156 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:24:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:24:52,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832471051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:24:52,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298576888] [2022-11-19 08:24:52,729 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:24:52,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:24:52,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 53 [2022-11-19 08:24:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662819863] [2022-11-19 08:24:52,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:24:52,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-19 08:24:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:24:52,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-19 08:24:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2471, Unknown=119, NotChecked=0, Total=2970 [2022-11-19 08:24:52,734 INFO L87 Difference]: Start difference. First operand 968 states and 1961 transitions. Second operand has 55 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 54 states have internal predecessors, (90), 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:25:04,724 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 136 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:25:30,808 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:25:35,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse22 (select .cse9 .cse11))) (let ((.cse13 (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (.cse2 (+ .cse22 1)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (* .cse22 4)) (.cse15 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse16 (forall ((v_prenex_49 Int) (v_prenex_50 (Array Int Int)) (v_prenex_48 Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_42 (Array Int Int)) (v_prenex_47 Int) (v_prenex_46 Int) (v_prenex_41 Int) (v_prenex_43 Int)) (let ((.cse36 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_43) .cse11 v_prenex_44)) |c_~#stored_elements~0.base| v_prenex_42))) (let ((.cse34 (select .cse36 |c_~#queue~0.base|))) (let ((.cse35 (store .cse34 (+ (* v_prenex_49 4) |c_~#queue~0.offset|) v_prenex_46))) (let ((.cse32 (select (store (store .cse36 |c_~#queue~0.base| (store (store .cse35 .cse8 v_prenex_47) .cse1 v_prenex_48)) |c_~#stored_elements~0.base| v_prenex_50) |c_~#queue~0.base|)) (.cse31 (+ (* v_prenex_45 4) |c_~#queue~0.offset|)) (.cse33 (select .cse35 .cse1))) (or (not (<= 0 .cse31)) (not (<= v_prenex_45 (select .cse32 .cse1))) (< (+ .cse33 1) v_prenex_48) (not (<= v_prenex_49 (select .cse34 .cse1))) (<= 0 (+ (* (select (store .cse32 .cse31 v_prenex_41) .cse1) 4) |c_~#queue~0.offset| 4)) (= 400 .cse33) (< .cse2 v_prenex_44)))))))) (.cse14 (select |c_#length| |c_~#queue~0.base|)) (.cse21 (or .cse13 (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2697 Int) (v_ArrVal_2699 Int) (v_ArrVal_2701 Int) (v_ArrVal_2704 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1337| Int) (v_ArrVal_2705 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_2695) .cse11 v_ArrVal_2697)) |c_~#stored_elements~0.base| v_ArrVal_2698))) (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (let ((.cse29 (store .cse30 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1337| 4)) v_ArrVal_2699))) (let ((.cse27 (select .cse29 .cse1))) (or (= 400 .cse27) (< .cse2 v_ArrVal_2697) (< (+ (* (select (select (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse8 v_ArrVal_2701) .cse1 v_ArrVal_2704)) |c_~#stored_elements~0.base| v_ArrVal_2705) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) 0) (< (+ .cse27 1) v_ArrVal_2704) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1337| (select .cse30 .cse1)))))))))))) (and (forall ((v_prenex_38 Int) (v_ArrVal_2706 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_40 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| Int) (v_prenex_33 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_34) .cse11 v_prenex_35)) |c_~#stored_elements~0.base| v_prenex_33))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* v_prenex_39 4) |c_~#queue~0.offset|) v_prenex_36))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 v_prenex_37) .cse1 v_prenex_38)) |c_~#stored_elements~0.base| v_prenex_40) |c_~#queue~0.base|)) (.cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| 4) |c_~#queue~0.offset|)) (.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| (select .cse0 .cse1))) (< .cse2 v_prenex_35) (< (+ .cse3 1) v_prenex_38) (not (<= 0 .cse4)) (< (+ |c_~#queue~0.offset| (* (select (store .cse0 .cse4 v_ArrVal_2706) .cse1) 4)) (+ 1605 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (= 400 .cse3) (not (<= v_prenex_39 (select .cse5 .cse1))))))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (<= 0 (+ .cse12 |c_~#queue~0.offset| 4)) .cse13 (<= (+ .cse12 |c_~#queue~0.offset| 8) .cse14) .cse15 .cse16 (or .cse15 (and .cse16 (forall ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_40 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_34) .cse11 v_prenex_35)) |c_~#stored_elements~0.base| v_prenex_33))) (let ((.cse18 (select .cse19 |c_~#queue~0.base|))) (let ((.cse20 (store .cse18 (+ (* v_prenex_39 4) |c_~#queue~0.offset|) v_prenex_36))) (let ((.cse17 (select .cse20 .cse1))) (or (< .cse2 v_prenex_35) (< (+ .cse17 1) v_prenex_38) (= 400 .cse17) (not (<= v_prenex_39 (select .cse18 .cse1))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse8 v_prenex_37) .cse1 v_prenex_38)) |c_~#stored_elements~0.base| v_prenex_40) |c_~#queue~0.base|) .cse1) 4)) 0))))))) .cse21)) (or (= 400 .cse22) (and (forall ((v_ArrVal_2706 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| Int) (v_ArrVal_2701 Int) (v_ArrVal_2704 Int) (v_ArrVal_2705 (Array Int Int))) (let ((.cse23 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| 4) |c_~#queue~0.offset|)) (.cse24 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_2701) .cse11 v_ArrVal_2704)) |c_~#stored_elements~0.base| v_ArrVal_2705) |c_~#queue~0.base|))) (or (< .cse2 v_ArrVal_2704) (not (<= 0 .cse23)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store .cse24 .cse23 v_ArrVal_2706) .cse1) 4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| (select .cse24 .cse1)))))) (forall ((v_ArrVal_2706 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| Int) (v_ArrVal_2701 Int) (v_ArrVal_2704 Int) (v_ArrVal_2705 (Array Int Int))) (let ((.cse26 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| 4) |c_~#queue~0.offset|)) (.cse25 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_2701) .cse11 v_ArrVal_2704)) |c_~#stored_elements~0.base| v_ArrVal_2705) |c_~#queue~0.base|))) (or (<= (+ |c_~#queue~0.offset| 8 (* (select (store .cse25 .cse26 v_ArrVal_2706) .cse1) 4)) .cse14) (< .cse2 v_ArrVal_2704) (not (<= 0 .cse26)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1335| (select .cse25 .cse1)))))) (or (forall ((v_ArrVal_2701 Int) (v_ArrVal_2704 Int) (v_ArrVal_2705 (Array Int Int))) (or (< .cse2 v_ArrVal_2704) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_2701) .cse11 v_ArrVal_2704)) |c_~#stored_elements~0.base| v_ArrVal_2705) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) 0))) .cse13))) .cse21))))) is different from false