./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- 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-5e519f3 [2022-11-03 03:35:43,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:35:43,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:35:43,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:35:43,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:35:43,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:35:43,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:35:43,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:35:43,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:35:43,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:35:43,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:35:43,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:35:43,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:35:43,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:35:43,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:35:43,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:35:43,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:35:43,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:35:43,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:35:43,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:35:43,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:35:43,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:35:43,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:35:43,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:35:43,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:35:43,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:35:43,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:35:43,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:35:43,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:35:43,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:35:43,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:35:43,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:35:43,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:35:43,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:35:43,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:35:43,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:35:43,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:35:43,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:35:43,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:35:43,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:35:43,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:35:43,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:35:43,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:35:43,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:35:43,210 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:35:43,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:35:43,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:35:43,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:35:43,212 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:35:43,212 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:35:43,212 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:35:43,213 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:35:43,214 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:35:43,214 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:35:43,214 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:35:43,214 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:35:43,215 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:35:43,215 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:35:43,215 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:35:43,215 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:35:43,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:35:43,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:35:43,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:35:43,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:35:43,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:35:43,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:35:43,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:35:43,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:35:43,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:35:43,219 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:35:43,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:35:43,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:35:43,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:35:43,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:35:43,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:35:43,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:35:43,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:35:43,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:35:43,222 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:35:43,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:35:43,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:35:43,222 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:35:43,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:35:43,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:35:43,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:35:43,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/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_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI 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 ! overflow) ) 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-03 03:35:43,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:35:43,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:35:43,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:35:43,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:35:43,519 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:35:43,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-03 03:35:43,602 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/data/0763c9e4d/b87e31a83e974ec59d1d833f9bae7b48/FLAG81c594afb [2022-11-03 03:35:44,142 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:35:44,143 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-03 03:35:44,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/data/0763c9e4d/b87e31a83e974ec59d1d833f9bae7b48/FLAG81c594afb [2022-11-03 03:35:44,420 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/data/0763c9e4d/b87e31a83e974ec59d1d833f9bae7b48 [2022-11-03 03:35:44,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:35:44,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:35:44,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:35:44,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:35:44,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:35:44,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:35:44" (1/1) ... [2022-11-03 03:35:44,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e90348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:44, skipping insertion in model container [2022-11-03 03:35:44,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:35:44" (1/1) ... [2022-11-03 03:35:44,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:35:44,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:35:45,086 WARN L230 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_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-03 03:35:45,089 WARN L230 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_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-03 03:35:45,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:35:45,114 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:35:45,192 WARN L230 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_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-03 03:35:45,196 WARN L230 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_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-03 03:35:45,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:35:45,247 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:35:45,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45 WrapperNode [2022-11-03 03:35:45,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:35:45,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:35:45,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:35:45,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:35:45,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,304 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-03 03:35:45,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:35:45,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:35:45,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:35:45,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:35:45,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,335 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:35:45,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:35:45,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:35:45,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:35:45,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (1/1) ... [2022-11-03 03:35:45,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:35:45,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:35:45,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:35:45,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:35:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-03 03:35:45,420 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-03 03:35:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-03 03:35:45,420 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:35:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:35:45,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:35:45,423 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:35:45,564 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:35:45,567 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:35:46,054 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:35:46,065 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:35:46,065 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 03:35:46,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:35:46 BoogieIcfgContainer [2022-11-03 03:35:46,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:35:46,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:35:46,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:35:46,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:35:46,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:35:44" (1/3) ... [2022-11-03 03:35:46,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647cce8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:35:46, skipping insertion in model container [2022-11-03 03:35:46,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:35:45" (2/3) ... [2022-11-03 03:35:46,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647cce8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:35:46, skipping insertion in model container [2022-11-03 03:35:46,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:35:46" (3/3) ... [2022-11-03 03:35:46,078 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-03 03:35:46,087 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:35:46,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:35:46,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-03 03:35:46,099 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:35:46,264 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 03:35:46,316 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:35:46,330 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 253 transitions, 522 flow [2022-11-03 03:35:46,333 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 253 transitions, 522 flow [2022-11-03 03:35:46,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 253 transitions, 522 flow [2022-11-03 03:35:46,446 INFO L130 PetriNetUnfolder]: 13/251 cut-off events. [2022-11-03 03:35:46,446 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 03:35:46,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 251 events. 13/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-03 03:35:46,467 INFO L118 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-03 03:35:58,855 INFO L133 LiptonReduction]: Checked pairs total: 31637 [2022-11-03 03:35:58,855 INFO L135 LiptonReduction]: Total number of compositions: 244 [2022-11-03 03:35:58,863 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-03 03:35:58,966 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:58,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:35:59,004 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2f6086be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:35:59,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-03 03:35:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:35:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:35:59,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:59,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:35:59,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:35:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1500788054, now seen corresponding path program 1 times [2022-11-03 03:35:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:59,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306950976] [2022-11-03 03:35:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:00,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:00,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306950976] [2022-11-03 03:36:00,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306950976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:00,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:00,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:36:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526051336] [2022-11-03 03:36:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:00,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:36:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:36:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:36:00,945 INFO L87 Difference]: Start difference. First operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:01,483 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-03 03:36:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 03:36:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:01,521 INFO L225 Difference]: With dead ends: 1168 [2022-11-03 03:36:01,522 INFO L226 Difference]: Without dead ends: 1168 [2022-11-03 03:36:01,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:01,526 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:01,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-03 03:36:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-03 03:36:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1115 states have (on average 2.768609865470852) internal successors, (3087), 1162 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-03 03:36:01,634 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-03 03:36:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:01,635 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-03 03:36:01,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-03 03:36:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:36:01,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:01,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:01,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:36:01,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 764555353, now seen corresponding path program 1 times [2022-11-03 03:36:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:01,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163801572] [2022-11-03 03:36:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:02,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:02,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163801572] [2022-11-03 03:36:02,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163801572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:02,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:02,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96935601] [2022-11-03 03:36:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:02,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:02,844 INFO L87 Difference]: Start difference. First operand 1163 states and 3087 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:03,605 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-03 03:36:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:36:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:03,616 INFO L225 Difference]: With dead ends: 1537 [2022-11-03 03:36:03,616 INFO L226 Difference]: Without dead ends: 1537 [2022-11-03 03:36:03,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:36:03,618 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:03,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 31 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:36:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-03 03:36:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-03 03:36:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-03 03:36:03,670 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-03 03:36:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:03,671 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-03 03:36:03,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-03 03:36:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:36:03,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:03,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:03,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:36:03,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 720358963, now seen corresponding path program 2 times [2022-11-03 03:36:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408218643] [2022-11-03 03:36:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:04,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:04,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408218643] [2022-11-03 03:36:04,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408218643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:04,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:04,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808294141] [2022-11-03 03:36:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:04,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:04,095 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:04,427 INFO L93 Difference]: Finished difference Result 1747 states and 4603 transitions. [2022-11-03 03:36:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:36:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:04,437 INFO L225 Difference]: With dead ends: 1747 [2022-11-03 03:36:04,438 INFO L226 Difference]: Without dead ends: 1747 [2022-11-03 03:36:04,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:36:04,439 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:04,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 26 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-11-03 03:36:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1398. [2022-11-03 03:36:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1350 states have (on average 2.8) internal successors, (3780), 1397 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 3780 transitions. [2022-11-03 03:36:04,491 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 3780 transitions. Word has length 8 [2022-11-03 03:36:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:04,492 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 3780 transitions. [2022-11-03 03:36:04,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 3780 transitions. [2022-11-03 03:36:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:36:04,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:04,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:04,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:36:04,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:04,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash 720359014, now seen corresponding path program 1 times [2022-11-03 03:36:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:04,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360831605] [2022-11-03 03:36:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:04,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360831605] [2022-11-03 03:36:04,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360831605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:04,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:04,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177313117] [2022-11-03 03:36:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:04,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:04,991 INFO L87 Difference]: Start difference. First operand 1398 states and 3780 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:05,366 INFO L93 Difference]: Finished difference Result 1712 states and 4512 transitions. [2022-11-03 03:36:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:36:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:05,376 INFO L225 Difference]: With dead ends: 1712 [2022-11-03 03:36:05,376 INFO L226 Difference]: Without dead ends: 1712 [2022-11-03 03:36:05,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:36:05,378 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:05,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 34 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-03 03:36:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1328. [2022-11-03 03:36:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-03 03:36:05,426 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-03 03:36:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:05,427 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-03 03:36:05,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-03 03:36:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:36:05,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:05,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:05,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:36:05,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash 720212953, now seen corresponding path program 3 times [2022-11-03 03:36:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:05,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98831793] [2022-11-03 03:36:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:05,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:05,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98831793] [2022-11-03 03:36:05,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98831793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:05,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:05,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:05,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674565143] [2022-11-03 03:36:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:05,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:05,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:05,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:05,785 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:06,066 INFO L93 Difference]: Finished difference Result 1572 states and 4148 transitions. [2022-11-03 03:36:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:36:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:06,075 INFO L225 Difference]: With dead ends: 1572 [2022-11-03 03:36:06,076 INFO L226 Difference]: Without dead ends: 1572 [2022-11-03 03:36:06,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:36:06,077 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 90 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:06,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 26 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:36:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-11-03 03:36:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1363. [2022-11-03 03:36:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1315 states have (on average 2.8053231939163497) internal successors, (3689), 1362 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 3689 transitions. [2022-11-03 03:36:06,125 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 3689 transitions. Word has length 8 [2022-11-03 03:36:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:06,126 INFO L495 AbstractCegarLoop]: Abstraction has 1363 states and 3689 transitions. [2022-11-03 03:36:06,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 3689 transitions. [2022-11-03 03:36:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:36:06,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:06,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:06,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:36:06,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 720213004, now seen corresponding path program 2 times [2022-11-03 03:36:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:06,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983258739] [2022-11-03 03:36:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:06,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:06,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983258739] [2022-11-03 03:36:06,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983258739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:06,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:06,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228241665] [2022-11-03 03:36:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:06,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:06,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:06,762 INFO L87 Difference]: Start difference. First operand 1363 states and 3689 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:07,060 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-03 03:36:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:07,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:36:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:07,069 INFO L225 Difference]: With dead ends: 1537 [2022-11-03 03:36:07,070 INFO L226 Difference]: Without dead ends: 1537 [2022-11-03 03:36:07,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:36:07,071 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:07,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 26 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:36:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-03 03:36:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-03 03:36:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-03 03:36:07,130 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-03 03:36:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:07,130 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-03 03:36:07,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-03 03:36:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:36:07,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:07,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:07,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:36:07,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash 527899556, now seen corresponding path program 1 times [2022-11-03 03:36:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:07,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958550703] [2022-11-03 03:36:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:07,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:07,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958550703] [2022-11-03 03:36:07,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958550703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:07,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:07,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:36:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543546489] [2022-11-03 03:36:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:07,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:36:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:36:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:36:07,184 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:07,421 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-03 03:36:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:36:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 03:36:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:07,434 INFO L225 Difference]: With dead ends: 2154 [2022-11-03 03:36:07,434 INFO L226 Difference]: Without dead ends: 2154 [2022-11-03 03:36:07,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:36:07,435 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:07,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 20 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:36:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-03 03:36:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-03 03:36:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1902 states have (on average 2.879074658254469) internal successors, (5476), 1949 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-03 03:36:07,502 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-03 03:36:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:07,503 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-03 03:36:07,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-03 03:36:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:36:07,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:07,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:07,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:36:07,506 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 633487863, now seen corresponding path program 1 times [2022-11-03 03:36:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:07,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532818643] [2022-11-03 03:36:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:08,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:08,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532818643] [2022-11-03 03:36:08,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532818643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:08,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:08,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:36:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959682623] [2022-11-03 03:36:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:08,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:36:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:36:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:36:08,223 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:08,598 INFO L93 Difference]: Finished difference Result 1958 states and 5491 transitions. [2022-11-03 03:36:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:08,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-03 03:36:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:08,640 INFO L225 Difference]: With dead ends: 1958 [2022-11-03 03:36:08,641 INFO L226 Difference]: Without dead ends: 1958 [2022-11-03 03:36:08,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:08,644 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:08,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2022-11-03 03:36:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1953. [2022-11-03 03:36:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1905 states have (on average 2.877690288713911) internal successors, (5482), 1952 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-03 03:36:08,708 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-03 03:36:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:08,708 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-03 03:36:08,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-03 03:36:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:36:08,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:08,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:08,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:36:08,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash 505333492, now seen corresponding path program 1 times [2022-11-03 03:36:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:08,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509611915] [2022-11-03 03:36:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:08,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:08,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509611915] [2022-11-03 03:36:08,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509611915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:08,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:08,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:36:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182803376] [2022-11-03 03:36:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:08,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:36:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:08,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:36:08,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:36:08,815 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:08,909 INFO L93 Difference]: Finished difference Result 559 states and 1298 transitions. [2022-11-03 03:36:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:36:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:36:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:08,916 INFO L225 Difference]: With dead ends: 559 [2022-11-03 03:36:08,916 INFO L226 Difference]: Without dead ends: 537 [2022-11-03 03:36:08,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:36:08,918 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:08,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:36:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-03 03:36:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-03 03:36:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 519 states have (on average 2.420038535645472) internal successors, (1256), 536 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1256 transitions. [2022-11-03 03:36:08,936 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1256 transitions. Word has length 11 [2022-11-03 03:36:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:08,937 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1256 transitions. [2022-11-03 03:36:08,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1256 transitions. [2022-11-03 03:36:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:36:08,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:08,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:08,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:36:08,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash 657803752, now seen corresponding path program 1 times [2022-11-03 03:36:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:08,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837022626] [2022-11-03 03:36:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:09,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:09,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837022626] [2022-11-03 03:36:09,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837022626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:09,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:09,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482111974] [2022-11-03 03:36:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:09,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:09,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:09,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:09,878 INFO L87 Difference]: Start difference. First operand 537 states and 1256 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:10,375 INFO L93 Difference]: Finished difference Result 776 states and 1802 transitions. [2022-11-03 03:36:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:36:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:10,380 INFO L225 Difference]: With dead ends: 776 [2022-11-03 03:36:10,380 INFO L226 Difference]: Without dead ends: 776 [2022-11-03 03:36:10,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:36:10,380 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:10,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 18 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-11-03 03:36:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 592. [2022-11-03 03:36:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 2.4059233449477353) internal successors, (1381), 591 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-03 03:36:10,403 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-03 03:36:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:10,403 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-03 03:36:10,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-03 03:36:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:36:10,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:10,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:10,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:36:10,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1736858162, now seen corresponding path program 2 times [2022-11-03 03:36:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4428988] [2022-11-03 03:36:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:11,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:11,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4428988] [2022-11-03 03:36:11,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4428988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:11,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:11,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093855508] [2022-11-03 03:36:11,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:11,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:11,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:11,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:11,249 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:11,728 INFO L93 Difference]: Finished difference Result 820 states and 1902 transitions. [2022-11-03 03:36:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:36:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:11,733 INFO L225 Difference]: With dead ends: 820 [2022-11-03 03:36:11,733 INFO L226 Difference]: Without dead ends: 820 [2022-11-03 03:36:11,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:36:11,734 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:11,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-03 03:36:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 581. [2022-11-03 03:36:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.408525754884547) internal successors, (1356), 580 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-03 03:36:11,754 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-03 03:36:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:11,754 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-03 03:36:11,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-03 03:36:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:36:11,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:11,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:11,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:36:11,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1835467546, now seen corresponding path program 3 times [2022-11-03 03:36:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:11,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045040991] [2022-11-03 03:36:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:12,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045040991] [2022-11-03 03:36:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045040991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:12,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:12,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:36:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019400643] [2022-11-03 03:36:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:12,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:12,574 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:13,040 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2022-11-03 03:36:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:36:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 03:36:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:13,045 INFO L225 Difference]: With dead ends: 798 [2022-11-03 03:36:13,045 INFO L226 Difference]: Without dead ends: 798 [2022-11-03 03:36:13,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:36:13,046 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:13,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 18 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-03 03:36:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 570. [2022-11-03 03:36:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.411231884057971) internal successors, (1331), 569 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-03 03:36:13,070 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-03 03:36:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:13,071 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-03 03:36:13,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-03 03:36:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:36:13,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:13,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:13,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:36:13,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash 151555746, now seen corresponding path program 1 times [2022-11-03 03:36:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:13,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417916720] [2022-11-03 03:36:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:13,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:13,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417916720] [2022-11-03 03:36:13,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417916720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:13,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:13,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:36:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737948798] [2022-11-03 03:36:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:13,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:36:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:36:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:36:13,121 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:13,231 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-03 03:36:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:36:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 03:36:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:13,234 INFO L225 Difference]: With dead ends: 606 [2022-11-03 03:36:13,234 INFO L226 Difference]: Without dead ends: 606 [2022-11-03 03:36:13,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:36:13,235 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:13,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:36:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-03 03:36:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-03 03:36:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 588 states have (on average 2.391156462585034) internal successors, (1406), 605 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-03 03:36:13,253 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-03 03:36:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:13,254 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-03 03:36:13,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-03 03:36:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:36:13,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:13,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:36:13,256 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:36:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 988549789, now seen corresponding path program 1 times [2022-11-03 03:36:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:13,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299164968] [2022-11-03 03:36:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:14,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299164968] [2022-11-03 03:36:14,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299164968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:14,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903072895] [2022-11-03 03:36:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:14,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:14,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:36:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:14,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 03:36:14,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:14,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:14,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:14,640 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:36:14,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:36:14,668 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:36:14,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:36:14,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-03 03:36:16,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-03 03:36:24,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:36:32,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:32,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:36:43,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-03 03:36:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:36:57,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:03,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:37:03,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_499)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_499 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-03 03:37:03,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_499)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_499) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:37:03,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_497) .cse2 v_ArrVal_499)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_499) (not (<= v_ArrVal_497 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-03 03:37:03,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_497) .cse3 v_ArrVal_499)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_497) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_499))))) is different from false [2022-11-03 03:37:03,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_495)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_497) .cse2 v_ArrVal_499)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_497) (< (+ (select .cse0 .cse2) 1) v_ArrVal_499) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:37:03,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| Int) (v_ArrVal_503 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| 4)) v_ArrVal_495)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_497) .cse1 v_ArrVal_499)) |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_499) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_497)))))) is different from false [2022-11-03 03:37:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:37:03,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903072895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:03,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1236878282] [2022-11-03 03:37:03,533 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:37:03,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:03,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 03:37:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560139153] [2022-11-03 03:37:03,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:03,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:37:03,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:37:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=480, Unknown=33, NotChecked=364, Total=992 [2022-11-03 03:37:03,541 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:19,091 WARN L234 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 106 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:37:50,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3208) 1) (exists ((v_ArrVal_499 Int) (v_ArrVal_497 Int) (v_ArrVal_495 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| Int)) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_495))) (and (= .cse0 (store (store .cse1 .cse2 v_ArrVal_497) .cse3 v_ArrVal_499)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| 0) (<= v_ArrVal_497 (+ (select .cse1 .cse2) 1)) (<= v_ArrVal_499 (+ (select .cse1 .cse3) 1))))) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_501 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_503 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_501) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse4 .cse3))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_503) .cse2) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (let ((.cse5 (select .cse0 3204))) (or (<= .cse5 801) (<= 803 .cse5))))) is different from false [2022-11-03 03:38:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:16,153 INFO L93 Difference]: Finished difference Result 609 states and 1414 transitions. [2022-11-03 03:38:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:38:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:38:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:16,157 INFO L225 Difference]: With dead ends: 609 [2022-11-03 03:38:16,157 INFO L226 Difference]: Without dead ends: 609 [2022-11-03 03:38:16,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 120.5s TimeCoverageRelationStatistics Valid=217, Invalid=874, Unknown=63, NotChecked=568, Total=1722 [2022-11-03 03:38:16,158 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 753 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:16,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 88 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 0 Unknown, 753 Unchecked, 0.3s Time] [2022-11-03 03:38:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-11-03 03:38:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2022-11-03 03:38:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 591 states have (on average 2.3925549915397633) internal successors, (1414), 608 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1414 transitions. [2022-11-03 03:38:16,175 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1414 transitions. Word has length 16 [2022-11-03 03:38:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:16,176 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 1414 transitions. [2022-11-03 03:38:16,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1414 transitions. [2022-11-03 03:38:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:38:16,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:16,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:16,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:16,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 03:38:16,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:38:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 988549840, now seen corresponding path program 1 times [2022-11-03 03:38:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:16,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114868372] [2022-11-03 03:38:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:16,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114868372] [2022-11-03 03:38:16,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114868372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460262400] [2022-11-03 03:38:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:16,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:16,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:16,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:38:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:16,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 03:38:16,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:16,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:16,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:16,997 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:38:16,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:38:17,012 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:38:17,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:38:17,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-03 03:38:17,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-03 03:38:21,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:38:27,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:27,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:38:38,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-03 03:38:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:38:50,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:54,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) (+ 3208 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-03 03:38:54,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_595 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_595)) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (not (<= v_ArrVal_595 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-03 03:38:54,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_595 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_595)) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_595) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-11-03 03:38:54,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_595 Int) (v_ArrVal_593 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_593) .cse1 v_ArrVal_595)) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_595) (< (+ v_ArrVal_593 2147483648) 0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2022-11-03 03:38:54,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_595 Int) (v_ArrVal_593 Int) (v_ArrVal_592 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_592)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_593) .cse2 v_ArrVal_595)) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_595) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_593 2147483648) 0))))) is different from false [2022-11-03 03:38:54,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_595 Int) (v_ArrVal_593 Int) (v_ArrVal_592 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_592)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_593) .cse1 v_ArrVal_595)) |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_595) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse4 .cse1))) (< (+ v_ArrVal_593 2147483648) 0)))))) is different from false [2022-11-03 03:38:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:38:54,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460262400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:54,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980623953] [2022-11-03 03:38:54,531 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:38:54,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:54,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-11-03 03:38:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500917723] [2022-11-03 03:38:54,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:54,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:38:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:38:54,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=331, Unknown=26, NotChecked=258, Total=702 [2022-11-03 03:38:54,534 INFO L87 Difference]: Start difference. First operand 609 states and 1414 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:39:07,318 WARN L234 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 96 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:39:41,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (exists ((v_ArrVal_595 Int) (v_ArrVal_593 Int) (v_ArrVal_592 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_228| Int)) (let ((.cse0 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse1 0) .cse2 0) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_228| 4)) v_ArrVal_592))) (and (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_228| 0) (<= v_ArrVal_595 (+ (select .cse0 .cse1) 1)) (= (store (store .cse0 .cse2 v_ArrVal_593) .cse1 v_ArrVal_595) .cse3) (<= 0 (+ v_ArrVal_593 2147483648))))) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_598 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_597) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_598) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse4 .cse1)))))) (<= 0 (+ (select .cse3 3208) 2147483648)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:39:58,973 WARN L234 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 76 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:40:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:10,997 INFO L93 Difference]: Finished difference Result 1626 states and 3779 transitions. [2022-11-03 03:40:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:40:10,997 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:40:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:11,002 INFO L225 Difference]: With dead ends: 1626 [2022-11-03 03:40:11,003 INFO L226 Difference]: Without dead ends: 1626 [2022-11-03 03:40:11,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 112.7s TimeCoverageRelationStatistics Valid=203, Invalid=695, Unknown=60, NotChecked=448, Total=1406 [2022-11-03 03:40:11,004 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 209 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1184 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:11,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 156 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 541 Invalid, 0 Unknown, 1184 Unchecked, 0.6s Time] [2022-11-03 03:40:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-11-03 03:40:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 807. [2022-11-03 03:40:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 789 states have (on average 2.4512040557667936) internal successors, (1934), 806 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:40:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1934 transitions. [2022-11-03 03:40:11,032 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1934 transitions. Word has length 16 [2022-11-03 03:40:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:11,032 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1934 transitions. [2022-11-03 03:40:11,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:40:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1934 transitions. [2022-11-03 03:40:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:40:11,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:11,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:11,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:40:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:40:11,248 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:40:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 846963150, now seen corresponding path program 1 times [2022-11-03 03:40:11,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:11,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562542701] [2022-11-03 03:40:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:40:12,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562542701] [2022-11-03 03:40:12,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562542701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:40:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634385216] [2022-11-03 03:40:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:40:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:40:12,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:40:12,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:40:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:12,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 03:40:12,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:40:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:40:12,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:40:12,509 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:40:12,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:40:12,535 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:40:12,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:40:12,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:40:12,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-03 03:40:14,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-03 03:40:23,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:40:30,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:40:30,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:40:40,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-03 03:40:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:40:54,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:06,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:41:06,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_698 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-03 03:41:06,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_698) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-03 03:41:06,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_696) .cse1 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_698) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_696 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-03 03:41:06,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_696) .cse1 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_698) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_696) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:41:06,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_696 Int) (v_ArrVal_695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_695)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_696) .cse2 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_698) (< (+ (select .cse1 .cse3) 1) v_ArrVal_696) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-03 03:41:06,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_696 Int) (v_ArrVal_695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_701 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_695)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_696) .cse4 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_696) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse3 .cse4))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_698) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse2 .cse4)))))))) is different from false [2022-11-03 03:41:06,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_696 Int) (v_ArrVal_695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_701 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_695)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_696) .cse3 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_696) (< (+ (select .cse2 .cse3) 1) v_ArrVal_698) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse0 .cse3))))))))) is different from false [2022-11-03 03:41:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:41:06,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634385216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:06,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589991341] [2022-11-03 03:41:06,792 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:41:06,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:06,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:41:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251593904] [2022-11-03 03:41:06,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:06,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:41:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:41:06,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=556, Unknown=40, NotChecked=456, Total=1190 [2022-11-03 03:41:06,798 INFO L87 Difference]: Start difference. First operand 807 states and 1934 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:07,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= .cse0 (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse1 0) .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_698 Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_696 Int) (v_ArrVal_695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_701 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_693))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_695))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_696) .cse1 v_ArrVal_698)) |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) .cse2) 2147483647) (< (+ (select .cse4 .cse2) 1) v_ArrVal_696) (< (+ (select .cse4 .cse1) 1) v_ArrVal_698) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse3 .cse1))))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= (select .cse0 3208) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse0 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:41:24,076 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 96 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:42:27,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3208) 1) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (exists ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int)) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse2 0) .cse3 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_695))) (and (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 0) (<= v_ArrVal_698 (+ (select .cse1 .cse2) 1)) (<= v_ArrVal_696 (+ (select .cse1 .cse3) 1)) (= .cse0 (store (store .cse1 .cse3 v_ArrVal_696) .cse2 v_ArrVal_698))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 3204) 4) 4) (forall ((v_ArrVal_700 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (v_ArrVal_701 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_700) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse4 .cse2))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_701) .cse3) 2147483647)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:43:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:01,725 INFO L93 Difference]: Finished difference Result 1166 states and 2758 transitions. [2022-11-03 03:43:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:43:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:43:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:01,729 INFO L225 Difference]: With dead ends: 1166 [2022-11-03 03:43:01,729 INFO L226 Difference]: Without dead ends: 1166 [2022-11-03 03:43:01,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 167.9s TimeCoverageRelationStatistics Valid=323, Invalid=1281, Unknown=76, NotChecked=870, Total=2550 [2022-11-03 03:43:01,731 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 215 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1931 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:01,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 164 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 650 Invalid, 0 Unknown, 1931 Unchecked, 0.6s Time] [2022-11-03 03:43:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-11-03 03:43:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 950. [2022-11-03 03:43:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 932 states have (on average 2.429184549356223) internal successors, (2264), 949 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2264 transitions. [2022-11-03 03:43:01,759 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2264 transitions. Word has length 17 [2022-11-03 03:43:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:01,759 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 2264 transitions. [2022-11-03 03:43:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2264 transitions. [2022-11-03 03:43:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:43:01,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:01,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:01,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-03 03:43:01,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:01,987 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:43:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1972386568, now seen corresponding path program 2 times [2022-11-03 03:43:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:01,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014313098] [2022-11-03 03:43:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:02,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:02,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014313098] [2022-11-03 03:43:02,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014313098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523479934] [2022-11-03 03:43:02,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:43:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:02,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:02,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:43:03,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:43:03,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:43:03,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-03 03:43:03,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:03,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:03,173 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:43:03,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:43:03,202 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:43:03,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:43:03,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:43:03,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-03 03:43:04,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-03 03:43:12,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:43:20,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:20,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:43:30,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-03 03:43:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:43:44,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:53,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:43:53,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_800 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_800 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:43:53,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_800 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_800) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:43:53,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_798) .cse2 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_800) (not (<= v_ArrVal_798 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-03 03:43:53,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_798) .cse3 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_798) (< (+ (select .cse1 .cse3) 1) v_ArrVal_800))))) is different from false [2022-11-03 03:43:53,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_796)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_798) .cse2 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_798))))) is different from false [2022-11-03 03:43:53,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_796)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_798) .cse1 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_798) (< (+ (select .cse3 .cse1) 1) v_ArrVal_800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse1)))))))) is different from false [2022-11-03 03:43:53,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_795))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_796)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_798) .cse2 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_798) (< (+ (select .cse0 .cse2) 1) v_ArrVal_800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse3 .cse2))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse4 .cse2))))))))) is different from false [2022-11-03 03:43:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:43:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523479934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1232462525] [2022-11-03 03:43:53,902 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:43:53,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:43:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157302676] [2022-11-03 03:43:53,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:53,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:43:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:43:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=561, Unknown=35, NotChecked=456, Total=1190 [2022-11-03 03:43:53,905 INFO L87 Difference]: Start difference. First operand 950 states and 2264 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:43:55,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= .cse0 (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse1 0) .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (= (select .cse0 3208) 0) (forall ((v_ArrVal_796 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_795))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_796))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_798) .cse1 v_ArrVal_800)) |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse2) 1) v_ArrVal_798) (< (+ (select .cse3 .cse1) 1) v_ArrVal_800) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse1))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse5 .cse1))))))))) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= (select .cse0 3204) 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:44:00,187 WARN L234 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 66 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:44:14,175 WARN L234 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 96 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:45:36,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3208) 1) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| Int) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_802) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| (select .cse1 .cse2))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_240| 4)) v_ArrVal_804) .cse3) 2147483647)))) (exists ((v_ArrVal_796 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_238| Int) (v_ArrVal_800 Int) (v_ArrVal_798 Int)) (let ((.cse4 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse2 0) .cse3 0) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_238| 4)) v_ArrVal_796))) (and (= .cse0 (store (store .cse4 .cse3 v_ArrVal_798) .cse2 v_ArrVal_800)) (<= v_ArrVal_798 (+ (select .cse4 .cse3) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_238| 0) (<= v_ArrVal_800 (+ (select .cse4 .cse2) 1))))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 3204) 4) 4) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:46:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:15,562 INFO L93 Difference]: Finished difference Result 1255 states and 2959 transitions. [2022-11-03 03:46:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:46:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:46:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:15,567 INFO L225 Difference]: With dead ends: 1255 [2022-11-03 03:46:15,567 INFO L226 Difference]: Without dead ends: 1255 [2022-11-03 03:46:15,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 191.4s TimeCoverageRelationStatistics Valid=299, Invalid=1075, Unknown=72, NotChecked=810, Total=2256 [2022-11-03 03:46:15,568 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 167 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1116 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:15,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 146 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 419 Invalid, 0 Unknown, 1116 Unchecked, 0.4s Time] [2022-11-03 03:46:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-11-03 03:46:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1048. [2022-11-03 03:46:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1030 states have (on average 2.4475728155339804) internal successors, (2521), 1047 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2521 transitions. [2022-11-03 03:46:15,595 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2521 transitions. Word has length 17 [2022-11-03 03:46:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:15,596 INFO L495 AbstractCegarLoop]: Abstraction has 1048 states and 2521 transitions. [2022-11-03 03:46:15,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2521 transitions. [2022-11-03 03:46:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:46:15,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:15,598 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:15,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:46:15,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:46:15,826 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:46:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1430157838, now seen corresponding path program 3 times [2022-11-03 03:46:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:15,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905182534] [2022-11-03 03:46:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:46:16,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:16,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905182534] [2022-11-03 03:46:16,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905182534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:46:16,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411085833] [2022-11-03 03:46:16,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:46:16,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:16,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:46:16,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:46:16,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:46:16,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:46:16,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 03:46:16,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:46:16,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-03 03:46:16,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:16,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:16,946 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:46:16,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 20 [2022-11-03 03:46:16,972 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:46:16,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:46:17,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 03:46:17,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:46:17,187 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-03 03:46:17,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-03 03:46:17,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:17,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:46:17,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-03 03:46:17,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-03 03:46:17,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:17,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 03:46:17,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:46:17,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:17,644 INFO L356 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-03 03:46:17,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-03 03:46:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:46:17,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:46:25,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:46:25,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_899 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:46:25,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_899) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:46:25,287 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_899) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= 800 .cse0)))) is different from false [2022-11-03 03:46:25,326 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_897) .cse3 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_899) (not (<= v_ArrVal_897 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (= 800 .cse0)))) is different from false [2022-11-03 03:46:25,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse0 .cse4))) (or (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_897) .cse4 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_897) (< (+ .cse2 1) v_ArrVal_899) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (= 800 .cse2)))) is different from false [2022-11-03 03:46:25,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 Int) (v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_894)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_897) .cse4 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|)) (.cse3 (select .cse1 .cse4))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_897) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_899) (= .cse3 800))))) is different from false [2022-11-03 03:46:25,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 Int) (v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_894)))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_897) .cse2 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_899) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse1 .cse2))) (= .cse0 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_897) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) .cse4) 2147483647)))))) is different from false [2022-11-03 03:46:25,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 Int) (v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int) (v_ArrVal_893 (Array Int Int)) (v_ArrVal_899 Int) (v_ArrVal_897 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_893))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_894))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_897) .cse4 v_ArrVal_899)) |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|)) (.cse3 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_897) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) .cse1) 2147483647) (< (+ .cse3 1) v_ArrVal_899) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse4))) (= .cse3 800)))))) is different from false [2022-11-03 03:46:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:46:25,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411085833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:46:25,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669651136] [2022-11-03 03:46:25,574 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:46:25,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:46:25,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2022-11-03 03:46:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681818336] [2022-11-03 03:46:25,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:46:25,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 03:46:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 03:46:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=539, Unknown=15, NotChecked=522, Total=1260 [2022-11-03 03:46:25,578 INFO L87 Difference]: Start difference. First operand 1048 states and 2521 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:27,121 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (<= (select .cse0 .cse1) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (<= (select (select |c_#memory_int| 7) 3208) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (forall ((v_ArrVal_900 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_901 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_900) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_901) .cse3) 2147483647)))) (= 7 |c_~#queue~0.base|) (<= (select .cse0 .cse3) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:46:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:27,507 INFO L93 Difference]: Finished difference Result 1417 states and 3362 transitions. [2022-11-03 03:46:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:46:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:46:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:27,511 INFO L225 Difference]: With dead ends: 1417 [2022-11-03 03:46:27,511 INFO L226 Difference]: Without dead ends: 1417 [2022-11-03 03:46:27,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=325, Invalid=889, Unknown=16, NotChecked=750, Total=1980 [2022-11-03 03:46:27,512 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 238 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1129 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:27,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 103 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 556 Invalid, 0 Unknown, 1129 Unchecked, 0.5s Time] [2022-11-03 03:46:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2022-11-03 03:46:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 948. [2022-11-03 03:46:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 930 states have (on average 2.447311827956989) internal successors, (2276), 947 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2276 transitions. [2022-11-03 03:46:27,537 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2276 transitions. Word has length 17 [2022-11-03 03:46:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:27,538 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 2276 transitions. [2022-11-03 03:46:27,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2276 transitions. [2022-11-03 03:46:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:46:27,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:27,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:27,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:46:27,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:46:27,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:46:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -650076545, now seen corresponding path program 1 times [2022-11-03 03:46:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:27,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279548195] [2022-11-03 03:46:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:46:28,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279548195] [2022-11-03 03:46:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279548195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:46:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890134809] [2022-11-03 03:46:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:28,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:28,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:28,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:46:28,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:46:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:28,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 03:46:28,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:46:29,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:46:29,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 03:46:29,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:29,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 03:46:29,228 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 03:46:29,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-03 03:46:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:46:29,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:46:43,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_986 Int)) (or (< (+ v_ArrVal_986 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_986) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-11-03 03:46:43,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_986 Int)) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_984)) |c_~#stored_elements~0.base| v_ArrVal_985) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_986) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_986 2147483648) 0))) is different from false [2022-11-03 03:46:43,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:46:43,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 03:46:43,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:46:43,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 59 [2022-11-03 03:46:43,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-03 03:46:43,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-03 03:46:43,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:46:43,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-11-03 03:46:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:46:43,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890134809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:46:43,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [826785927] [2022-11-03 03:46:43,913 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:46:43,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:46:43,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 25 [2022-11-03 03:46:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622858815] [2022-11-03 03:46:43,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:46:43,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:46:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:46:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:46:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=482, Unknown=15, NotChecked=94, Total=702 [2022-11-03 03:46:43,916 INFO L87 Difference]: Start difference. First operand 948 states and 2276 transitions. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:46:45,386 INFO L93 Difference]: Finished difference Result 1576 states and 3737 transitions. [2022-11-03 03:46:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:46:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:46:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:46:45,392 INFO L225 Difference]: With dead ends: 1576 [2022-11-03 03:46:45,392 INFO L226 Difference]: Without dead ends: 1576 [2022-11-03 03:46:45,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=274, Invalid=909, Unknown=15, NotChecked=134, Total=1332 [2022-11-03 03:46:45,393 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 497 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 491 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:46:45,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 100 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 947 Invalid, 0 Unknown, 491 Unchecked, 0.8s Time] [2022-11-03 03:46:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-11-03 03:46:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 826. [2022-11-03 03:46:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 808 states have (on average 2.4542079207920793) internal successors, (1983), 825 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1983 transitions. [2022-11-03 03:46:45,417 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1983 transitions. Word has length 17 [2022-11-03 03:46:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:46:45,418 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1983 transitions. [2022-11-03 03:46:45,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:46:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1983 transitions. [2022-11-03 03:46:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:46:45,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:46:45,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:46:45,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:46:45,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:45,647 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:46:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:46:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 859798748, now seen corresponding path program 4 times [2022-11-03 03:46:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:46:45,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991601073] [2022-11-03 03:46:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:46:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:46:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:46:47,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:46:47,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991601073] [2022-11-03 03:46:47,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991601073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:46:47,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293262100] [2022-11-03 03:46:47,346 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:46:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:46:47,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:46:47,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:46:47,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:46:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:46:47,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-03 03:46:47,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:46:47,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:47,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:46:47,559 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:46:47,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 03:46:47,578 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:46:47,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:46:47,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-03 03:46:49,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-03 03:47:00,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 03:47:05,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:47:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:15,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:47:31,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-03 03:47:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:47:47,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:55,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-03 03:47:55,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1086 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-03 03:47:55,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1086))))) is different from false [2022-11-03 03:47:55,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1086) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-03 03:47:55,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1086) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))))) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2)))) is different from false [2022-11-03 03:47:55,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1083)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1083 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1086)))))) (= 800 (select .cse4 .cse2)))) is different from false [2022-11-03 03:47:55,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1083)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1083) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1086))))))) (= 800 (select .cse0 .cse4)))) is different from false [2022-11-03 03:47:55,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1081 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1081)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse3 v_ArrVal_1083)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085))) (let ((.cse4 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse2 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= (select .cse1 .cse2) 800) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1083) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1086))))))) is different from false [2022-11-03 03:47:55,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_255| Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1081 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_255| 4)) v_ArrVal_1081)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1083)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1086)) |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_255| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1086) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse3 .cse1))) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_1083) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) .cse5) 2147483647) (= (select .cse4 .cse1) 800)))))))) is different from false [2022-11-03 03:47:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:47:55,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293262100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:55,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323493703] [2022-11-03 03:47:55,893 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:47:55,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:55,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2022-11-03 03:47:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583209915] [2022-11-03 03:47:55,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 03:47:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 03:47:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=558, Unknown=38, NotChecked=522, Total=1260 [2022-11-03 03:47:55,897 INFO L87 Difference]: Start difference. First operand 826 states and 1983 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:48:03,393 WARN L234 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 94 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:48:28,685 WARN L234 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 133 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:49:24,117 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 3208) 1) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| Int) (v_ArrVal_1089 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1088) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| 4)) v_ArrVal_1089) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_254| (select .cse1 .cse3)))))) (= 7 |c_~#queue~0.base|) (exists ((v_ArrVal_1083 Int) (v_ArrVal_1086 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_252| Int) (v_ArrVal_1081 Int)) (let ((.cse4 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_~#queue~0.offset|) 0) .cse3 0) .cse2 0) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_252| 4)) v_ArrVal_1081))) (and (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_252| 0) (<= v_ArrVal_1086 (+ (select .cse4 .cse3) 1)) (<= v_ArrVal_1083 (+ (select .cse4 .cse2) 1)) (= .cse0 (store (store .cse4 .cse2 v_ArrVal_1083) .cse3 v_ArrVal_1086))))) (<= (* (select .cse0 3204) 4) 4) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:50:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:03,630 INFO L93 Difference]: Finished difference Result 936 states and 2249 transitions. [2022-11-03 03:50:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:50:03,631 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 03:50:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:03,633 INFO L225 Difference]: With dead ends: 936 [2022-11-03 03:50:03,633 INFO L226 Difference]: Without dead ends: 936 [2022-11-03 03:50:03,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 195.2s TimeCoverageRelationStatistics Valid=261, Invalid=1035, Unknown=76, NotChecked=790, Total=2162 [2022-11-03 03:50:03,635 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1107 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:03,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 141 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 1107 Unchecked, 0.3s Time] [2022-11-03 03:50:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-11-03 03:50:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 903. [2022-11-03 03:50:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 885 states have (on average 2.456497175141243) internal successors, (2174), 902 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2174 transitions. [2022-11-03 03:50:03,655 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2174 transitions. Word has length 17 [2022-11-03 03:50:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:03,655 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 2174 transitions. [2022-11-03 03:50:03,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2174 transitions. [2022-11-03 03:50:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:50:03,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:03,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:03,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:03,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:03,871 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:50:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 859798799, now seen corresponding path program 2 times [2022-11-03 03:50:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:03,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094772923] [2022-11-03 03:50:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:04,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:04,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094772923] [2022-11-03 03:50:04,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094772923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:04,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116776282] [2022-11-03 03:50:04,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:50:04,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:04,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:04,790 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:04,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e12abd-fc6e-4d85-8c62-a1848cb6a1cc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:50:05,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:50:05,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:50:05,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:50:05,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:05,059 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:50:05,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:50:05,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:50:05,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:05,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 03:50:05,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 03:50:05,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:50:05,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 03:50:05,447 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 03:50:05,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-03 03:50:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:50:05,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:15,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1177 Int) (v_ArrVal_1176 (Array Int Int))) (or (< (+ v_ArrVal_1177 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1176) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1177) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-11-03 03:50:15,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1174 Int) (v_ArrVal_1177 Int) (v_ArrVal_1176 (Array Int Int))) (or (< (+ v_ArrVal_1177 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1174)) |c_~#stored_elements~0.base| v_ArrVal_1176) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1177) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-11-03 03:50:15,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1174 Int) (v_ArrVal_1177 Int) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< (+ v_ArrVal_1177 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1173))) (store .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1174))) |c_~#stored_elements~0.base| v_ArrVal_1176) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1177) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-11-03 03:50:15,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:15,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-11-03 03:50:15,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:15,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4417 treesize of output 4367 [2022-11-03 03:50:15,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5310 treesize of output 4990 [2022-11-03 03:50:15,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6670 treesize of output 6462 [2022-11-03 03:50:15,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:15,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2037 treesize of output 1977 [2022-11-03 03:50:16,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:50:16,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5806 treesize of output 5738