./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 11:27:59,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:27:59,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:27:59,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:27:59,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:27:59,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:27:59,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:27:59,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:27:59,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:27:59,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:27:59,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:27:59,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:27:59,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:27:59,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:27:59,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:27:59,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:27:59,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:27:59,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:27:59,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:27:59,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:27:59,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:27:59,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:27:59,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:27:59,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:27:59,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:27:59,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:27:59,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:27:59,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:27:59,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:27:59,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:27:59,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:27:59,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:27:59,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:27:59,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:27:59,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:27:59,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:27:59,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:27:59,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:27:59,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:27:59,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:27:59,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:27:59,355 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 11:27:59,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:27:59,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:27:59,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:27:59,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:27:59,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:27:59,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:27:59,372 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:27:59,372 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:27:59,372 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:27:59,372 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:27:59,373 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:27:59,373 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:27:59,373 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:27:59,373 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:27:59,373 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:27:59,373 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:27:59,373 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:27:59,374 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:27:59,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 11:27:59,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 11:27:59,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:27:59,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:27:59,375 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:27:59,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:27:59,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:27:59,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:27:59,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:27:59,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:27:59,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:27:59,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:27:59,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:27:59,377 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:27:59,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:27:59,378 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:27:59,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:27:59,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:27:59,378 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_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/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_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh 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-12-14 11:27:59,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:27:59,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:27:59,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:27:59,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:27:59,570 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:27:59,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-14 11:28:02,089 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:28:02,300 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:28:02,301 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-14 11:28:02,311 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/data/a10999967/5a153df89f704b79a272b52c56322183/FLAG7eca85d7b [2022-12-14 11:28:02,676 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/data/a10999967/5a153df89f704b79a272b52c56322183 [2022-12-14 11:28:02,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:28:02,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:28:02,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:28:02,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:28:02,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:28:02,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:28:02" (1/1) ... [2022-12-14 11:28:02,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7984ef94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:02, skipping insertion in model container [2022-12-14 11:28:02,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:28:02" (1/1) ... [2022-12-14 11:28:02,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:28:02,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:28:03,028 WARN L237 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_1153e101-e596-4515-b72a-79ee76ab7071/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-14 11:28:03,031 WARN L237 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_1153e101-e596-4515-b72a-79ee76ab7071/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-14 11:28:03,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:28:03,043 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:28:03,075 WARN L237 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_1153e101-e596-4515-b72a-79ee76ab7071/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-14 11:28:03,078 WARN L237 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_1153e101-e596-4515-b72a-79ee76ab7071/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-14 11:28:03,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:28:03,115 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:28:03,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03 WrapperNode [2022-12-14 11:28:03,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:28:03,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:28:03,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:28:03,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:28:03,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,163 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-14 11:28:03,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:28:03,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:28:03,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:28:03,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:28:03,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,190 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:28:03,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:28:03,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:28:03,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:28:03,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (1/1) ... [2022-12-14 11:28:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:28:03,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:28:03,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:28:03,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 11:28:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 11:28:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 11:28:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:28:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:28:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:28:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:28:03,252 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:28:03,378 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:28:03,380 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:28:03,757 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:28:03,769 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:28:03,769 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 11:28:03,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:28:03 BoogieIcfgContainer [2022-12-14 11:28:03,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:28:03,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:28:03,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:28:03,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:28:03,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:28:02" (1/3) ... [2022-12-14 11:28:03,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a21379f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:28:03, skipping insertion in model container [2022-12-14 11:28:03,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:28:03" (2/3) ... [2022-12-14 11:28:03,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a21379f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:28:03, skipping insertion in model container [2022-12-14 11:28:03,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:28:03" (3/3) ... [2022-12-14 11:28:03,780 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-12-14 11:28:03,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:28:03,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-12-14 11:28:03,797 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:28:03,886 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 11:28:03,911 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:28:03,921 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-12-14 11:28:03,923 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-12-14 11:28:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-12-14 11:28:03,993 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-12-14 11:28:03,993 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 11:28:03,999 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 681 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-12-14 11:28:04,004 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-12-14 11:28:18,872 INFO L134 LiptonReduction]: Checked pairs total: 62426 [2022-12-14 11:28:18,872 INFO L136 LiptonReduction]: Total number of compositions: 471 [2022-12-14 11:28:18,878 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-12-14 11:28:19,036 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-12-14 11:28:19,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:28:19,059 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;@56e42202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:28:19,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-14 11:28:19,069 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-12-14 11:28:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 11:28:19,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:19,074 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 11:28:19,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2022-12-14 11:28:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964420368] [2022-12-14 11:28:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:19,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:19,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964420368] [2022-12-14 11:28:19,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964420368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:19,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:19,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 11:28:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440289830] [2022-12-14 11:28:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:19,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 11:28:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 11:28:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:28:19,207 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-12-14 11:28:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:19,350 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-12-14 11:28:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 11:28:19,352 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-12-14 11:28:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:19,381 INFO L225 Difference]: With dead ends: 2668 [2022-12-14 11:28:19,381 INFO L226 Difference]: Without dead ends: 2668 [2022-12-14 11:28:19,381 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-12-14 11:28:19,385 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:19,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-12-14 11:28:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-12-14 11:28:19,520 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-12-14 11:28:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-12-14 11:28:19,535 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-12-14 11:28:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:19,536 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-12-14 11:28:19,536 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-12-14 11:28:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-12-14 11:28:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 11:28:19,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:19,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 11:28:19,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:28:19,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1292025, now seen corresponding path program 1 times [2022-12-14 11:28:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:19,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448977345] [2022-12-14 11:28:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:19,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:19,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:19,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448977345] [2022-12-14 11:28:19,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448977345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:19,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:19,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269717839] [2022-12-14 11:28:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:19,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:19,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:19,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:19,755 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-12-14 11:28:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:19,868 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-12-14 11:28:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:19,869 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-12-14 11:28:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:19,884 INFO L225 Difference]: With dead ends: 2618 [2022-12-14 11:28:19,884 INFO L226 Difference]: Without dead ends: 2618 [2022-12-14 11:28:19,885 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-12-14 11:28:19,886 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-12-14 11:28:19,886 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-12-14 11:28:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-12-14 11:28:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-12-14 11:28:19,948 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-12-14 11:28:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-12-14 11:28:19,955 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-12-14 11:28:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:19,955 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-12-14 11:28:19,956 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-12-14 11:28:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-12-14 11:28:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 11:28:19,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:19,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 11:28:19,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:28:19,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1292026, now seen corresponding path program 1 times [2022-12-14 11:28:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:19,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445273881] [2022-12-14 11:28:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:20,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:20,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445273881] [2022-12-14 11:28:20,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445273881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:20,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:20,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900565288] [2022-12-14 11:28:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:20,020 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-12-14 11:28:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:20,117 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-12-14 11:28:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:20,118 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-12-14 11:28:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:20,148 INFO L225 Difference]: With dead ends: 2568 [2022-12-14 11:28:20,149 INFO L226 Difference]: Without dead ends: 2568 [2022-12-14 11:28:20,149 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-12-14 11:28:20,150 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-12-14 11:28:20,151 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-12-14 11:28:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-12-14 11:28:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-12-14 11:28:20,213 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-12-14 11:28:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-12-14 11:28:20,220 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-12-14 11:28:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:20,221 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-12-14 11:28:20,221 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-12-14 11:28:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-12-14 11:28:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:28:20,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:20,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:28:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:28:20,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1241664194, now seen corresponding path program 1 times [2022-12-14 11:28:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:20,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476165042] [2022-12-14 11:28:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:20,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:20,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476165042] [2022-12-14 11:28:20,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476165042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:20,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:20,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:28:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340103562] [2022-12-14 11:28:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:20,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:28:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:20,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:28:20,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:28:20,320 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 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-12-14 11:28:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:20,430 INFO L93 Difference]: Finished difference Result 1952 states and 5508 transitions. [2022-12-14 11:28:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:20,431 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-12-14 11:28:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:20,449 INFO L225 Difference]: With dead ends: 1952 [2022-12-14 11:28:20,449 INFO L226 Difference]: Without dead ends: 1952 [2022-12-14 11:28:20,450 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-12-14 11:28:20,450 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:20,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-12-14 11:28:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-12-14 11:28:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1760 states have (on average 3.1295454545454544) internal successors, (5508), 1951 states have internal predecessors, (5508), 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-12-14 11:28:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5508 transitions. [2022-12-14 11:28:20,504 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5508 transitions. Word has length 5 [2022-12-14 11:28:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:20,505 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5508 transitions. [2022-12-14 11:28:20,505 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-12-14 11:28:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5508 transitions. [2022-12-14 11:28:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:28:20,506 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:20,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:28:20,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:28:20,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1241664195, now seen corresponding path program 1 times [2022-12-14 11:28:20,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:20,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827676454] [2022-12-14 11:28:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:20,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:20,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827676454] [2022-12-14 11:28:20,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827676454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:20,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:20,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546268387] [2022-12-14 11:28:20,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:20,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:20,609 INFO L87 Difference]: Start difference. First operand 1952 states and 5508 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-12-14 11:28:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:20,702 INFO L93 Difference]: Finished difference Result 1336 states and 3538 transitions. [2022-12-14 11:28:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:20,703 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-12-14 11:28:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:20,711 INFO L225 Difference]: With dead ends: 1336 [2022-12-14 11:28:20,711 INFO L226 Difference]: Without dead ends: 1336 [2022-12-14 11:28:20,711 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-12-14 11:28:20,712 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:20,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-12-14 11:28:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-12-14 11:28:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1240 states have (on average 2.8532258064516127) internal successors, (3538), 1335 states have internal predecessors, (3538), 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-12-14 11:28:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3538 transitions. [2022-12-14 11:28:20,758 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3538 transitions. Word has length 5 [2022-12-14 11:28:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:20,758 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 3538 transitions. [2022-12-14 11:28:20,759 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-12-14 11:28:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3538 transitions. [2022-12-14 11:28:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:28:20,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:20,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:28:20,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:28:20,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1241578542, now seen corresponding path program 1 times [2022-12-14 11:28:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:20,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104989718] [2022-12-14 11:28:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:20,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:20,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104989718] [2022-12-14 11:28:20,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104989718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:20,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:20,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823719704] [2022-12-14 11:28:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:20,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:20,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:20,901 INFO L87 Difference]: Start difference. First operand 1336 states and 3538 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-12-14 11:28:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:20,992 INFO L93 Difference]: Finished difference Result 1190 states and 3162 transitions. [2022-12-14 11:28:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:20,993 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-12-14 11:28:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:20,997 INFO L225 Difference]: With dead ends: 1190 [2022-12-14 11:28:20,997 INFO L226 Difference]: Without dead ends: 1190 [2022-12-14 11:28:20,997 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-12-14 11:28:20,998 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:20,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-12-14 11:28:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-12-14 11:28:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1120 states have (on average 2.8232142857142857) internal successors, (3162), 1189 states have internal predecessors, (3162), 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-12-14 11:28:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3162 transitions. [2022-12-14 11:28:21,030 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3162 transitions. Word has length 5 [2022-12-14 11:28:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:21,030 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3162 transitions. [2022-12-14 11:28:21,030 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-12-14 11:28:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3162 transitions. [2022-12-14 11:28:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:28:21,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:21,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:28:21,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:28:21,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1241578538, now seen corresponding path program 1 times [2022-12-14 11:28:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:21,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340704555] [2022-12-14 11:28:21,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:21,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:21,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340704555] [2022-12-14 11:28:21,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340704555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:21,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:21,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313300328] [2022-12-14 11:28:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:21,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:21,584 INFO L87 Difference]: Start difference. First operand 1190 states and 3162 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-12-14 11:28:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:21,833 INFO L93 Difference]: Finished difference Result 1197 states and 3177 transitions. [2022-12-14 11:28:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:21,834 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-12-14 11:28:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:21,837 INFO L225 Difference]: With dead ends: 1197 [2022-12-14 11:28:21,837 INFO L226 Difference]: Without dead ends: 1197 [2022-12-14 11:28:21,837 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-12-14 11:28:21,838 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:21,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:28:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2022-12-14 11:28:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1191. [2022-12-14 11:28:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1121 states have (on average 2.824264049955397) internal successors, (3166), 1190 states have internal predecessors, (3166), 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-12-14 11:28:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3166 transitions. [2022-12-14 11:28:21,857 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3166 transitions. Word has length 5 [2022-12-14 11:28:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:21,857 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 3166 transitions. [2022-12-14 11:28:21,857 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-12-14 11:28:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3166 transitions. [2022-12-14 11:28:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:28:21,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:21,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:28:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:28:21,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1241578541, now seen corresponding path program 1 times [2022-12-14 11:28:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:21,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286315896] [2022-12-14 11:28:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:21,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286315896] [2022-12-14 11:28:21,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286315896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:21,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:21,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279898932] [2022-12-14 11:28:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:21,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:21,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:21,977 INFO L87 Difference]: Start difference. First operand 1191 states and 3166 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-12-14 11:28:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:22,049 INFO L93 Difference]: Finished difference Result 1011 states and 2701 transitions. [2022-12-14 11:28:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:22,050 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-12-14 11:28:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:22,054 INFO L225 Difference]: With dead ends: 1011 [2022-12-14 11:28:22,054 INFO L226 Difference]: Without dead ends: 1011 [2022-12-14 11:28:22,055 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-12-14 11:28:22,055 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:22,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-12-14 11:28:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-12-14 11:28:22,077 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-12-14 11:28:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-12-14 11:28:22,080 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-12-14 11:28:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:22,080 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-12-14 11:28:22,081 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-12-14 11:28:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-12-14 11:28:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:28:22,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:22,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:28:22,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:28:22,082 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-12-14 11:28:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash -162937382, now seen corresponding path program 1 times [2022-12-14 11:28:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785672383] [2022-12-14 11:28:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:22,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:22,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785672383] [2022-12-14 11:28:22,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785672383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:22,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:22,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:28:22,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57021778] [2022-12-14 11:28:22,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:22,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:28:22,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:22,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:28:22,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:28:22,549 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-12-14 11:28:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:22,666 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-12-14 11:28:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:28:22,666 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-12-14 11:28:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:22,670 INFO L225 Difference]: With dead ends: 1286 [2022-12-14 11:28:22,670 INFO L226 Difference]: Without dead ends: 1286 [2022-12-14 11:28:22,670 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-12-14 11:28:22,671 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:22,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 8 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-12-14 11:28:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-12-14 11:28:22,687 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-12-14 11:28:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-12-14 11:28:22,689 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-12-14 11:28:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:22,690 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-12-14 11:28:22,690 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-12-14 11:28:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-12-14 11:28:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:28:22,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:22,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:28:22,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:28:22,690 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-12-14 11:28:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -165767867, now seen corresponding path program 1 times [2022-12-14 11:28:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:22,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498731259] [2022-12-14 11:28:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:22,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:22,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498731259] [2022-12-14 11:28:22,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498731259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:22,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:22,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:28:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674815898] [2022-12-14 11:28:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:22,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:28:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:22,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:28:22,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:28:22,809 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-12-14 11:28:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:22,966 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-12-14 11:28:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:28:22,966 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-12-14 11:28:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:22,970 INFO L225 Difference]: With dead ends: 1280 [2022-12-14 11:28:22,970 INFO L226 Difference]: Without dead ends: 1280 [2022-12-14 11:28:22,970 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-12-14 11:28:22,970 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:22,971 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.1s Time] [2022-12-14 11:28:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-12-14 11:28:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-12-14 11:28:22,987 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-12-14 11:28:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-12-14 11:28:22,989 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-12-14 11:28:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:22,989 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-12-14 11:28:22,989 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-12-14 11:28:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-12-14 11:28:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:28:22,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:22,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:28:22,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:28:22,990 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-12-14 11:28:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1693624956, now seen corresponding path program 1 times [2022-12-14 11:28:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:22,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627205776] [2022-12-14 11:28:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:23,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627205776] [2022-12-14 11:28:23,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627205776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:23,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:23,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:28:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189075033] [2022-12-14 11:28:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:23,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:23,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:23,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:23,057 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-12-14 11:28:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:23,139 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-12-14 11:28:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:23,139 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-12-14 11:28:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:23,141 INFO L225 Difference]: With dead ends: 434 [2022-12-14 11:28:23,141 INFO L226 Difference]: Without dead ends: 426 [2022-12-14 11:28:23,142 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-12-14 11:28:23,142 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:23,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-12-14 11:28:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-12-14 11:28:23,152 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-12-14 11:28:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-12-14 11:28:23,154 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-12-14 11:28:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:23,154 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-12-14 11:28:23,154 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-12-14 11:28:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-12-14 11:28:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 11:28:23,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:23,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:28:23,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:28:23,156 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-12-14 11:28:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash 71888343, now seen corresponding path program 1 times [2022-12-14 11:28:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278448478] [2022-12-14 11:28:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:23,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:23,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278448478] [2022-12-14 11:28:23,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278448478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:23,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:23,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:28:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331284294] [2022-12-14 11:28:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:23,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:28:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:23,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:28:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:28:23,229 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-12-14 11:28:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:23,286 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-12-14 11:28:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:28:23,287 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-12-14 11:28:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:23,288 INFO L225 Difference]: With dead ends: 380 [2022-12-14 11:28:23,288 INFO L226 Difference]: Without dead ends: 380 [2022-12-14 11:28:23,289 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-12-14 11:28:23,289 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 11:28:23,289 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-12-14 11:28:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-14 11:28:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-12-14 11:28:23,298 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-12-14 11:28:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-12-14 11:28:23,300 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-12-14 11:28:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:23,300 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-12-14 11:28:23,300 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-12-14 11:28:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-12-14 11:28:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 11:28:23,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:23,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:28:23,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:28:23,302 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-12-14 11:28:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 71888344, now seen corresponding path program 1 times [2022-12-14 11:28:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:23,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361658006] [2022-12-14 11:28:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:23,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:23,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361658006] [2022-12-14 11:28:23,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361658006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:28:23,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:28:23,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:28:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556435363] [2022-12-14 11:28:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:28:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:28:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:28:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:28:23,456 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-14 11:28:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:23,553 INFO L93 Difference]: Finished difference Result 476 states and 1106 transitions. [2022-12-14 11:28:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:28:23,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-14 11:28:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:23,555 INFO L225 Difference]: With dead ends: 476 [2022-12-14 11:28:23,555 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 11:28:23,555 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-12-14 11:28:23,556 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:23,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:28:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 11:28:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-12-14 11:28:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 466 states have (on average 2.3733905579399144) internal successors, (1106), 475 states have internal predecessors, (1106), 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-12-14 11:28:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1106 transitions. [2022-12-14 11:28:23,567 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1106 transitions. Word has length 11 [2022-12-14 11:28:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:23,567 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 1106 transitions. [2022-12-14 11:28:23,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-14 11:28:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1106 transitions. [2022-12-14 11:28:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:28:23,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:23,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:28:23,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:28:23,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:28:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2066425700, now seen corresponding path program 1 times [2022-12-14 11:28:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:23,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959986023] [2022-12-14 11:28:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:23,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-12-14 11:28:23,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:23,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959986023] [2022-12-14 11:28:23,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959986023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:28:23,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450794543] [2022-12-14 11:28:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:23,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:28:23,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:28:23,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:28:23,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:28:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:23,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 11:28:23,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:28:24,112 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-12-14 11:28:24,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:28:24,154 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-12-14 11:28:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:24,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:28:24,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_411) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_411) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:28:24,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:28:24,223 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-12-14 11:28:24,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:28:24,233 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 50 treesize of output 49 [2022-12-14 11:28:24,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 11:28:24,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:28:24,264 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-12-14 11:28:24,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:28:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:28:24,270 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 24 treesize of output 12 [2022-12-14 11:28:24,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:28:24,320 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 32 treesize of output 36 [2022-12-14 11:28:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:24,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450794543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:28:24,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [977511150] [2022-12-14 11:28:24,390 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:337) 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-12-14 11:28:24,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:28:24,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-14 11:28:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566892301] [2022-12-14 11:28:24,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:28:24,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 11:28:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 11:28:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=181, Unknown=1, NotChecked=28, Total=272 [2022-12-14 11:28:24,393 INFO L87 Difference]: Start difference. First operand 476 states and 1106 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-12-14 11:28:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:28:24,837 INFO L93 Difference]: Finished difference Result 724 states and 1658 transitions. [2022-12-14 11:28:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:28:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-12-14 11:28:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:28:24,838 INFO L225 Difference]: With dead ends: 724 [2022-12-14 11:28:24,838 INFO L226 Difference]: Without dead ends: 724 [2022-12-14 11:28:24,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=360, Unknown=1, NotChecked=42, Total=552 [2022-12-14 11:28:24,839 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 400 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:28:24,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 42 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 372 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2022-12-14 11:28:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-12-14 11:28:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 512. [2022-12-14 11:28:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 502 states have (on average 2.412350597609562) internal successors, (1211), 511 states have internal predecessors, (1211), 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-12-14 11:28:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1211 transitions. [2022-12-14 11:28:24,847 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1211 transitions. Word has length 12 [2022-12-14 11:28:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:28:24,847 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1211 transitions. [2022-12-14 11:28:24,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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-12-14 11:28:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1211 transitions. [2022-12-14 11:28:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:28:24,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:28:24,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:28:24,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:28:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 11:28:25,049 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-12-14 11:28:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:28:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash 325161961, now seen corresponding path program 1 times [2022-12-14 11:28:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:28:25,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975431967] [2022-12-14 11:28:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:28:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:25,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:28:25,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975431967] [2022-12-14 11:28:25,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975431967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:28:25,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233947295] [2022-12-14 11:28:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:28:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:28:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:28:25,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:28:25,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:28:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:28:25,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 11:28:25,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:28:25,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:28:25,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:28:25,862 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 11:28:25,863 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 28 treesize of output 36 [2022-12-14 11:28:25,872 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 11:28:25,872 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-12-14 11:28:25,956 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-12-14 11:28:26,062 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-12-14 11:28:26,208 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-12-14 11:28:26,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:28:26,266 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-12-14 11:28:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:26,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:28:26,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_501 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_501 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:28:26,350 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_501 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_501 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:28:26,430 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_501 (Array Int Int)) (v_ArrVal_497 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_497) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_497) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-12-14 11:28:26,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:28:26,443 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-12-14 11:28:28,579 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_501 (Array Int Int)) (v_ArrVal_497 Int)) (< (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_497) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_2) .cse2 .cse3)) |c_~#stored_elements~0.base| v_prenex_1) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-12-14 11:28:30,616 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 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_2 Int) (v_ArrVal_495 Int) (v_prenex_1 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_495))) (store (store .cse0 .cse1 v_prenex_2) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_1) |c_~#queue~0.base|) .cse5))))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int)) (< (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_495))) (store (store .cse6 .cse1 v_ArrVal_497) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|) .cse5) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-12-14 11:28:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:28:32,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233947295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:28:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1873970046] [2022-12-14 11:28:32,854 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:337) 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-12-14 11:28:32,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:28:32,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-14 11:28:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448726844] [2022-12-14 11:28:32,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:28:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 11:28:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:28:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 11:28:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=294, Unknown=13, NotChecked=200, Total=600 [2022-12-14 11:28:32,856 INFO L87 Difference]: Start difference. First operand 512 states and 1211 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 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-12-14 11:28:48,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:28:50,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:28:52,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:28:54,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:28:56,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:29:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:29:01,357 INFO L93 Difference]: Finished difference Result 970 states and 2287 transitions. [2022-12-14 11:29:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 11:29:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 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-12-14 11:29:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:29:01,360 INFO L225 Difference]: With dead ends: 970 [2022-12-14 11:29:01,360 INFO L226 Difference]: Without dead ends: 970 [2022-12-14 11:29:01,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=224, Invalid=897, Unknown=21, NotChecked=340, Total=1482 [2022-12-14 11:29:01,360 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 204 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 31 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 982 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:29:01,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 104 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 796 Invalid, 59 Unknown, 982 Unchecked, 14.4s Time] [2022-12-14 11:29:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-12-14 11:29:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 632. [2022-12-14 11:29:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 622 states have (on average 2.440514469453376) internal successors, (1518), 631 states have internal predecessors, (1518), 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-12-14 11:29:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1518 transitions. [2022-12-14 11:29:01,370 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1518 transitions. Word has length 13 [2022-12-14 11:29:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:29:01,370 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1518 transitions. [2022-12-14 11:29:01,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 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-12-14 11:29:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1518 transitions. [2022-12-14 11:29:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:29:01,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:29:01,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:29:01,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:29:01,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 11:29:01,571 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-12-14 11:29:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:29:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1579307623, now seen corresponding path program 1 times [2022-12-14 11:29:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:29:01,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547610686] [2022-12-14 11:29:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:29:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:29:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:29:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:02,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:29:02,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547610686] [2022-12-14 11:29:02,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547610686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:29:02,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516401054] [2022-12-14 11:29:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:29:02,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:29:02,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:29:02,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:29:02,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:29:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:29:02,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 11:29:02,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:29:02,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:02,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:02,567 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 11:29:02,567 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 28 treesize of output 36 [2022-12-14 11:29:02,598 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 11:29:02,598 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-12-14 11:29:02,680 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-12-14 11:29:02,849 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-12-14 11:29:03,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 42 treesize of output 37 [2022-12-14 11:29:03,311 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-12-14 11:29:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:03,400 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-12-14 11:29:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:03,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:29:03,540 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_597 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:29:03,557 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_597 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:29:03,574 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_597 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_597 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:29:03,605 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_597 (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_597) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_593 Int) (v_ArrVal_597 (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_597) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-12-14 11:29:03,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:29:03,625 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-12-14 11:29:05,673 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_597 (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_597) |c_~#queue~0.base|) .cse4) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (<= 0 (+ (* (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|)))))) is different from false [2022-12-14 11:29:07,715 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_593 Int) (v_ArrVal_592 Int) (v_ArrVal_597 (Array Int Int))) (< (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_592))) (store (store .cse0 .cse1 v_ArrVal_593) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_3 Int) (v_ArrVal_592 Int) (v_prenex_4 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_592))) (store (store .cse6 .cse1 v_prenex_3) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_4) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-14 11:29:10,030 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_590 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1289| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_590))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_593 Int) (v_ArrVal_592 Int) (v_ArrVal_597 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1289| 4)) v_ArrVal_592))) (store (store .cse1 .cse2 v_ArrVal_593) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|) .cse3) 4) 1609)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1289| (select .cse4 .cse3))))))) (forall ((v_ArrVal_590 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1289| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_590))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1289| (select .cse5 .cse3))) (forall ((v_prenex_3 Int) (v_ArrVal_592 Int) (v_prenex_4 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1289| 4)) v_ArrVal_592))) (store (store .cse7 .cse2 v_prenex_3) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_4) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 11:29:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:10,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516401054] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:29:10,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [381329319] [2022-12-14 11:29:10,062 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:337) 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-12-14 11:29:10,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:29:10,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2022-12-14 11:29:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107534061] [2022-12-14 11:29:10,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:29:10,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 11:29:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:29:10,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 11:29:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=309, Unknown=7, NotChecked=294, Total=702 [2022-12-14 11:29:10,064 INFO L87 Difference]: Start difference. First operand 632 states and 1518 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-12-14 11:29:25,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:29:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:29:27,272 INFO L93 Difference]: Finished difference Result 1374 states and 3242 transitions. [2022-12-14 11:29:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 11:29:27,273 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-12-14 11:29:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:29:27,276 INFO L225 Difference]: With dead ends: 1374 [2022-12-14 11:29:27,276 INFO L226 Difference]: Without dead ends: 1374 [2022-12-14 11:29:27,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=236, Invalid=974, Unknown=8, NotChecked=504, Total=1722 [2022-12-14 11:29:27,277 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 366 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 36 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 1368 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-12-14 11:29:27,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 121 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1072 Invalid, 10 Unknown, 1368 Unchecked, 5.9s Time] [2022-12-14 11:29:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-12-14 11:29:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 713. [2022-12-14 11:29:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 703 states have (on average 2.4295874822190613) internal successors, (1708), 712 states have internal predecessors, (1708), 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-12-14 11:29:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1708 transitions. [2022-12-14 11:29:27,289 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1708 transitions. Word has length 14 [2022-12-14 11:29:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:29:27,289 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1708 transitions. [2022-12-14 11:29:27,289 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-12-14 11:29:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1708 transitions. [2022-12-14 11:29:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 11:29:27,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:29:27,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:29:27,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:29:27,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 11:29:27,490 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-12-14 11:29:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:29:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1490084233, now seen corresponding path program 2 times [2022-12-14 11:29:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:29:27,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006981261] [2022-12-14 11:29:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:29:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:29:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:29:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:28,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:29:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006981261] [2022-12-14 11:29:28,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006981261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:29:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372406323] [2022-12-14 11:29:28,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:29:28,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:29:28,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:29:28,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:29:28,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:29:28,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 11:29:28,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:29:28,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 11:29:28,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:29:28,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:28,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:28,612 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 11:29:28,613 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 28 treesize of output 36 [2022-12-14 11:29:28,646 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 11:29:28,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-14 11:29:28,853 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-12-14 11:29:29,039 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-12-14 11:29:29,310 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-12-14 11:29:29,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:29,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-12-14 11:29:29,502 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-12-14 11:29:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:29,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:29:29,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_693 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_693 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:29:29,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-12-14 11:29:29,667 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_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:29:29,683 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_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-12-14 11:29:32,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:29:32,556 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-12-14 11:29:43,397 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 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_686 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_688 Int)) (< (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_686))) (store (store .cse0 .cse1 v_ArrVal_688) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_686 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_686))) (store (store .cse6 .cse1 v_prenex_7) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-14 11:29:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:46,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372406323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:29:46,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2042991409] [2022-12-14 11:29:46,088 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:337) 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-12-14 11:29:46,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:29:46,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-12-14 11:29:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336785118] [2022-12-14 11:29:46,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:29:46,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 11:29:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:29:46,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 11:29:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=403, Unknown=13, NotChecked=230, Total=756 [2022-12-14 11:29:46,089 INFO L87 Difference]: Start difference. First operand 713 states and 1708 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-12-14 11:29:52,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:29:54,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:29:56,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:29:59,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:01,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:09,907 WARN L233 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:30:12,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:14,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:17,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:19,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:21,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:23,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:25,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:27,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:38,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:46,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:48,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:30:50,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:31:17,780 WARN L233 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 83 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:31:20,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:31:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:31:25,278 INFO L93 Difference]: Finished difference Result 1849 states and 4466 transitions. [2022-12-14 11:31:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 11:31:25,279 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-12-14 11:31:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:31:25,282 INFO L225 Difference]: With dead ends: 1849 [2022-12-14 11:31:25,282 INFO L226 Difference]: Without dead ends: 1849 [2022-12-14 11:31:25,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=251, Invalid=1007, Unknown=22, NotChecked=360, Total=1640 [2022-12-14 11:31:25,283 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 549 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 73 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 920 IncrementalHoareTripleChecker+Unchecked, 46.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:31:25,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 138 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1076 Invalid, 43 Unknown, 920 Unchecked, 46.8s Time] [2022-12-14 11:31:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-12-14 11:31:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 715. [2022-12-14 11:31:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 705 states have (on average 2.4354609929078013) internal successors, (1717), 714 states have internal predecessors, (1717), 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-12-14 11:31:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1717 transitions. [2022-12-14 11:31:25,297 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1717 transitions. Word has length 14 [2022-12-14 11:31:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:31:25,298 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 1717 transitions. [2022-12-14 11:31:25,298 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-12-14 11:31:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1717 transitions. [2022-12-14 11:31:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 11:31:25,298 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:31:25,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:31:25,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 11:31:25,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 11:31:25,500 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:31:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:31:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -819324400, now seen corresponding path program 1 times [2022-12-14 11:31:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:31:25,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20511376] [2022-12-14 11:31:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:31:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:31:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:31:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:25,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:31:25,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20511376] [2022-12-14 11:31:25,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20511376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:31:25,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:31:25,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:31:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30568034] [2022-12-14 11:31:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:31:25,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:31:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:31:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:31:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:31:25,601 INFO L87 Difference]: Start difference. First operand 715 states and 1717 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-12-14 11:31:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:31:25,817 INFO L93 Difference]: Finished difference Result 727 states and 1725 transitions. [2022-12-14 11:31:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:31:25,818 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-12-14 11:31:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:31:25,819 INFO L225 Difference]: With dead ends: 727 [2022-12-14 11:31:25,819 INFO L226 Difference]: Without dead ends: 727 [2022-12-14 11:31:25,819 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-12-14 11:31:25,820 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:31:25,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:31:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-12-14 11:31:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 701. [2022-12-14 11:31:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 691 states have (on average 2.431259044862518) internal successors, (1680), 700 states have internal predecessors, (1680), 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-12-14 11:31:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1680 transitions. [2022-12-14 11:31:25,830 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1680 transitions. Word has length 15 [2022-12-14 11:31:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:31:25,831 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1680 transitions. [2022-12-14 11:31:25,831 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-12-14 11:31:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1680 transitions. [2022-12-14 11:31:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 11:31:25,831 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:31:25,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:31:25,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 11:31:25,832 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:31:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:31:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1973257641, now seen corresponding path program 1 times [2022-12-14 11:31:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:31:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106616922] [2022-12-14 11:31:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:31:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:31:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:31:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:26,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:31:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106616922] [2022-12-14 11:31:26,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106616922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:31:26,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214022754] [2022-12-14 11:31:26,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:31:26,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:31:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:31:26,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:31:26,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:31:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:31:26,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 11:31:26,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:31:26,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:26,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:26,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:26,953 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-12-14 11:31:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:27,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:31:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:27,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214022754] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:31:27,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [418083812] [2022-12-14 11:31:27,639 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:337) 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-12-14 11:31:27,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:31:27,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 15 [2022-12-14 11:31:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513486017] [2022-12-14 11:31:27,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:31:27,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 11:31:27,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:31:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 11:31:27,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-14 11:31:27,640 INFO L87 Difference]: Start difference. First operand 701 states and 1680 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 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-12-14 11:31:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:31:29,764 INFO L93 Difference]: Finished difference Result 1581 states and 3696 transitions. [2022-12-14 11:31:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 11:31:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 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-12-14 11:31:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:31:29,767 INFO L225 Difference]: With dead ends: 1581 [2022-12-14 11:31:29,768 INFO L226 Difference]: Without dead ends: 1581 [2022-12-14 11:31:29,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2022-12-14 11:31:29,768 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 486 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:31:29,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 72 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 11:31:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2022-12-14 11:31:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1124. [2022-12-14 11:31:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1114 states have (on average 2.421005385996409) internal successors, (2697), 1123 states have internal predecessors, (2697), 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-12-14 11:31:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 2697 transitions. [2022-12-14 11:31:29,787 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 2697 transitions. Word has length 19 [2022-12-14 11:31:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:31:29,788 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 2697 transitions. [2022-12-14 11:31:29,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 15 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-12-14 11:31:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2697 transitions. [2022-12-14 11:31:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 11:31:29,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:31:29,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 11:31:29,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:31:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:31:29,990 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-12-14 11:31:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:31:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1127879762, now seen corresponding path program 3 times [2022-12-14 11:31:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:31:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733088373] [2022-12-14 11:31:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:31:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:31:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:31:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:31,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:31:31,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733088373] [2022-12-14 11:31:31,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733088373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:31:31,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086412159] [2022-12-14 11:31:31,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:31:31,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:31:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:31:31,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:31:31,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:31:31,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:31:31,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:31:31,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-14 11:31:31,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:31:31,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:31,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:31,859 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 11:31:31,859 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 28 treesize of output 36 [2022-12-14 11:31:31,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:31,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:31,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:31,879 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-12-14 11:31:31,925 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 11:31:31,926 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-12-14 11:31:32,263 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-12-14 11:31:32,478 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-12-14 11:31:32,966 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-12-14 11:31:33,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:33,125 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-12-14 11:31:33,362 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 83 treesize of output 83 [2022-12-14 11:31:33,547 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 149 treesize of output 144 [2022-12-14 11:31:33,819 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 154 treesize of output 149 [2022-12-14 11:31:34,313 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 124 treesize of output 117 [2022-12-14 11:31:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:34,503 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 217 treesize of output 219 [2022-12-14 11:31:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:34,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:31:35,143 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_937 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_937 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:31:35,176 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_937 (Array Int Int)) (v_ArrVal_934 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_934) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_934 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_934) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-12-14 11:31:42,683 WARN L233 SmtUtils]: Spent 6.06s 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-12-14 11:31:42,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (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))))) (and (forall ((v_ArrVal_929 (Array Int Int))) (let ((.cse5 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_929))) (let ((.cse4 (+ (* (select (select .cse5 |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_937 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (<= (+ (* (select (select (store (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_930))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store (select .cse0 |c_~#queue~0.base|) .cse4 v_ArrVal_932))) (store (store .cse1 .cse2 v_ArrVal_934) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (let ((.cse10 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_929))) (let ((.cse9 (+ (* (select (select .cse10 |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_937 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (<= 0 (+ (* (select (select (store (let ((.cse7 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_930))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (select .cse7 |c_~#queue~0.base|) .cse9 v_ArrVal_932))) (store (store .cse8 .cse2 v_ArrVal_934) .cse3 (+ (select .cse8 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse9)))))))) is different from false [2022-12-14 11:31:43,028 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_929 (Array Int Int))) (let ((.cse5 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_929))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select (select .cse5 |c_~#queue~0.base|) .cse4) 4)))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_937 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (<= (+ (* (select (select (store (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_930))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store (select .cse1 |c_~#queue~0.base|) .cse0 v_ArrVal_932))) (store (store .cse2 .cse3 v_ArrVal_934) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_929 (Array Int Int))) (let ((.cse10 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_929))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select (select .cse10 |c_~#queue~0.base|) .cse4) 4)))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_937 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (<= 0 (+ (* (select (select (store (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_930))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (select .cse8 |c_~#queue~0.base|) .cse7 v_ArrVal_932))) (store (store .cse9 .cse3 v_ArrVal_934) .cse4 (+ (select .cse9 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 11:31:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 11:31:53,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086412159] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:31:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [894090036] [2022-12-14 11:31:53,856 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:337) 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-12-14 11:31:53,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:31:53,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 39 [2022-12-14 11:31:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932776335] [2022-12-14 11:31:53,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:31:53,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 11:31:53,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:31:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 11:31:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1103, Unknown=38, NotChecked=292, Total=1640 [2022-12-14 11:31:53,858 INFO L87 Difference]: Start difference. First operand 1124 states and 2697 transitions. Second operand has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 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-12-14 11:32:26,659 WARN L233 SmtUtils]: Spent 21.68s on a formula simplification. DAG size of input: 233 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:32:41,409 WARN L233 SmtUtils]: Spent 10.67s on a formula simplification. DAG size of input: 125 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:32:45,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:32:55,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:32:58,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:33:00,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:33:02,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:33:08,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:11,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:15,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:17,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:20,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:22,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:27,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:33:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:33:40,062 INFO L93 Difference]: Finished difference Result 1715 states and 4076 transitions. [2022-12-14 11:33:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 11:33:40,064 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 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-12-14 11:33:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:33:40,068 INFO L225 Difference]: With dead ends: 1715 [2022-12-14 11:33:40,068 INFO L226 Difference]: Without dead ends: 1715 [2022-12-14 11:33:40,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=603, Invalid=2990, Unknown=83, NotChecked=484, Total=4160 [2022-12-14 11:33:40,069 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 690 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 98 mSolverCounterUnsat, 379 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 379 IncrementalHoareTripleChecker+Unknown, 860 IncrementalHoareTripleChecker+Unchecked, 50.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:33:40,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 319 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2544 Invalid, 379 Unknown, 860 Unchecked, 50.0s Time] [2022-12-14 11:33:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2022-12-14 11:33:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1012. [2022-12-14 11:33:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1002 states have (on average 2.471057884231537) internal successors, (2476), 1011 states have internal predecessors, (2476), 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-12-14 11:33:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 2476 transitions. [2022-12-14 11:33:40,086 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 2476 transitions. Word has length 22 [2022-12-14 11:33:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:33:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 2476 transitions. [2022-12-14 11:33:40,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 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-12-14 11:33:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 2476 transitions. [2022-12-14 11:33:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 11:33:40,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:33:40,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 11:33:40,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 11:33:40,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:33:40,288 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-12-14 11:33:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:33:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1342856492, now seen corresponding path program 4 times [2022-12-14 11:33:40,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:33:40,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882207943] [2022-12-14 11:33:40,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:33:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:33:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:33:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:33:42,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:33:42,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882207943] [2022-12-14 11:33:42,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882207943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:33:42,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927738042] [2022-12-14 11:33:42,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:33:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:33:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:33:42,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:33:42,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 11:33:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:33:42,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 101 conjunts are in the unsatisfiable core [2022-12-14 11:33:42,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:33:42,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:42,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:42,365 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 11:33:42,365 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 28 treesize of output 36 [2022-12-14 11:33:42,409 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 11:33:42,409 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-12-14 11:33:42,721 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-12-14 11:33:43,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 62 treesize of output 57 [2022-12-14 11:33:43,534 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-12-14 11:33:43,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:43,704 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-12-14 11:33:43,941 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 69 treesize of output 60 [2022-12-14 11:33:44,228 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-12-14 11:33:44,834 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-12-14 11:33:45,012 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-12-14 11:33:45,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:45,164 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-12-14 11:33:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:33:45,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:33:45,411 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1057 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1057 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:33:45,431 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-14 11:33:45,705 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_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-12-14 11:33:53,775 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:33:56,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse7 (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))))) (and (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse1 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_1051 Int)) (let ((.cse2 (store .cse6 .cse0 v_ArrVal_1051))) (let ((.cse5 (select .cse2 .cse4))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1052) .cse4 (+ .cse5 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (= 400 .cse5)))))))))) (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse8 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_1051))) (let ((.cse10 (select .cse9 .cse4))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1052) .cse4 (+ .cse10 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (= 400 .cse10))))) (not (<= 0 .cse12))))))))) is different from false [2022-12-14 11:33:56,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))))) (and (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse0 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse1 (store .cse5 .cse6 v_ArrVal_1051))) (let ((.cse4 (select .cse1 .cse3))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1052) .cse3 (+ .cse4 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (= 400 .cse4))))) (not (<= 0 .cse6))))))) (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse8 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_1051))) (let ((.cse10 (select .cse9 .cse3))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1052) .cse3 (+ .cse10 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (= 400 .cse10))))) (not (<= 0 .cse12))))))))) is different from false [2022-12-14 11:33:57,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:33:57,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 639 treesize of output 643 [2022-12-14 11:33:57,634 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 ((.cse0 (select .cse9 .cse11))) (or (= 400 .cse0) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse12 (+ .cse0 1))) (let ((.cse1 (forall ((v_prenex_16 Int) (v_prenex_17 Int) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_19) .cse11 .cse12)) |c_~#stored_elements~0.base| v_prenex_18))) (let ((.cse19 (select .cse15 |c_~#queue~0.base|))) (let ((.cse18 (+ (* (select .cse19 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse16 (store .cse19 .cse18 v_prenex_16))) (let ((.cse17 (select .cse16 .cse6))) (or (<= 0 (+ (* (select (select (store (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 v_prenex_17) .cse6 (+ .cse17 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_21) |c_~#stored_elements~0.base| v_prenex_20) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)) (not (<= 0 .cse18)) (= 400 .cse17)))))))))) (and .cse1 (forall ((v_ArrVal_1051 Int) (v_ArrVal_1052 Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1045 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1045) .cse11 .cse12)) |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse8 .cse6) 4) |c_~#queue~0.offset|))) (let ((.cse4 (store .cse8 .cse2 v_ArrVal_1051))) (let ((.cse7 (select .cse4 .cse6))) (or (not (<= 0 .cse2)) (< (+ (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1052) .cse6 (+ .cse7 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609)) (= 400 .cse7)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and .cse1 (forall ((v_ArrVal_1051 Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1045 Int)) (let ((.cse14 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1045) .cse11 .cse12)) |c_~#stored_elements~0.base| v_ArrVal_1049) |c_~#queue~0.base|))) (let ((.cse13 (+ (* (select .cse14 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse13)) (= 400 (select (store .cse14 .cse13 v_ArrVal_1051) .cse6)))))))))))))) is different from false [2022-12-14 11:34:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 11:34:01,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927738042] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:34:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753220812] [2022-12-14 11:34:01,354 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:337) 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-12-14 11:34:01,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:34:01,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 17] total 42 [2022-12-14 11:34:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055212264] [2022-12-14 11:34:01,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:34:01,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 11:34:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:34:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 11:34:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1182, Unknown=35, NotChecked=462, Total=1892 [2022-12-14 11:34:01,356 INFO L87 Difference]: Start difference. First operand 1012 states and 2476 transitions. Second operand has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 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-12-14 11:34:13,966 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 378 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:34:24,376 WARN L233 SmtUtils]: Spent 9.15s on a formula simplification. DAG size of input: 343 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:34:32,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:34:37,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:34:39,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:34:43,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:34:45,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:34:55,452 WARN L233 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 214 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:35:09,212 WARN L233 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 139 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:36:56,913 WARN L233 SmtUtils]: Spent 1.68m on a formula simplification. DAG size of input: 274 DAG size of output: 263 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:37:00,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:37:02,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:37:05,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 11:37:11,637 WARN L233 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:37:32,273 WARN L233 SmtUtils]: Spent 15.73s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:38:43,395 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 239 DAG size of output: 235 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:39:04,909 WARN L233 SmtUtils]: Spent 17.76s on a formula simplification. DAG size of input: 57 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:39:07,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:39:14,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:39:15,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse21 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse20 .cse21))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse20 .cse21 (+ .cse5 1)))) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse17 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse9) 4)) .cse17))) (.cse1 (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse9) 4))))) (.cse3 (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse14 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse18 (select .cse14 |c_~#queue~0.base|))) (let ((.cse19 (+ |c_~#queue~0.offset| (* (select .cse18 .cse9) 4)))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse15 (store .cse18 .cse19 v_ArrVal_1051))) (let ((.cse16 (select .cse15 .cse9))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_1052) .cse9 (+ .cse16 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse9) 4) |c_~#queue~0.offset| 4) .cse17)) (= 400 .cse16))))) (not (<= 0 .cse19)))))))) (.cse4 (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse6 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse9) 4)))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse7 (store .cse11 .cse12 v_ArrVal_1051))) (let ((.cse10 (select .cse7 .cse9))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1052) .cse9 (+ .cse10 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse9) 4) |c_~#queue~0.offset|))) (= 400 .cse10))))) (not (<= 0 .cse12)))))))) (.cse2 (= 400 .cse5))) (and .cse0 .cse1 (or (and .cse0 .cse1) .cse2) .cse3 .cse4 (or (and .cse3 .cse4) .cse2)))))) is different from false [2022-12-14 11:39:15,865 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse2 1)))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))) (.cse1 (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse4) 4)))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (= 400 .cse2))))))) is different from false [2022-12-14 11:39:16,047 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.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_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse4 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)))) (or (not (<= 0 .cse3)) (forall ((v_ArrVal_1051 Int)) (let ((.cse5 (store .cse8 .cse3 v_ArrVal_1051))) (let ((.cse7 (select .cse5 .cse1))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1052) .cse1 (+ .cse7 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (= 400 .cse7)))))))))) (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse9 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (let ((.cse13 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse10 (store .cse12 .cse13 v_ArrVal_1051))) (let ((.cse11 (select .cse10 .cse1))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_1052) .cse1 (+ .cse11 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (= 400 .cse11))))) (not (<= 0 .cse13))))))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-12-14 11:39:18,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:39:19,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse7 .cse0) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_1051 Int)) (let ((.cse4 (store .cse7 .cse2 v_ArrVal_1051))) (let ((.cse6 (select .cse4 .cse0))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1052) .cse0 (+ .cse6 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (= 400 .cse6)))))))))) (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1049))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (let ((.cse12 (+ (* (select .cse11 .cse0) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1051 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_1051))) (let ((.cse10 (select .cse9 .cse0))) (or (forall ((v_ArrVal_1052 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1052) .cse0 (+ .cse10 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (= 400 .cse10))))) (not (<= 0 .cse12))))))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-14 11:39:29,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:39:31,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:39:43,408 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 230 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:39:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:39:47,296 INFO L93 Difference]: Finished difference Result 1831 states and 4385 transitions. [2022-12-14 11:39:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 11:39:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 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-12-14 11:39:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:39:47,300 INFO L225 Difference]: With dead ends: 1831 [2022-12-14 11:39:47,300 INFO L226 Difference]: Without dead ends: 1831 [2022-12-14 11:39:47,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 308.8s TimeCoverageRelationStatistics Valid=664, Invalid=3179, Unknown=103, NotChecked=1310, Total=5256 [2022-12-14 11:39:47,302 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 834 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 136 mSolverCounterUnsat, 129 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 129 IncrementalHoareTripleChecker+Unknown, 1506 IncrementalHoareTripleChecker+Unchecked, 54.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:39:47,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 340 Invalid, 4389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2618 Invalid, 129 Unknown, 1506 Unchecked, 54.8s Time] [2022-12-14 11:39:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-12-14 11:39:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1016. [2022-12-14 11:39:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1006 states have (on average 2.445328031809145) internal successors, (2460), 1015 states have internal predecessors, (2460), 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-12-14 11:39:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 2460 transitions. [2022-12-14 11:39:47,319 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 2460 transitions. Word has length 22 [2022-12-14 11:39:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:39:47,319 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 2460 transitions. [2022-12-14 11:39:47,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 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-12-14 11:39:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 2460 transitions. [2022-12-14 11:39:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 11:39:47,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:39:47,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:39:47,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 11:39:47,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:39:47,521 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-12-14 11:39:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:39:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash -440543820, now seen corresponding path program 1 times [2022-12-14 11:39:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:39:47,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191023132] [2022-12-14 11:39:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:39:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:39:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:39:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:39:48,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:39:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191023132] [2022-12-14 11:39:48,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191023132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:39:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418807917] [2022-12-14 11:39:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:39:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:39:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:39:48,344 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:39:48,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 11:39:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:39:48,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-14 11:39:48,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:39:48,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:39:48,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:39:48,531 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 11:39:48,531 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 28 treesize of output 36 [2022-12-14 11:39:48,561 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 11:39:48,562 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-12-14 11:39:48,788 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-12-14 11:39:48,954 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-12-14 11:39:49,265 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-12-14 11:39:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:39:49,387 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-12-14 11:39:49,610 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 92 treesize of output 85 [2022-12-14 11:39:49,885 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-12-14 11:39:50,350 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 96 treesize of output 89 [2022-12-14 11:39:50,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:39:50,551 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 161 treesize of output 163 [2022-12-14 11:39:50,965 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 179 treesize of output 172 [2022-12-14 11:39:51,317 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 175 treesize of output 170 [2022-12-14 11:39:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:39:51,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:39:52,526 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1191 Int)) (let ((.cse0 (select (store (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)))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse0 .cse1)))))) is different from false [2022-12-14 11:39:52,575 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1187 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1191 Int)) (let ((.cse0 (select (store (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 (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1187) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1) 400))))) is different from false [2022-12-14 11:39:52,628 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 Int) (v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1187 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1191 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1185)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1187) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse0 .cse1)))))) is different from false [2022-12-14 11:39:55,446 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1319| Int) (v_ArrVal_1187 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1183))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1319| 4)) v_ArrVal_1185))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1187) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1319| (select .cse2 .cse1)))))))) is different from false [2022-12-14 11:39:55,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 Int) (v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1319| Int) (v_ArrVal_1187 Int) (v_ArrVal_1178 Int) (v_ArrVal_1179 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1178)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1179) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1183))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1319| 4)) v_ArrVal_1185))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1187) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1) 400)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1319| (select .cse2 .cse1)))))))) is different from false [2022-12-14 11:39:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2022-12-14 11:39:56,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418807917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:39:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1488456220] [2022-12-14 11:39:56,435 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:337) 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-12-14 11:39:56,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:39:56,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 16] total 39 [2022-12-14 11:39:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496904686] [2022-12-14 11:39:56,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:39:56,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 11:39:56,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:39:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 11:39:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=989, Unknown=29, NotChecked=350, Total=1560 [2022-12-14 11:39:56,437 INFO L87 Difference]: Start difference. First operand 1016 states and 2460 transitions. Second operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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-12-14 11:40:34,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_1190 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1191 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1190) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse0 .cse1)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| Int) (v_ArrVal_1191 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| 4) |c_~#queue~0.offset|) v_ArrVal_1191) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1317| (select .cse2 .cse1)))))))) is different from false [2022-12-14 11:40:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:40:34,969 INFO L93 Difference]: Finished difference Result 2066 states and 4870 transitions. [2022-12-14 11:40:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 11:40:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 29 [2022-12-14 11:40:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:40:34,974 INFO L225 Difference]: With dead ends: 2066 [2022-12-14 11:40:34,974 INFO L226 Difference]: Without dead ends: 2066 [2022-12-14 11:40:34,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 26 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=990, Invalid=3554, Unknown=36, NotChecked=822, Total=5402 [2022-12-14 11:40:34,975 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1759 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 182 mSolverCounterUnsat, 117 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 117 IncrementalHoareTripleChecker+Unknown, 996 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:40:34,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 228 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1785 Invalid, 117 Unknown, 996 Unchecked, 12.8s Time] [2022-12-14 11:40:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2022-12-14 11:40:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1372. [2022-12-14 11:40:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1362 states have (on average 2.4530102790014685) internal successors, (3341), 1371 states have internal predecessors, (3341), 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-12-14 11:40:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 3341 transitions. [2022-12-14 11:40:34,998 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 3341 transitions. Word has length 29 [2022-12-14 11:40:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:40:34,998 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 3341 transitions. [2022-12-14 11:40:34,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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-12-14 11:40:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 3341 transitions. [2022-12-14 11:40:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:40:35,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:40:35,000 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-12-14 11:40:35,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 11:40:35,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 11:40:35,201 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 11:40:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:40:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash 480060657, now seen corresponding path program 1 times [2022-12-14 11:40:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:40:35,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865834675] [2022-12-14 11:40:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:40:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:40:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:40:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 11:40:35,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:40:35,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865834675] [2022-12-14 11:40:35,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865834675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:40:35,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:40:35,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:40:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181054050] [2022-12-14 11:40:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:40:35,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:40:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:40:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:40:35,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:40:35,294 INFO L87 Difference]: Start difference. First operand 1372 states and 3341 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-12-14 11:40:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:40:35,464 INFO L93 Difference]: Finished difference Result 845 states and 1735 transitions. [2022-12-14 11:40:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:40:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-12-14 11:40:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:40:35,466 INFO L225 Difference]: With dead ends: 845 [2022-12-14 11:40:35,466 INFO L226 Difference]: Without dead ends: 843 [2022-12-14 11:40:35,466 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-12-14 11:40:35,467 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:40:35,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:40:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-12-14 11:40:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 838. [2022-12-14 11:40:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 828 states have (on average 2.0857487922705316) internal successors, (1727), 837 states have internal predecessors, (1727), 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-12-14 11:40:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1727 transitions. [2022-12-14 11:40:35,478 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1727 transitions. Word has length 30 [2022-12-14 11:40:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:40:35,478 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1727 transitions. [2022-12-14 11:40:35,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-12-14 11:40:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1727 transitions. [2022-12-14 11:40:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:40:35,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:40:35,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 11:40:35,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 11:40:35,479 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-12-14 11:40:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:40:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -882244093, now seen corresponding path program 5 times [2022-12-14 11:40:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:40:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161918209] [2022-12-14 11:40:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:40:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:40:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:40:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:40:38,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:40:38,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161918209] [2022-12-14 11:40:38,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161918209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:40:38,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469941600] [2022-12-14 11:40:38,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:40:38,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:40:38,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:40:38,301 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:40:38,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1153e101-e596-4515-b72a-79ee76ab7071/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 11:40:38,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 11:40:38,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:40:38,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 124 conjunts are in the unsatisfiable core [2022-12-14 11:40:38,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:40:38,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:40:38,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:40:38,779 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 28 treesize of output 32 [2022-12-14 11:40:38,943 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-12-14 11:40:38,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-12-14 11:40:39,449 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-12-14 11:40:39,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 42 treesize of output 37 [2022-12-14 11:40:40,321 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-12-14 11:40:40,564 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-12-14 11:40:40,955 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-12-14 11:40:41,650 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-12-14 11:40:42,791 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-12-14 11:40:43,244 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-12-14 11:40:43,761 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 76 [2022-12-14 11:40:44,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 115 [2022-12-14 11:40:45,181 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 120 treesize of output 115 [2022-12-14 11:40:49,645 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 84 treesize of output 77 [2022-12-14 11:40:50,138 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 132 treesize of output 134 [2022-12-14 11:40:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:40:50,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:40:50,803 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1384 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_1384 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:40:50,827 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_1384 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1384 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-14 11:40:50,852 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_1384 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1384 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-14 11:40:51,338 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_1380 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1380) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1380) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-14 11:41:02,064 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:41:02,105 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse1 (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse0 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store (store .cse2 .cse3 v_ArrVal_1380) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse4)))))))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse11 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store (store .cse8 .cse3 v_ArrVal_1380) .cse4 (+ (select .cse8 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse4))) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse11))))))))) is different from false [2022-12-14 11:41:02,770 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ (select .cse8 .cse9) 1)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse7 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (< .cse1 v_ArrVal_1375) (<= 0 (+ (* (select (select (store (let ((.cse2 (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse0 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store (store .cse3 .cse4 v_ArrVal_1380) .cse5 (+ (select .cse3 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (let ((.cse10 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse10)) (< .cse1 v_ArrVal_1375) (<= (+ (* (select (select (store (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse10 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store (store .cse12 .cse4 v_ArrVal_1380) .cse5 (+ (select .cse12 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2022-12-14 11:41:03,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse16 (select .cse8 .cse10))) (or (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ .cse16 1)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1380 Int) (v_ArrVal_1372 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1372) .cse10 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (+ (* 4 (select .cse7 .cse5)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (< .cse1 v_ArrVal_1375) (<= 0 (+ (* (select (select (store (let ((.cse2 (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse0 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store (store .cse3 .cse4 v_ArrVal_1380) .cse5 (+ (select .cse3 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1380 Int) (v_ArrVal_1372 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1372) .cse10 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (let ((.cse11 (+ (* 4 (select .cse15 .cse5)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse11)) (<= (+ (* (select (select (store (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store .cse15 .cse11 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store (store .cse13 .cse4 v_ArrVal_1380) .cse5 (+ (select .cse13 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (< .cse1 v_ArrVal_1375)))))))) (= 400 .cse16)))) is different from false [2022-12-14 11:41:03,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:41:03,651 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 629 treesize of output 633 [2022-12-14 11:41:03,845 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 ((.cse17 (select .cse9 .cse11))) (or (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ .cse17 1)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_prenex_28 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_27) .cse11 v_prenex_29)) |c_~#stored_elements~0.base| v_prenex_30))) (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (let ((.cse16 (+ (* (select .cse15 .cse6) 4) |c_~#queue~0.offset|))) (or (<= 0 (+ (* (select (select (store (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store .cse15 .cse16 v_prenex_31)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_28))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store (store .cse13 .cse5 v_prenex_26) .cse6 (+ (select .cse13 .cse6) 1))))) |c_~#stored_elements~0.base| v_prenex_32) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)) (< .cse2 v_prenex_29) (not (<= 0 .cse16))))))))) (and .cse0 (forall ((v_ArrVal_1380 Int) (v_ArrVal_1372 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1372) .cse11 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (let ((.cse1 (+ (* 4 (select .cse8 .cse6)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse1)) (< .cse2 v_ArrVal_1375) (< (+ (* (select (select (store (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse1 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store (store .cse4 .cse5 v_ArrVal_1380) .cse6 (+ (select .cse4 .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and .cse0 (forall ((v_ArrVal_1372 Int) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int))) (or (not (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1372) .cse11 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset|))) (< .cse2 v_ArrVal_1375)))))))) (= 400 .cse17)))) is different from false [2022-12-14 11:41:15,794 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_ArrVal_1369 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse0 .cse1))) (forall ((v_ArrVal_1370 Int)) (let ((.cse10 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse8 (select .cse10 .cse1))) (or (forall ((v_ArrVal_1380 Int) (v_ArrVal_1372 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1372) .cse1 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (< (* (select (select (store (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store (store .cse4 .cse5 v_ArrVal_1380) .cse1 (+ (select .cse4 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse1) 4) 1609) (< (+ .cse8 1) v_ArrVal_1375)))))) (= 400 .cse8))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_ArrVal_1369 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1370 Int)) (let ((.cse18 (store .cse19 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse16 (select .cse18 .cse1))) (or (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_prenex_28 (Array Int Int))) (let ((.cse13 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse5 v_prenex_27) .cse1 v_prenex_29)) |c_~#stored_elements~0.base| v_prenex_30))) (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (let ((.cse15 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|))) (or (<= 0 (+ (* (select (select (store (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (store .cse14 .cse15 v_prenex_31)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_28))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store (store .cse12 .cse5 v_prenex_26) .cse1 (+ (select .cse12 .cse1) 1))))) |c_~#stored_elements~0.base| v_prenex_32) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)) (not (<= 0 .cse15)) (< (+ .cse16 1) v_prenex_29)))))) (= 400 .cse16))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse19 .cse1))))))))) is different from false [2022-12-14 11:41:17,654 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ (select .cse12 .cse13) 1)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1370 Int) (v_ArrVal_1380 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_ArrVal_1372 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1378 Int) (v_ArrVal_1368 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse12 .cse13 v_ArrVal_1368)) |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_1372) .cse3 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (select .cse10 .cse3)) (.cse4 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|))) (or (= 400 .cse0) (< (+ .cse0 1) v_ArrVal_1375) (< .cse1 v_ArrVal_1368) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse2 .cse3))) (not (<= 0 .cse4)) (< (* (select (select (store (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse4 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store (store .cse6 .cse7 v_ArrVal_1380) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse3) 4) 1609))))))))) (forall ((v_ArrVal_1370 Int) (v_prenex_27 Int) (v_prenex_26 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_prenex_29 Int) (v_ArrVal_1369 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_1368 Int) (v_prenex_31 Int) (v_prenex_28 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse12 .cse13 v_ArrVal_1368)) |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse16 (select .cse22 |c_~#queue~0.base|))) (let ((.cse21 (store .cse16 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse21 .cse7 v_prenex_27) .cse3 v_prenex_29)) |c_~#stored_elements~0.base| v_prenex_30))) (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (let ((.cse14 (select .cse21 .cse3)) (.cse15 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|))) (or (= 400 .cse14) (not (<= 0 .cse15)) (< .cse1 v_ArrVal_1368) (< (+ .cse14 1) v_prenex_29) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse16 .cse3))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse17 (store (store .cse19 |c_~#queue~0.base| (store .cse20 .cse15 v_prenex_31)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_28))) (store .cse17 |c_~#queue~0.base| (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store .cse18 .cse7 v_prenex_26) .cse3 (+ (select .cse18 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_32) |c_~#queue~0.base|) .cse3) 4)))))))))))))) is different from false [2022-12-14 11:41:17,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ (select .cse12 .cse14) 1)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse13 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1380 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_ArrVal_1372 Int) (v_ArrVal_1375 Int) (v_ArrVal_1378 Int) (v_ArrVal_1366 Int) (v_ArrVal_1368 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1366) .cse14 v_ArrVal_1368)) |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_1372) .cse1 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (select .cse10 .cse1)) (.cse4 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_1375) (< .cse3 v_ArrVal_1368) (not (<= 0 .cse4)) (= .cse2 400) (< (* (select (select (store (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse4 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store (store .cse6 .cse7 v_ArrVal_1380) .cse1 (+ (select .cse6 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse1) 4) 1609))))))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_ArrVal_1369 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_1370 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_1366 Int) (v_ArrVal_1368 Int) (v_prenex_28 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_1366) .cse14 v_ArrVal_1368)) |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse15 (select .cse23 |c_~#queue~0.base|))) (let ((.cse22 (store .cse15 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse18 (store (store .cse23 |c_~#queue~0.base| (store (store .cse22 .cse7 v_prenex_27) .cse1 v_prenex_29)) |c_~#stored_elements~0.base| v_prenex_30))) (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (let ((.cse21 (select .cse22 .cse1)) (.cse20 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse15 .cse1))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store .cse19 .cse20 v_prenex_31)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_28))) (store .cse16 |c_~#queue~0.base| (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store (store .cse17 .cse7 v_prenex_26) .cse1 (+ (select .cse17 .cse1) 1))))) |c_~#stored_elements~0.base| v_prenex_32) |c_~#queue~0.base|) .cse1)))) (< .cse3 v_ArrVal_1368) (< (+ .cse21 1) v_prenex_29) (= .cse21 400) (not (<= 0 .cse20))))))))))))) is different from false [2022-12-14 11:41:18,296 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse13 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_ArrVal_1369 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_1370 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_1364 Int) (v_ArrVal_1366 Int) (v_ArrVal_1368 Int) (v_prenex_28 (Array Int Int))) (let ((.cse9 (store .cse14 .cse15 v_ArrVal_1364))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse13 v_ArrVal_1366) .cse10 v_ArrVal_1368)) |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse5 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse3 v_prenex_27) .cse4 v_prenex_29)) |c_~#stored_elements~0.base| v_prenex_30))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|)) (.cse0 (select .cse11 .cse4))) (or (= 400 .cse0) (<= 0 (+ (* (select (select (store (let ((.cse1 (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse7 v_prenex_31)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_28))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store (store .cse2 .cse3 v_prenex_26) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_prenex_32) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)) (not (<= 0 .cse7)) (< (+ .cse0 1) v_prenex_29) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse8 .cse4))) (< (+ (select .cse9 .cse10) 1) v_ArrVal_1368)))))))))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1380 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| Int) (v_ArrVal_1372 Int) (v_ArrVal_1364 Int) (v_ArrVal_1375 Int) (v_ArrVal_1378 Int) (v_ArrVal_1366 Int) (v_ArrVal_1368 Int)) (let ((.cse23 (store .cse14 .cse15 v_ArrVal_1364))) (let ((.cse25 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse23 .cse13 v_ArrVal_1366) .cse10 v_ArrVal_1368)) |c_~#stored_elements~0.base| v_ArrVal_1369))) (let ((.cse18 (select .cse25 |c_~#queue~0.base|))) (let ((.cse24 (store .cse18 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| 4)) v_ArrVal_1370))) (let ((.cse21 (store (store .cse25 |c_~#queue~0.base| (store (store .cse24 .cse3 v_ArrVal_1372) .cse4 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (let ((.cse16 (select .cse24 .cse4)) (.cse17 (+ |c_~#queue~0.offset| (* (select .cse22 .cse4) 4)))) (or (= 400 .cse16) (not (<= 0 .cse17)) (< (+ .cse16 1) v_ArrVal_1375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1329| (select .cse18 .cse4))) (< (* 4 (select (select (store (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store .cse22 .cse17 v_ArrVal_1378)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store (store .cse20 .cse3 v_ArrVal_1380) .cse4 (+ (select .cse20 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|) .cse4)) 1609) (< (+ (select .cse23 .cse10) 1) v_ArrVal_1368)))))))))))) is different from false [2022-12-14 11:41:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 19 not checked. [2022-12-14 11:41:33,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469941600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:41:33,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1740514641] [2022-12-14 11:41:33,642 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:337) 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-12-14 11:41:33,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:41:33,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 22] total 56 [2022-12-14 11:41:33,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958162784] [2022-12-14 11:41:33,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:41:33,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-14 11:41:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:41:33,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-14 11:41:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1816, Unknown=54, NotChecked=1188, Total=3306 [2022-12-14 11:41:33,645 INFO L87 Difference]: Start difference. First operand 838 states and 1727 transitions. Second operand has 58 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 57 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-12-14 11:42:19,355 WARN L233 SmtUtils]: Spent 16.91s on a formula simplification. DAG size of input: 292 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)