./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:59:11,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:59:11,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:59:11,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:59:11,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:59:11,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:59:11,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:59:11,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:59:11,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:59:11,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:59:11,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:59:11,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:59:11,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:59:11,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:59:11,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:59:11,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:59:11,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:59:11,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:59:11,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:59:11,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:59:11,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:59:11,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:59:11,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:59:11,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:59:11,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:59:11,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:59:11,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:59:11,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:59:11,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:59:11,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:59:11,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:59:11,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:59:11,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:59:11,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:59:11,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:59:11,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:59:11,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:59:11,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:59:11,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:59:11,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:59:11,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:59:11,291 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 16:59:11,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:59:11,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:59:11,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:59:11,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:59:11,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:59:11,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:59:11,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:59:11,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:59:11,336 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:59:11,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:59:11,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:59:11,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:59:11,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:59:11,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:59:11,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:59:11,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:59:11,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:59:11,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:59:11,340 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:59:11,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:59:11,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:59:11,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:59:11,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:59:11,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:59:11,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:59:11,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:59:11,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:59:11,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:59:11,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:59:11,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:59:11,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:59:11,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:59:11,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:59:11,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:59:11,345 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:59:11,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:59:11,346 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/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_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-25 16:59:11,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:59:11,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:59:11,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:59:11,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:59:11,748 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:59:11,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 16:59:14,980 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:59:15,326 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:59:15,327 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 16:59:15,347 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/data/c9d25c144/2014cbd389ef45888b36e31081dd59d8/FLAGd85c4c255 [2022-11-25 16:59:15,364 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/data/c9d25c144/2014cbd389ef45888b36e31081dd59d8 [2022-11-25 16:59:15,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:59:15,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:59:15,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:59:15,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:59:15,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:59:15,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:59:15" (1/1) ... [2022-11-25 16:59:15,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba31fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:15, skipping insertion in model container [2022-11-25 16:59:15,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:59:15" (1/1) ... [2022-11-25 16:59:15,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:59:15,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:59:16,000 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 16:59:16,009 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 16:59:16,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:59:16,039 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:59:16,129 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 16:59:16,133 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 16:59:16,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:59:16,197 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:59:16,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16 WrapperNode [2022-11-25 16:59:16,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:59:16,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:59:16,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:59:16,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:59:16,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,265 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-25 16:59:16,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:59:16,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:59:16,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:59:16,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:59:16,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,298 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:59:16,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:59:16,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:59:16,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:59:16,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (1/1) ... [2022-11-25 16:59:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:59:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:59:16,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:59:16,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:59:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 16:59:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 16:59:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 16:59:16,407 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 16:59:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:59:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:59:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:59:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:59:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 16:59:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:59:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:59:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:59:16,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:59:16,411 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:59:16,716 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:59:16,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:59:17,254 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:59:17,274 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:59:17,274 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:59:17,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:59:17 BoogieIcfgContainer [2022-11-25 16:59:17,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:59:17,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:59:17,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:59:17,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:59:17,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:59:15" (1/3) ... [2022-11-25 16:59:17,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273bd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:59:17, skipping insertion in model container [2022-11-25 16:59:17,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:59:16" (2/3) ... [2022-11-25 16:59:17,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273bd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:59:17, skipping insertion in model container [2022-11-25 16:59:17,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:59:17" (3/3) ... [2022-11-25 16:59:17,296 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-25 16:59:17,308 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:59:17,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:59:17,321 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 16:59:17,321 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:59:17,518 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 16:59:17,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 16:59:17,766 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-25 16:59:17,767 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 16:59:17,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 16:59:17,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 16:59:17,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-25 16:59:17,798 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:59:17,841 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-25 16:59:17,844 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-25 16:59:17,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-11-25 16:59:18,049 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-11-25 16:59:18,049 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 16:59:18,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 239 events. 13/239 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 373 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 16:59:18,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-25 16:59:30,967 INFO L134 LiptonReduction]: Checked pairs total: 31775 [2022-11-25 16:59:30,967 INFO L136 LiptonReduction]: Total number of compositions: 227 [2022-11-25 16:59:30,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:59:30,992 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=PETRI_NET, 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;@6a2e4d3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:59:30,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 16:59:30,999 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-11-25 16:59:30,999 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 16:59:31,000 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:31,000 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:31,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1252954978, now seen corresponding path program 1 times [2022-11-25 16:59:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:31,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219826293] [2022-11-25 16:59:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:32,387 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-25 16:59:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219826293] [2022-11-25 16:59:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219826293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:32,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862759148] [2022-11-25 16:59:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:32,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:32,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:32,781 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-25 16:59:32,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 0 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-25 16:59:32,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:32,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-25 16:59:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:33,390 INFO L130 PetriNetUnfolder]: 1630/2709 cut-off events. [2022-11-25 16:59:33,390 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 16:59:33,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 2709 events. 1630/2709 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13810 event pairs, 1187 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 5193. Up to 2621 conditions per place. [2022-11-25 16:59:33,411 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 58 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2022-11-25 16:59:33,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 281 flow [2022-11-25 16:59:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1192 transitions. [2022-11-25 16:59:33,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49874476987447697 [2022-11-25 16:59:33,441 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1192 transitions. [2022-11-25 16:59:33,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1192 transitions. [2022-11-25 16:59:33,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:33,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1192 transitions. [2022-11-25 16:59:33,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.4) internal successors, (1192), 5 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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-25 16:59:33,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:33,472 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:33,474 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 5 states and 1192 transitions. [2022-11-25 16:59:33,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 281 flow [2022-11-25 16:59:33,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:33,491 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 169 flow [2022-11-25 16:59:33,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2022-11-25 16:59:33,497 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2022-11-25 16:59:33,497 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 169 flow [2022-11-25 16:59:33,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.4) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 0 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-25 16:59:33,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:33,500 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:33,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:59:33,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 186648025, now seen corresponding path program 1 times [2022-11-25 16:59:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227546042] [2022-11-25 16:59:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:34,917 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-25 16:59:34,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:34,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227546042] [2022-11-25 16:59:34,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227546042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:34,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:34,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495975717] [2022-11-25 16:59:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:34,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:34,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:35,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-25 16:59:35,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 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-25 16:59:35,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:35,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-25 16:59:35,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:36,987 INFO L130 PetriNetUnfolder]: 2142/3574 cut-off events. [2022-11-25 16:59:36,987 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-11-25 16:59:36,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7462 conditions, 3574 events. 2142/3574 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19702 event pairs, 431 based on Foata normal form. 31/2775 useless extension candidates. Maximal degree in co-relation 6359. Up to 2644 conditions per place. [2022-11-25 16:59:37,008 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 112 selfloop transitions, 13 changer transitions 0/131 dead transitions. [2022-11-25 16:59:37,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 131 transitions, 566 flow [2022-11-25 16:59:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1234 transitions. [2022-11-25 16:59:37,012 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5163179916317991 [2022-11-25 16:59:37,012 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1234 transitions. [2022-11-25 16:59:37,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1234 transitions. [2022-11-25 16:59:37,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:37,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1234 transitions. [2022-11-25 16:59:37,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.8) internal successors, (1234), 5 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:59:37,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:37,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:37,023 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 169 flow. Second operand 5 states and 1234 transitions. [2022-11-25 16:59:37,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 131 transitions, 566 flow [2022-11-25 16:59:37,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:59:37,033 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 241 flow [2022-11-25 16:59:37,034 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2022-11-25 16:59:37,034 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2022-11-25 16:59:37,035 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 241 flow [2022-11-25 16:59:37,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 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-25 16:59:37,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:37,036 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:37,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:59:37,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash 186900985, now seen corresponding path program 2 times [2022-11-25 16:59:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:37,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745181417] [2022-11-25 16:59:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:37,519 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-25 16:59:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745181417] [2022-11-25 16:59:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745181417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:37,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:37,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612457222] [2022-11-25 16:59:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:37,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:37,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-25 16:59:37,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 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-25 16:59:37,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:37,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-25 16:59:37,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:38,419 INFO L130 PetriNetUnfolder]: 2242/3746 cut-off events. [2022-11-25 16:59:38,419 INFO L131 PetriNetUnfolder]: For 825/825 co-relation queries the response was YES. [2022-11-25 16:59:38,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8409 conditions, 3746 events. 2242/3746 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 20728 event pairs, 498 based on Foata normal form. 31/2924 useless extension candidates. Maximal degree in co-relation 7558. Up to 2646 conditions per place. [2022-11-25 16:59:38,443 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 114 selfloop transitions, 14 changer transitions 0/134 dead transitions. [2022-11-25 16:59:38,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 637 flow [2022-11-25 16:59:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2022-11-25 16:59:38,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5158995815899582 [2022-11-25 16:59:38,447 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1233 transitions. [2022-11-25 16:59:38,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1233 transitions. [2022-11-25 16:59:38,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:38,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1233 transitions. [2022-11-25 16:59:38,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.6) internal successors, (1233), 5 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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-25 16:59:38,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:38,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:38,458 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 241 flow. Second operand 5 states and 1233 transitions. [2022-11-25 16:59:38,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 637 flow [2022-11-25 16:59:38,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 134 transitions, 623 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-11-25 16:59:38,472 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 286 flow [2022-11-25 16:59:38,473 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2022-11-25 16:59:38,473 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2022-11-25 16:59:38,474 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 286 flow [2022-11-25 16:59:38,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 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-25 16:59:38,475 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:38,475 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:38,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:59:38,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1122777527, now seen corresponding path program 1 times [2022-11-25 16:59:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:38,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342884704] [2022-11-25 16:59:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:38,571 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-25 16:59:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:38,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342884704] [2022-11-25 16:59:38,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342884704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:38,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:38,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727714506] [2022-11-25 16:59:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:38,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:38,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:38,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:38,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:38,610 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 16:59:38,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 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-25 16:59:38,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:38,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 16:59:38,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:39,495 INFO L130 PetriNetUnfolder]: 3803/6216 cut-off events. [2022-11-25 16:59:39,495 INFO L131 PetriNetUnfolder]: For 2435/2435 co-relation queries the response was YES. [2022-11-25 16:59:39,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14330 conditions, 6216 events. 3803/6216 cut-off events. For 2435/2435 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 36683 event pairs, 1835 based on Foata normal form. 0/4758 useless extension candidates. Maximal degree in co-relation 12990. Up to 3768 conditions per place. [2022-11-25 16:59:39,542 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 149 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2022-11-25 16:59:39,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 158 transitions, 889 flow [2022-11-25 16:59:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1053 transitions. [2022-11-25 16:59:39,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5507322175732218 [2022-11-25 16:59:39,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1053 transitions. [2022-11-25 16:59:39,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1053 transitions. [2022-11-25 16:59:39,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:39,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1053 transitions. [2022-11-25 16:59:39,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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-25 16:59:39,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 16:59:39,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 16:59:39,555 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 286 flow. Second operand 4 states and 1053 transitions. [2022-11-25 16:59:39,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 158 transitions, 889 flow [2022-11-25 16:59:39,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 158 transitions, 853 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:39,567 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 303 flow [2022-11-25 16:59:39,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2022-11-25 16:59:39,568 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2022-11-25 16:59:39,568 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 303 flow [2022-11-25 16:59:39,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 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-25 16:59:39,569 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:39,569 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:39,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:59:39,569 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash -782335406, now seen corresponding path program 1 times [2022-11-25 16:59:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576987848] [2022-11-25 16:59:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:39,880 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-25 16:59:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:39,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576987848] [2022-11-25 16:59:39,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576987848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:39,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:39,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189225064] [2022-11-25 16:59:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:39,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:40,135 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 478 [2022-11-25 16:59:40,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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-25 16:59:40,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:40,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 478 [2022-11-25 16:59:40,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:41,121 INFO L130 PetriNetUnfolder]: 3992/6678 cut-off events. [2022-11-25 16:59:41,122 INFO L131 PetriNetUnfolder]: For 2601/2605 co-relation queries the response was YES. [2022-11-25 16:59:41,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15628 conditions, 6678 events. 3992/6678 cut-off events. For 2601/2605 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 41272 event pairs, 2230 based on Foata normal form. 0/5432 useless extension candidates. Maximal degree in co-relation 10304. Up to 5787 conditions per place. [2022-11-25 16:59:41,185 INFO L137 encePairwiseOnDemand]: 466/478 looper letters, 101 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2022-11-25 16:59:41,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 651 flow [2022-11-25 16:59:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1204 transitions. [2022-11-25 16:59:41,189 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.503765690376569 [2022-11-25 16:59:41,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1204 transitions. [2022-11-25 16:59:41,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1204 transitions. [2022-11-25 16:59:41,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:41,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1204 transitions. [2022-11-25 16:59:41,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-25 16:59:41,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:41,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:41,200 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 303 flow. Second operand 5 states and 1204 transitions. [2022-11-25 16:59:41,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 651 flow [2022-11-25 16:59:41,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:41,218 INFO L231 Difference]: Finished difference. Result has 83 places, 86 transitions, 391 flow [2022-11-25 16:59:41,218 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2022-11-25 16:59:41,221 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2022-11-25 16:59:41,221 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 391 flow [2022-11-25 16:59:41,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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-25 16:59:41,222 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:41,222 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:41,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:59:41,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash -782335366, now seen corresponding path program 1 times [2022-11-25 16:59:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:41,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363514635] [2022-11-25 16:59:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:41,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:43,051 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-25 16:59:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:43,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363514635] [2022-11-25 16:59:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363514635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:43,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:43,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432175174] [2022-11-25 16:59:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:43,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:59:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:43,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:59:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:59:44,221 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-25 16:59:44,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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-25 16:59:44,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:44,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-25 16:59:44,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:45,699 INFO L130 PetriNetUnfolder]: 4038/6803 cut-off events. [2022-11-25 16:59:45,699 INFO L131 PetriNetUnfolder]: For 3502/3506 co-relation queries the response was YES. [2022-11-25 16:59:45,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17036 conditions, 6803 events. 4038/6803 cut-off events. For 3502/3506 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 41919 event pairs, 2259 based on Foata normal form. 2/5771 useless extension candidates. Maximal degree in co-relation 11873. Up to 5910 conditions per place. [2022-11-25 16:59:45,738 INFO L137 encePairwiseOnDemand]: 466/478 looper letters, 102 selfloop transitions, 18 changer transitions 0/126 dead transitions. [2022-11-25 16:59:45,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 126 transitions, 767 flow [2022-11-25 16:59:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1449 transitions. [2022-11-25 16:59:45,743 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5052301255230126 [2022-11-25 16:59:45,743 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1449 transitions. [2022-11-25 16:59:45,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1449 transitions. [2022-11-25 16:59:45,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:45,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1449 transitions. [2022-11-25 16:59:45,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 0 states have call successors, (0), 0 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-25 16:59:45,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 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-25 16:59:45,754 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 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-25 16:59:45,754 INFO L175 Difference]: Start difference. First operand has 83 places, 86 transitions, 391 flow. Second operand 6 states and 1449 transitions. [2022-11-25 16:59:45,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 126 transitions, 767 flow [2022-11-25 16:59:45,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:45,770 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 485 flow [2022-11-25 16:59:45,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2022-11-25 16:59:45,773 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 28 predicate places. [2022-11-25 16:59:45,773 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 485 flow [2022-11-25 16:59:45,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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-25 16:59:45,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:45,775 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:45,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:59:45,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1554621222, now seen corresponding path program 1 times [2022-11-25 16:59:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:45,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916614376] [2022-11-25 16:59:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:46,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-25 16:59:46,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:46,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916614376] [2022-11-25 16:59:46,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916614376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:46,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:46,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:59:46,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392850351] [2022-11-25 16:59:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:46,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:59:46,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:46,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:59:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:59:47,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-25 16:59:47,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 485 flow. Second operand has 7 states, 7 states have (on average 223.57142857142858) internal successors, (1565), 7 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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-25 16:59:47,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:47,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-25 16:59:47,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:49,404 INFO L130 PetriNetUnfolder]: 4255/7173 cut-off events. [2022-11-25 16:59:49,404 INFO L131 PetriNetUnfolder]: For 5294/5326 co-relation queries the response was YES. [2022-11-25 16:59:49,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18567 conditions, 7173 events. 4255/7173 cut-off events. For 5294/5326 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 44989 event pairs, 736 based on Foata normal form. 147/6254 useless extension candidates. Maximal degree in co-relation 14060. Up to 5353 conditions per place. [2022-11-25 16:59:49,475 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 138 selfloop transitions, 16 changer transitions 0/160 dead transitions. [2022-11-25 16:59:49,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 160 transitions, 996 flow [2022-11-25 16:59:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:59:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:59:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1238 transitions. [2022-11-25 16:59:49,480 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2022-11-25 16:59:49,481 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1238 transitions. [2022-11-25 16:59:49,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1238 transitions. [2022-11-25 16:59:49,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:49,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1238 transitions. [2022-11-25 16:59:49,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.6) internal successors, (1238), 5 states have internal predecessors, (1238), 0 states have call successors, (0), 0 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-25 16:59:49,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:49,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 16:59:49,491 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 485 flow. Second operand 5 states and 1238 transitions. [2022-11-25 16:59:49,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 160 transitions, 996 flow [2022-11-25 16:59:49,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 160 transitions, 978 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:49,528 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 531 flow [2022-11-25 16:59:49,529 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2022-11-25 16:59:49,529 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 31 predicate places. [2022-11-25 16:59:49,530 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 531 flow [2022-11-25 16:59:49,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 223.57142857142858) internal successors, (1565), 7 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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-25 16:59:49,531 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:49,531 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:49,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:59:49,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1519215332, now seen corresponding path program 2 times [2022-11-25 16:59:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:49,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712774823] [2022-11-25 16:59:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:50,465 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-25 16:59:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:50,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712774823] [2022-11-25 16:59:50,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712774823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:50,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:50,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:59:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939983720] [2022-11-25 16:59:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:50,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:59:50,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:50,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:59:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:59:51,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-25 16:59:51,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 531 flow. Second operand has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 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-25 16:59:51,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:51,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-25 16:59:51,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:52,399 INFO L130 PetriNetUnfolder]: 4629/7819 cut-off events. [2022-11-25 16:59:52,399 INFO L131 PetriNetUnfolder]: For 8721/8747 co-relation queries the response was YES. [2022-11-25 16:59:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20929 conditions, 7819 events. 4629/7819 cut-off events. For 8721/8747 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 48311 event pairs, 1007 based on Foata normal form. 147/6841 useless extension candidates. Maximal degree in co-relation 15364. Up to 4467 conditions per place. [2022-11-25 16:59:52,447 INFO L137 encePairwiseOnDemand]: 465/478 looper letters, 156 selfloop transitions, 31 changer transitions 0/193 dead transitions. [2022-11-25 16:59:52,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 193 transitions, 1222 flow [2022-11-25 16:59:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:59:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:59:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1495 transitions. [2022-11-25 16:59:52,451 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5212691771269177 [2022-11-25 16:59:52,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1495 transitions. [2022-11-25 16:59:52,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1495 transitions. [2022-11-25 16:59:52,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:52,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1495 transitions. [2022-11-25 16:59:52,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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-25 16:59:52,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 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-25 16:59:52,460 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 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-25 16:59:52,461 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 531 flow. Second operand 6 states and 1495 transitions. [2022-11-25 16:59:52,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 193 transitions, 1222 flow [2022-11-25 16:59:52,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 193 transitions, 1196 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:52,493 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 682 flow [2022-11-25 16:59:52,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2022-11-25 16:59:52,494 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2022-11-25 16:59:52,494 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 682 flow [2022-11-25 16:59:52,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 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-25 16:59:52,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:52,495 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:52,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:59:52,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 952572074, now seen corresponding path program 1 times [2022-11-25 16:59:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:52,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038095766] [2022-11-25 16:59:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:52,545 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-25 16:59:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038095766] [2022-11-25 16:59:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038095766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:52,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:52,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:59:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117542898] [2022-11-25 16:59:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:52,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:59:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:59:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:59:52,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 478 [2022-11-25 16:59:52,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 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-25 16:59:52,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:52,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 478 [2022-11-25 16:59:52,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:52,841 INFO L130 PetriNetUnfolder]: 908/1752 cut-off events. [2022-11-25 16:59:52,841 INFO L131 PetriNetUnfolder]: For 1837/1837 co-relation queries the response was YES. [2022-11-25 16:59:52,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 1752 events. 908/1752 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9790 event pairs, 606 based on Foata normal form. 82/1597 useless extension candidates. Maximal degree in co-relation 3839. Up to 902 conditions per place. [2022-11-25 16:59:52,852 INFO L137 encePairwiseOnDemand]: 474/478 looper letters, 82 selfloop transitions, 2 changer transitions 8/96 dead transitions. [2022-11-25 16:59:52,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 737 flow [2022-11-25 16:59:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:59:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:59:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2022-11-25 16:59:52,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5362622036262203 [2022-11-25 16:59:52,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 769 transitions. [2022-11-25 16:59:52,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 769 transitions. [2022-11-25 16:59:52,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:52,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 769 transitions. [2022-11-25 16:59:52,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 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-25 16:59:52,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 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-25 16:59:52,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 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-25 16:59:52,879 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 682 flow. Second operand 3 states and 769 transitions. [2022-11-25 16:59:52,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 737 flow [2022-11-25 16:59:52,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 695 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-11-25 16:59:52,890 INFO L231 Difference]: Finished difference. Result has 95 places, 83 transitions, 477 flow [2022-11-25 16:59:52,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=95, PETRI_TRANSITIONS=83} [2022-11-25 16:59:52,892 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2022-11-25 16:59:52,892 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 83 transitions, 477 flow [2022-11-25 16:59:52,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 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-25 16:59:52,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:52,893 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:52,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:59:52,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2060660023, now seen corresponding path program 1 times [2022-11-25 16:59:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251043433] [2022-11-25 16:59:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:52,974 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-25 16:59:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251043433] [2022-11-25 16:59:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251043433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:52,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:52,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:59:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151907922] [2022-11-25 16:59:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:52,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:59:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:59:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:59:53,003 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 16:59:53,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 83 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 235.25) internal successors, (941), 4 states have internal predecessors, (941), 0 states have call successors, (0), 0 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-25 16:59:53,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:53,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 16:59:53,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:53,327 INFO L130 PetriNetUnfolder]: 708/1350 cut-off events. [2022-11-25 16:59:53,328 INFO L131 PetriNetUnfolder]: For 1198/1198 co-relation queries the response was YES. [2022-11-25 16:59:53,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 1350 events. 708/1350 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6639 event pairs, 494 based on Foata normal form. 10/1172 useless extension candidates. Maximal degree in co-relation 3111. Up to 997 conditions per place. [2022-11-25 16:59:53,338 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 92 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2022-11-25 16:59:53,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 99 transitions, 718 flow [2022-11-25 16:59:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:59:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:59:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2022-11-25 16:59:53,342 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5251046025104602 [2022-11-25 16:59:53,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1004 transitions. [2022-11-25 16:59:53,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1004 transitions. [2022-11-25 16:59:53,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:53,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1004 transitions. [2022-11-25 16:59:53,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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-25 16:59:53,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 16:59:53,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 16:59:53,350 INFO L175 Difference]: Start difference. First operand has 95 places, 83 transitions, 477 flow. Second operand 4 states and 1004 transitions. [2022-11-25 16:59:53,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 99 transitions, 718 flow [2022-11-25 16:59:53,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 710 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 16:59:53,359 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 485 flow [2022-11-25 16:59:53,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2022-11-25 16:59:53,360 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2022-11-25 16:59:53,361 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 485 flow [2022-11-25 16:59:53,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.25) internal successors, (941), 4 states have internal predecessors, (941), 0 states have call successors, (0), 0 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-25 16:59:53,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:53,361 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:53,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:59:53,362 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 16:59:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186174, now seen corresponding path program 1 times [2022-11-25 16:59:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:53,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351359204] [2022-11-25 16:59:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:54,346 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-25 16:59:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:54,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351359204] [2022-11-25 16:59:54,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351359204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:59:54,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624199623] [2022-11-25 16:59:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:54,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:59:54,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:59:54,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:59:54,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:59:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:54,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 16:59:54,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:59:54,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:59:54,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:59:54,639 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:59:54,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 16:59:54,653 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:59:54,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 16:59:54,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 16:59:54,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 16:59:55,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 16:59:55,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:59:55,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 16:59:55,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 16:59:55,686 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-25 16:59:55,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:59:55,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) (+ 1608 |c_~#queue~0.offset|))))))) is different from false [2022-11-25 16:59:55,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_405)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_405 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) (+ 1608 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2022-11-25 16:59:56,072 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_402) .cse1 v_ArrVal_405)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_405) (< (+ v_ArrVal_402 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) (+ 1608 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 16:59:56,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_400)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_402) .cse2 v_ArrVal_405)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_405) (< (+ v_ArrVal_402 2147483648) 0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 16:59:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:59:57,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624199623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:59:57,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:59:57,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-11-25 16:59:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083536206] [2022-11-25 16:59:57,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:59:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 16:59:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 16:59:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=518, Unknown=6, NotChecked=204, Total=870 [2022-11-25 16:59:57,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 478 [2022-11-25 16:59:57,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 485 flow. Second operand has 30 states, 30 states have (on average 181.6) internal successors, (5448), 30 states have internal predecessors, (5448), 0 states have call successors, (0), 0 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-25 16:59:57,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:57,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 478 [2022-11-25 16:59:57,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:00:01,382 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse8 (select .cse9 .cse5)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (exists ((v_ArrVal_400 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| Int) (v_ArrVal_407 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_400))) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| v_ArrVal_405) (= .cse0 (store (store (store .cse1 .cse2 v_ArrVal_402) .cse3 v_ArrVal_405) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_76| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_407)) (<= v_ArrVal_405 (+ (select .cse1 .cse3) 1)) (<= 0 (+ v_ArrVal_402 2147483648)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 0))))) (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse3 v_ArrVal_405)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse3) 1) v_ArrVal_405) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse4 .cse5))) (< 0 (+ (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) .cse6) 2147483650))))) (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse3 v_ArrVal_405)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_405 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse7 .cse5))) (< 0 (+ (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) .cse6) 2147483650))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| .cse8)) (< 0 (+ 2147483650 (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) .cse6))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_400 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_78| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse11 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_78| 4)) v_ArrVal_400))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_402) .cse5 v_ArrVal_405)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse10 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_78| .cse8)) (< (+ v_ArrVal_402 2147483648) 0) (< (+ (select .cse11 .cse5) 1) v_ArrVal_405) (< 0 (+ 2147483650 (select (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_407) .cse6)))))))))) is different from false [2022-11-25 17:00:02,022 INFO L130 PetriNetUnfolder]: 860/1650 cut-off events. [2022-11-25 17:00:02,023 INFO L131 PetriNetUnfolder]: For 1938/1938 co-relation queries the response was YES. [2022-11-25 17:00:02,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 1650 events. 860/1650 cut-off events. For 1938/1938 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8571 event pairs, 483 based on Foata normal form. 2/1440 useless extension candidates. Maximal degree in co-relation 4197. Up to 1222 conditions per place. [2022-11-25 17:00:02,036 INFO L137 encePairwiseOnDemand]: 463/478 looper letters, 91 selfloop transitions, 48 changer transitions 0/144 dead transitions. [2022-11-25 17:00:02,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 144 transitions, 1134 flow [2022-11-25 17:00:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:00:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-25 17:00:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3719 transitions. [2022-11-25 17:00:02,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3890167364016736 [2022-11-25 17:00:02,047 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3719 transitions. [2022-11-25 17:00:02,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3719 transitions. [2022-11-25 17:00:02,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:00:02,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3719 transitions. [2022-11-25 17:00:02,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 185.95) internal successors, (3719), 20 states have internal predecessors, (3719), 0 states have call successors, (0), 0 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-25 17:00:02,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 0 states have call successors, (0), 0 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-25 17:00:02,072 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 0 states have call successors, (0), 0 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-25 17:00:02,072 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 485 flow. Second operand 20 states and 3719 transitions. [2022-11-25 17:00:02,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 144 transitions, 1134 flow [2022-11-25 17:00:02,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 144 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:00:02,083 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 886 flow [2022-11-25 17:00:02,084 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=886, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2022-11-25 17:00:02,084 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 63 predicate places. [2022-11-25 17:00:02,084 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 886 flow [2022-11-25 17:00:02,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 181.6) internal successors, (5448), 30 states have internal predecessors, (5448), 0 states have call successors, (0), 0 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-25 17:00:02,086 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:00:02,087 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:02,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:00:02,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:02,293 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:00:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186173, now seen corresponding path program 1 times [2022-11-25 17:00:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:02,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103651170] [2022-11-25 17:00:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:03,369 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-25 17:00:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103651170] [2022-11-25 17:00:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103651170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316113651] [2022-11-25 17:00:03,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:03,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:03,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:03,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:00:03,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:00:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:03,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 17:00:03,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:00:03,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:03,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:03,565 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:03,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:00:03,579 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:00:03,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 17:00:03,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:00:03,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 17:00:04,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:00:04,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:04,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:00:04,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:00:04,809 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-25 17:00:04,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:00:04,940 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_502) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 17:00:04,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_500)) |c_~#stored_elements~0.base| v_ArrVal_502) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_500 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 17:00:05,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_498 Int) (v_ArrVal_503 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_498) .cse2 v_ArrVal_500)) |c_~#stored_elements~0.base| v_ArrVal_502) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_500) (not (<= v_ArrVal_498 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_82| 4) |c_~#queue~0.offset|) v_ArrVal_503) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 17:00:11,689 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-25 17:00:11,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316113651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:00:11,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:00:11,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-25 17:00:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762172498] [2022-11-25 17:00:11,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:00:11,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 17:00:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 17:00:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=589, Unknown=21, NotChecked=168, Total=992 [2022-11-25 17:00:12,035 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 478 [2022-11-25 17:00:12,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 886 flow. Second operand has 32 states, 32 states have (on average 181.5) internal successors, (5808), 32 states have internal predecessors, (5808), 0 states have call successors, (0), 0 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-25 17:00:12,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:00:12,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 478 [2022-11-25 17:00:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:00:15,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:00:16,576 INFO L130 PetriNetUnfolder]: 860/1655 cut-off events. [2022-11-25 17:00:16,576 INFO L131 PetriNetUnfolder]: For 2552/2552 co-relation queries the response was YES. [2022-11-25 17:00:16,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 1655 events. 860/1655 cut-off events. For 2552/2552 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8402 event pairs, 683 based on Foata normal form. 2/1456 useless extension candidates. Maximal degree in co-relation 4631. Up to 1551 conditions per place. [2022-11-25 17:00:16,586 INFO L137 encePairwiseOnDemand]: 465/478 looper letters, 91 selfloop transitions, 39 changer transitions 0/135 dead transitions. [2022-11-25 17:00:16,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 1224 flow [2022-11-25 17:00:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 17:00:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 17:00:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3525 transitions. [2022-11-25 17:00:16,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3881303677604052 [2022-11-25 17:00:16,597 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3525 transitions. [2022-11-25 17:00:16,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3525 transitions. [2022-11-25 17:00:16,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:00:16,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3525 transitions. [2022-11-25 17:00:16,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 185.52631578947367) internal successors, (3525), 19 states have internal predecessors, (3525), 0 states have call successors, (0), 0 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-25 17:00:16,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 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-25 17:00:16,621 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 478.0) internal successors, (9560), 20 states have internal predecessors, (9560), 0 states have call successors, (0), 0 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-25 17:00:16,622 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 886 flow. Second operand 19 states and 3525 transitions. [2022-11-25 17:00:16,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 1224 flow [2022-11-25 17:00:16,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 1091 flow, removed 53 selfloop flow, removed 6 redundant places. [2022-11-25 17:00:16,639 INFO L231 Difference]: Finished difference. Result has 136 places, 119 transitions, 879 flow [2022-11-25 17:00:16,639 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=879, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2022-11-25 17:00:16,640 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 77 predicate places. [2022-11-25 17:00:16,640 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 879 flow [2022-11-25 17:00:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 181.5) internal successors, (5808), 32 states have internal predecessors, (5808), 0 states have call successors, (0), 0 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-25 17:00:16,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:00:16,642 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:16,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 17:00:16,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:16,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:00:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 556427979, now seen corresponding path program 1 times [2022-11-25 17:00:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:16,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285401686] [2022-11-25 17:00:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:18,044 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-25 17:00:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285401686] [2022-11-25 17:00:18,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285401686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488619671] [2022-11-25 17:00:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:18,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:18,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:18,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:00:18,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:00:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:18,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 17:00:18,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:00:18,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:18,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:18,245 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:18,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:00:18,268 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:00:18,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:00:18,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 17:00:18,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:00:18,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 17:00:18,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:00:18,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:18,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:00:19,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:00:19,275 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-25 17:00:19,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:00:19,400 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_606 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_605) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_606) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 17:00:19,425 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_606 Int) (v_ArrVal_603 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_603)) |c_~#stored_elements~0.base| v_ArrVal_605) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_606) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_603 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 17:00:21,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_606 Int) (v_ArrVal_603 Int) (v_ArrVal_601 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_601) .cse1 v_ArrVal_603)) |c_~#stored_elements~0.base| v_ArrVal_605) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_603) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_606) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_601 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-25 17:00:32,481 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-25 17:00:32,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488619671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:00:32,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:00:32,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 17:00:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254258958] [2022-11-25 17:00:32,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:00:32,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 17:00:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 17:00:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=740, Unknown=24, NotChecked=186, Total=1190 [2022-11-25 17:00:32,897 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 17:00:32,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 879 flow. Second operand has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:00:32,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:00:32,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 17:00:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:00:36,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:38,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:40,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:42,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:44,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:46,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:48,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:50,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:52,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:54,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:56,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:00:58,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:00,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:03,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:05,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:07,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:09,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:11,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:13,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:16,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:18,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:20,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:22,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:24,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:26,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:29,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:01:30,188 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_605 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_606 Int) (v_ArrVal_603 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_603)) |c_~#stored_elements~0.base| v_ArrVal_605) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_603) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_606) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse2 .cse4)))))) (forall ((v_ArrVal_605 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| Int) (v_ArrVal_606 Int) (v_ArrVal_603 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_603)) |c_~#stored_elements~0.base| v_ArrVal_605) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| 4) |c_~#queue~0.offset|) v_ArrVal_606) .cse3) 2147483647) (not (<= v_ArrVal_603 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_87| (select .cse5 .cse4)))))))) is different from false [2022-11-25 17:01:32,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:33,878 INFO L130 PetriNetUnfolder]: 1435/2761 cut-off events. [2022-11-25 17:01:33,878 INFO L131 PetriNetUnfolder]: For 3804/3804 co-relation queries the response was YES. [2022-11-25 17:01:33,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8159 conditions, 2761 events. 1435/2761 cut-off events. For 3804/3804 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 16002 event pairs, 376 based on Foata normal form. 18/2466 useless extension candidates. Maximal degree in co-relation 7437. Up to 1252 conditions per place. [2022-11-25 17:01:33,900 INFO L137 encePairwiseOnDemand]: 458/478 looper letters, 190 selfloop transitions, 83 changer transitions 0/278 dead transitions. [2022-11-25 17:01:33,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 278 transitions, 1975 flow [2022-11-25 17:01:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 17:01:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-25 17:01:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3926 transitions. [2022-11-25 17:01:33,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3911137676828053 [2022-11-25 17:01:33,913 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3926 transitions. [2022-11-25 17:01:33,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3926 transitions. [2022-11-25 17:01:33,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:33,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3926 transitions. [2022-11-25 17:01:33,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 186.95238095238096) internal successors, (3926), 21 states have internal predecessors, (3926), 0 states have call successors, (0), 0 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-25 17:01:33,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 478.0) internal successors, (10516), 22 states have internal predecessors, (10516), 0 states have call successors, (0), 0 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-25 17:01:33,936 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 478.0) internal successors, (10516), 22 states have internal predecessors, (10516), 0 states have call successors, (0), 0 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-25 17:01:33,937 INFO L175 Difference]: Start difference. First operand has 136 places, 119 transitions, 879 flow. Second operand 21 states and 3926 transitions. [2022-11-25 17:01:33,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 278 transitions, 1975 flow [2022-11-25 17:01:33,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 278 transitions, 1897 flow, removed 15 selfloop flow, removed 15 redundant places. [2022-11-25 17:01:33,962 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 1359 flow [2022-11-25 17:01:33,962 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1359, PETRI_PLACES=152, PETRI_TRANSITIONS=161} [2022-11-25 17:01:33,963 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 93 predicate places. [2022-11-25 17:01:33,963 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 1359 flow [2022-11-25 17:01:33,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:01:33,964 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:33,964 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:33,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:34,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:01:34,171 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:01:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1984926494, now seen corresponding path program 1 times [2022-11-25 17:01:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9429756] [2022-11-25 17:01:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:34,694 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-25 17:01:34,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:34,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9429756] [2022-11-25 17:01:34,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9429756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:01:34,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414552145] [2022-11-25 17:01:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:34,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:01:34,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:01:34,697 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:01:34,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:01:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:34,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 17:01:34,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:34,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:34,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:34,913 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:01:34,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:01:34,945 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:01:34,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:01:35,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 17:01:35,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:01:35,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 17:01:35,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:01:35,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:35,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:01:35,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:01:36,662 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-25 17:01:36,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:36,882 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 Int) (v_ArrVal_706 Int) (v_ArrVal_708 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_706)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_709) (+ 1608 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_706 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-11-25 17:01:36,902 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 Int) (v_ArrVal_706 Int) (v_ArrVal_708 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_706)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_709) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2022-11-25 17:01:37,087 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 Int) (v_ArrVal_706 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_702 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_702)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_705) .cse1 v_ArrVal_706)) |c_~#stored_elements~0.base| v_ArrVal_708) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_706) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)) v_ArrVal_709) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_705 2147483648) 0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 17:01:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 17:01:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414552145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:37,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:01:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2022-11-25 17:01:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492841426] [2022-11-25 17:01:37,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:37,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 17:01:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:37,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 17:01:37,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=487, Unknown=11, NotChecked=150, Total=812 [2022-11-25 17:01:37,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 478 [2022-11-25 17:01:37,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 1359 flow. Second operand has 29 states, 29 states have (on average 182.75862068965517) internal successors, (5300), 29 states have internal predecessors, (5300), 0 states have call successors, (0), 0 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-25 17:01:37,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:37,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 478 [2022-11-25 17:01:37,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:52,441 INFO L130 PetriNetUnfolder]: 3129/6027 cut-off events. [2022-11-25 17:01:52,441 INFO L131 PetriNetUnfolder]: For 24942/24970 co-relation queries the response was YES. [2022-11-25 17:01:52,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26108 conditions, 6027 events. 3129/6027 cut-off events. For 24942/24970 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 41623 event pairs, 999 based on Foata normal form. 109/5430 useless extension candidates. Maximal degree in co-relation 24981. Up to 2045 conditions per place. [2022-11-25 17:01:52,509 INFO L137 encePairwiseOnDemand]: 458/478 looper letters, 328 selfloop transitions, 144 changer transitions 0/477 dead transitions. [2022-11-25 17:01:52,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 477 transitions, 4716 flow [2022-11-25 17:01:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:01:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-11-25 17:01:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5240 transitions. [2022-11-25 17:01:52,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40601270726793737 [2022-11-25 17:01:52,520 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5240 transitions. [2022-11-25 17:01:52,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5240 transitions. [2022-11-25 17:01:52,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:52,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5240 transitions. [2022-11-25 17:01:52,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 194.07407407407408) internal successors, (5240), 27 states have internal predecessors, (5240), 0 states have call successors, (0), 0 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-25 17:01:52,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 478.0) internal successors, (13384), 28 states have internal predecessors, (13384), 0 states have call successors, (0), 0 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-25 17:01:52,549 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 478.0) internal successors, (13384), 28 states have internal predecessors, (13384), 0 states have call successors, (0), 0 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-25 17:01:52,550 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 1359 flow. Second operand 27 states and 5240 transitions. [2022-11-25 17:01:52,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 477 transitions, 4716 flow [2022-11-25 17:01:52,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 477 transitions, 4557 flow, removed 60 selfloop flow, removed 6 redundant places. [2022-11-25 17:01:52,640 INFO L231 Difference]: Finished difference. Result has 186 places, 255 transitions, 2772 flow [2022-11-25 17:01:52,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2772, PETRI_PLACES=186, PETRI_TRANSITIONS=255} [2022-11-25 17:01:52,641 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 127 predicate places. [2022-11-25 17:01:52,641 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 255 transitions, 2772 flow [2022-11-25 17:01:52,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 182.75862068965517) internal successors, (5300), 29 states have internal predecessors, (5300), 0 states have call successors, (0), 0 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-25 17:01:52,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:52,643 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:52,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:52,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 17:01:52,850 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:01:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash -914144940, now seen corresponding path program 2 times [2022-11-25 17:01:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:52,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588308870] [2022-11-25 17:01:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:53,375 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-25 17:01:53,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:53,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588308870] [2022-11-25 17:01:53,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588308870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:01:53,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616416607] [2022-11-25 17:01:53,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:01:53,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:01:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:01:53,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:01:53,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:01:53,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:01:53,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:01:53,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:01:53,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:53,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:01:53,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:01:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:53,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:01:53,956 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 17:01:53,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 17:01:54,027 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-25 17:01:54,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:54,146 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_795 Int) (v_ArrVal_793 (Array Int Int))) (or (< (+ v_ArrVal_795 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_793) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_795) (+ 1608 |c_~#queue~0.offset|)))))) is different from false [2022-11-25 17:01:54,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:01:54,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-25 17:01:54,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:01:54,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-25 17:01:54,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 17:01:54,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 17:01:54,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:01:54,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-11-25 17:01:54,422 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-25 17:01:54,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616416607] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:54,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:01:54,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-25 17:01:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220127512] [2022-11-25 17:01:54,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:54,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:01:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:01:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=359, Unknown=2, NotChecked=40, Total=506 [2022-11-25 17:01:54,682 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 478 [2022-11-25 17:01:54,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 255 transitions, 2772 flow. Second operand has 23 states, 23 states have (on average 193.2173913043478) internal successors, (4444), 23 states have internal predecessors, (4444), 0 states have call successors, (0), 0 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-25 17:01:54,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:54,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 478 [2022-11-25 17:01:54,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:56,759 INFO L130 PetriNetUnfolder]: 3613/6989 cut-off events. [2022-11-25 17:01:56,759 INFO L131 PetriNetUnfolder]: For 99708/99778 co-relation queries the response was YES. [2022-11-25 17:01:56,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43578 conditions, 6989 events. 3613/6989 cut-off events. For 99708/99778 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 50297 event pairs, 1312 based on Foata normal form. 9/6172 useless extension candidates. Maximal degree in co-relation 42605. Up to 2418 conditions per place. [2022-11-25 17:01:56,826 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 272 selfloop transitions, 51 changer transitions 0/328 dead transitions. [2022-11-25 17:01:56,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 328 transitions, 4069 flow [2022-11-25 17:01:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:01:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:01:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1469 transitions. [2022-11-25 17:01:56,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43903167961745365 [2022-11-25 17:01:56,830 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1469 transitions. [2022-11-25 17:01:56,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1469 transitions. [2022-11-25 17:01:56,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:56,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1469 transitions. [2022-11-25 17:01:56,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 209.85714285714286) internal successors, (1469), 7 states have internal predecessors, (1469), 0 states have call successors, (0), 0 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-25 17:01:56,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 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-25 17:01:56,837 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 478.0) internal successors, (3824), 8 states have internal predecessors, (3824), 0 states have call successors, (0), 0 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-25 17:01:56,837 INFO L175 Difference]: Start difference. First operand has 186 places, 255 transitions, 2772 flow. Second operand 7 states and 1469 transitions. [2022-11-25 17:01:56,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 328 transitions, 4069 flow [2022-11-25 17:01:56,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 328 transitions, 3640 flow, removed 178 selfloop flow, removed 5 redundant places. [2022-11-25 17:01:56,994 INFO L231 Difference]: Finished difference. Result has 188 places, 258 transitions, 2485 flow [2022-11-25 17:01:56,994 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2485, PETRI_PLACES=188, PETRI_TRANSITIONS=258} [2022-11-25 17:01:56,995 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 129 predicate places. [2022-11-25 17:01:56,996 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 258 transitions, 2485 flow [2022-11-25 17:01:56,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 193.2173913043478) internal successors, (4444), 23 states have internal predecessors, (4444), 0 states have call successors, (0), 0 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-25 17:01:56,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:56,997 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:57,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:57,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:01:57,203 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:01:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -397295569, now seen corresponding path program 2 times [2022-11-25 17:01:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:57,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684886916] [2022-11-25 17:01:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:57,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:58,564 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-25 17:01:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:58,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684886916] [2022-11-25 17:01:58,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684886916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:01:58,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130395403] [2022-11-25 17:01:58,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:01:58,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:01:58,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:01:58,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:01:58,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:01:58,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:01:58,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:01:58,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 17:01:58,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:58,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:58,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:58,839 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:01:58,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:01:58,868 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:01:58,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:01:59,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:01:59,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 17:01:59,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-25 17:01:59,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:01:59,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:59,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:01:59,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:02:00,186 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-25 17:02:00,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:00,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_894 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 17:02:00,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_894))))) is different from false [2022-11-25 17:02:00,461 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_892))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_894) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-25 17:02:00,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_891 Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_891)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_892))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_894) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_891 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-25 17:02:00,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_891 Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_891)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_892))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_894) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_891) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-11-25 17:02:00,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (v_ArrVal_891 Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_888 Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_888)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_891)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_892))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_891) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_894) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-25 17:02:00,621 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_894 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| Int) (v_ArrVal_891 Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_888 Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_888)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_891)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_892))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_894)) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| 4)) v_ArrVal_896) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_102| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_894) (< (+ (select .cse5 .cse1) 1) v_ArrVal_891) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_101| (select .cse0 .cse3)))))))))) is different from false [2022-11-25 17:02:00,722 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-25 17:02:00,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130395403] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:02:00,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:02:00,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 17:02:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580152618] [2022-11-25 17:02:00,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:02:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 17:02:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 17:02:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=556, Unknown=9, NotChecked=406, Total=1190 [2022-11-25 17:02:00,927 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 17:02:00,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 258 transitions, 2485 flow. Second operand has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:02:00,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:00,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 17:02:00,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:04,827 INFO L130 PetriNetUnfolder]: 3870/7490 cut-off events. [2022-11-25 17:02:04,827 INFO L131 PetriNetUnfolder]: For 106254/106324 co-relation queries the response was YES. [2022-11-25 17:02:04,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45765 conditions, 7490 events. 3870/7490 cut-off events. For 106254/106324 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 54330 event pairs, 1309 based on Foata normal form. 9/6619 useless extension candidates. Maximal degree in co-relation 44824. Up to 5139 conditions per place. [2022-11-25 17:02:04,902 INFO L137 encePairwiseOnDemand]: 461/478 looper letters, 285 selfloop transitions, 60 changer transitions 0/350 dead transitions. [2022-11-25 17:02:04,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 350 transitions, 4654 flow [2022-11-25 17:02:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:02:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-25 17:02:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2617 transitions. [2022-11-25 17:02:04,907 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3910639569635386 [2022-11-25 17:02:04,907 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2617 transitions. [2022-11-25 17:02:04,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2617 transitions. [2022-11-25 17:02:04,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:04,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2617 transitions. [2022-11-25 17:02:04,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 186.92857142857142) internal successors, (2617), 14 states have internal predecessors, (2617), 0 states have call successors, (0), 0 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-25 17:02:04,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 478.0) internal successors, (7170), 15 states have internal predecessors, (7170), 0 states have call successors, (0), 0 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-25 17:02:04,922 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 478.0) internal successors, (7170), 15 states have internal predecessors, (7170), 0 states have call successors, (0), 0 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-25 17:02:04,922 INFO L175 Difference]: Start difference. First operand has 188 places, 258 transitions, 2485 flow. Second operand 14 states and 2617 transitions. [2022-11-25 17:02:04,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 350 transitions, 4654 flow [2022-11-25 17:02:05,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 350 transitions, 4642 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-11-25 17:02:05,079 INFO L231 Difference]: Finished difference. Result has 203 places, 270 transitions, 2862 flow [2022-11-25 17:02:05,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2473, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2862, PETRI_PLACES=203, PETRI_TRANSITIONS=270} [2022-11-25 17:02:05,080 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 144 predicate places. [2022-11-25 17:02:05,080 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 270 transitions, 2862 flow [2022-11-25 17:02:05,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:02:05,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:05,081 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:05,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:05,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:05,282 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:02:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -397295570, now seen corresponding path program 3 times [2022-11-25 17:02:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003437366] [2022-11-25 17:02:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:06,013 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-25 17:02:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:06,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003437366] [2022-11-25 17:02:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003437366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:02:06,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386183640] [2022-11-25 17:02:06,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:02:06,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:06,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:06,019 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:02:06,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:02:06,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 17:02:06,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:02:06,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 17:02:06,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:06,272 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:02:06,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:02:06,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:02:06,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:06,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:02:06,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:02:06,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:06,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:02:06,734 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 17:02:06,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 17:02:06,823 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-25 17:02:06,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:06,977 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (or (< (+ v_ArrVal_985 2147483648) 0) (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_985) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-11-25 17:02:07,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:02:07,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-11-25 17:02:07,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:02:07,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2657 treesize of output 2623 [2022-11-25 17:02:07,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3470 treesize of output 3358 [2022-11-25 17:02:07,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3934 treesize of output 3742 [2022-11-25 17:02:07,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:02:07,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2037 treesize of output 1977 [2022-11-25 17:02:26,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:02:26,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3332 treesize of output 3280 [2022-11-25 17:02:36,961 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-25 17:02:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386183640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:02:36,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:02:36,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-25 17:02:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027448784] [2022-11-25 17:02:36,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:02:36,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 17:02:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 17:02:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=486, Unknown=6, NotChecked=46, Total=650 [2022-11-25 17:02:37,074 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 478 [2022-11-25 17:02:37,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 270 transitions, 2862 flow. Second operand has 26 states, 26 states have (on average 188.96153846153845) internal successors, (4913), 26 states have internal predecessors, (4913), 0 states have call successors, (0), 0 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-25 17:02:37,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:02:37,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 478 [2022-11-25 17:02:37,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:39,047 INFO L130 PetriNetUnfolder]: 3909/7610 cut-off events. [2022-11-25 17:02:39,047 INFO L131 PetriNetUnfolder]: For 128078/128078 co-relation queries the response was YES. [2022-11-25 17:02:39,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48797 conditions, 7610 events. 3909/7610 cut-off events. For 128078/128078 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 55746 event pairs, 2161 based on Foata normal form. 27/6748 useless extension candidates. Maximal degree in co-relation 47774. Up to 6352 conditions per place. [2022-11-25 17:02:39,143 INFO L137 encePairwiseOnDemand]: 474/478 looper letters, 270 selfloop transitions, 14 changer transitions 0/289 dead transitions. [2022-11-25 17:02:39,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 289 transitions, 3588 flow [2022-11-25 17:02:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:02:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:02:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1008 transitions. [2022-11-25 17:02:39,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4217573221757322 [2022-11-25 17:02:39,146 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1008 transitions. [2022-11-25 17:02:39,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1008 transitions. [2022-11-25 17:02:39,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:02:39,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1008 transitions. [2022-11-25 17:02:39,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.6) internal successors, (1008), 5 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-25 17:02:39,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 17:02:39,152 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 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-25 17:02:39,152 INFO L175 Difference]: Start difference. First operand has 203 places, 270 transitions, 2862 flow. Second operand 5 states and 1008 transitions. [2022-11-25 17:02:39,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 289 transitions, 3588 flow [2022-11-25 17:02:39,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 289 transitions, 3333 flow, removed 65 selfloop flow, removed 9 redundant places. [2022-11-25 17:02:39,303 INFO L231 Difference]: Finished difference. Result has 197 places, 269 transitions, 2627 flow [2022-11-25 17:02:39,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2576, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2627, PETRI_PLACES=197, PETRI_TRANSITIONS=269} [2022-11-25 17:02:39,304 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 138 predicate places. [2022-11-25 17:02:39,305 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 269 transitions, 2627 flow [2022-11-25 17:02:39,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 188.96153846153845) internal successors, (4913), 26 states have internal predecessors, (4913), 0 states have call successors, (0), 0 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-25 17:02:39,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:02:39,305 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:39,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:39,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:39,511 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:02:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1169602433, now seen corresponding path program 3 times [2022-11-25 17:02:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:39,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709362914] [2022-11-25 17:02:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:41,240 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-25 17:02:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:41,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709362914] [2022-11-25 17:02:41,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709362914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:02:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88857101] [2022-11-25 17:02:41,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:02:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:41,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:02:41,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:02:41,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 17:02:41,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:02:41,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 17:02:41,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,517 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:02:41,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:02:41,543 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:02:41,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:02:41,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:02:41,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 17:02:42,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:02:42,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:02:42,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:42,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:02:42,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:02:42,682 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-25 17:02:42,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:42,944 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1087 Int) (v_ArrVal_1086 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085) |c_~#stored_elements~0.base| v_ArrVal_1086) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1087) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 17:02:52,235 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (v_ArrVal_1087 Int) (v_ArrVal_1079 Int) (v_ArrVal_1086 (Array Int Int)) (v_ArrVal_1085 (Array Int Int)) (v_ArrVal_1081 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1079)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1081) .cse1 v_ArrVal_1083)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1085) |c_~#stored_elements~0.base| v_ArrVal_1086) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1083) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1081) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_1087) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| (select .cse3 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 17:03:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 17:03:04,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88857101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:03:04,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:03:04,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 17:03:04,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974557903] [2022-11-25 17:03:04,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:03:04,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 17:03:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:04,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 17:03:04,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=775, Unknown=29, NotChecked=126, Total=1190 [2022-11-25 17:03:05,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 17:03:05,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 269 transitions, 2627 flow. Second operand has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:03:05,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:05,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 17:03:05,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:16,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:03:18,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:03:20,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:03:22,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:03:24,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:03:30,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:03:37,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:03:39,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:03:42,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:03:46,254 INFO L130 PetriNetUnfolder]: 4781/9280 cut-off events. [2022-11-25 17:03:46,254 INFO L131 PetriNetUnfolder]: For 153160/153160 co-relation queries the response was YES. [2022-11-25 17:03:46,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58965 conditions, 9280 events. 4781/9280 cut-off events. For 153160/153160 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 70249 event pairs, 1605 based on Foata normal form. 18/8230 useless extension candidates. Maximal degree in co-relation 57943. Up to 5039 conditions per place. [2022-11-25 17:03:46,356 INFO L137 encePairwiseOnDemand]: 457/478 looper letters, 355 selfloop transitions, 118 changer transitions 0/478 dead transitions. [2022-11-25 17:03:46,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 478 transitions, 6973 flow [2022-11-25 17:03:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 17:03:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-25 17:03:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4848 transitions. [2022-11-25 17:03:46,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3900869005471516 [2022-11-25 17:03:46,366 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4848 transitions. [2022-11-25 17:03:46,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4848 transitions. [2022-11-25 17:03:46,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:46,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4848 transitions. [2022-11-25 17:03:46,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 186.46153846153845) internal successors, (4848), 26 states have internal predecessors, (4848), 0 states have call successors, (0), 0 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-25 17:03:46,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 478.0) internal successors, (12906), 27 states have internal predecessors, (12906), 0 states have call successors, (0), 0 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-25 17:03:46,394 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 478.0) internal successors, (12906), 27 states have internal predecessors, (12906), 0 states have call successors, (0), 0 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-25 17:03:46,394 INFO L175 Difference]: Start difference. First operand has 197 places, 269 transitions, 2627 flow. Second operand 26 states and 4848 transitions. [2022-11-25 17:03:46,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 478 transitions, 6973 flow [2022-11-25 17:03:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 478 transitions, 6967 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:03:46,549 INFO L231 Difference]: Finished difference. Result has 229 places, 306 transitions, 3551 flow [2022-11-25 17:03:46,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3551, PETRI_PLACES=229, PETRI_TRANSITIONS=306} [2022-11-25 17:03:46,550 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 170 predicate places. [2022-11-25 17:03:46,550 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 306 transitions, 3551 flow [2022-11-25 17:03:46,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:03:46,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:46,551 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:46,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 17:03:46,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 17:03:46,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:03:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1172030663, now seen corresponding path program 4 times [2022-11-25 17:03:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:46,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766505195] [2022-11-25 17:03:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:47,890 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-25 17:03:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766505195] [2022-11-25 17:03:47,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766505195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:47,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105944656] [2022-11-25 17:03:47,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:03:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:03:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:47,892 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:03:47,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:03:48,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:03:48,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:03:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 17:03:48,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:03:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:03:48,094 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:03:48,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:03:48,114 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:03:48,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:03:48,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:03:48,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 17:03:48,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 17:03:48,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:03:48,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 17:03:48,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 17:03:49,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-25 17:03:49,268 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-25 17:03:49,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:03:49,301 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 17:03:49,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1189)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 17:03:49,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1186 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1189)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 17:03:49,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1185) .cse3 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1189)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1186) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1185 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-25 17:03:50,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1182 Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1182)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1185) .cse2 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1185) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1186) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1189)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 17:03:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 17:03:56,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105944656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:03:56,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:03:56,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 17:03:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426312379] [2022-11-25 17:03:56,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:03:56,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 17:03:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 17:03:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=643, Unknown=22, NotChecked=300, Total=1190 [2022-11-25 17:03:57,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-25 17:03:57,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 306 transitions, 3551 flow. Second operand has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:03:57,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:57,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-25 17:03:57,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:04:08,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:04:17,476 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 164 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:19,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:04:25,948 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 158 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:28,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:04:30,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:04:38,712 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 148 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:39,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1186) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1189)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|) .cse5) 2147483647))))) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse6 .cse1))) (not (<= v_ArrVal_1186 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1189)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1191) |c_~#queue~0.base|) .cse5) 2147483647))))))) is different from false [2022-11-25 17:04:42,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:04:46,131 INFO L130 PetriNetUnfolder]: 5399/10483 cut-off events. [2022-11-25 17:04:46,132 INFO L131 PetriNetUnfolder]: For 236096/236105 co-relation queries the response was YES. [2022-11-25 17:04:46,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75507 conditions, 10483 events. 5399/10483 cut-off events. For 236096/236105 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 81136 event pairs, 2097 based on Foata normal form. 18/9288 useless extension candidates. Maximal degree in co-relation 74564. Up to 5183 conditions per place. [2022-11-25 17:04:46,283 INFO L137 encePairwiseOnDemand]: 459/478 looper letters, 320 selfloop transitions, 156 changer transitions 0/481 dead transitions. [2022-11-25 17:04:46,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 481 transitions, 7934 flow [2022-11-25 17:04:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 17:04:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-25 17:04:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4464 transitions. [2022-11-25 17:04:46,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3891213389121339 [2022-11-25 17:04:46,293 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4464 transitions. [2022-11-25 17:04:46,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4464 transitions. [2022-11-25 17:04:46,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:04:46,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4464 transitions. [2022-11-25 17:04:46,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 186.0) internal successors, (4464), 24 states have internal predecessors, (4464), 0 states have call successors, (0), 0 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-25 17:04:46,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 478.0) internal successors, (11950), 25 states have internal predecessors, (11950), 0 states have call successors, (0), 0 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-25 17:04:46,318 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 478.0) internal successors, (11950), 25 states have internal predecessors, (11950), 0 states have call successors, (0), 0 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-25 17:04:46,318 INFO L175 Difference]: Start difference. First operand has 229 places, 306 transitions, 3551 flow. Second operand 24 states and 4464 transitions. [2022-11-25 17:04:46,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 481 transitions, 7934 flow [2022-11-25 17:04:46,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 481 transitions, 7491 flow, removed 195 selfloop flow, removed 7 redundant places. [2022-11-25 17:04:46,563 INFO L231 Difference]: Finished difference. Result has 256 places, 359 transitions, 4823 flow [2022-11-25 17:04:46,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=3205, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4823, PETRI_PLACES=256, PETRI_TRANSITIONS=359} [2022-11-25 17:04:46,564 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 197 predicate places. [2022-11-25 17:04:46,565 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 359 transitions, 4823 flow [2022-11-25 17:04:46,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 177.45714285714286) internal successors, (6211), 35 states have internal predecessors, (6211), 0 states have call successors, (0), 0 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-25 17:04:46,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:04:46,566 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:04:46,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:04:46,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:04:46,773 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:04:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:04:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2115319619, now seen corresponding path program 1 times [2022-11-25 17:04:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:04:46,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178226970] [2022-11-25 17:04:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:04:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:04:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:04:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:04:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178226970] [2022-11-25 17:04:47,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178226970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:04:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375540068] [2022-11-25 17:04:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:04:47,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:04:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:04:47,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:04:47,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:04:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-25 17:04:48,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:04:48,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:04:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:04:48,100 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:04:48,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:04:48,128 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:04:48,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:04:48,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:04:48,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 17:04:48,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 17:04:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:04:48,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 17:04:48,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-25 17:04:48,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2022-11-25 17:04:49,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-25 17:04:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:04:49,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:04:49,199 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1297 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2022-11-25 17:04:49,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-25 17:04:49,356 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-25 17:04:49,370 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-25 17:04:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 17:04:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375540068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:04:52,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:04:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-25 17:04:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887478149] [2022-11-25 17:04:52,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:04:52,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 17:04:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:04:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 17:04:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=614, Unknown=16, NotChecked=228, Total=1056 [2022-11-25 17:04:52,697 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 17:04:52,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 359 transitions, 4823 flow. Second operand has 33 states, 33 states have (on average 183.8181818181818) internal successors, (6066), 33 states have internal predecessors, (6066), 0 states have call successors, (0), 0 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-25 17:04:52,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:04:52,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 17:04:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:04:55,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (exists ((v_ArrVal_1296 Int) (v_ArrVal_1288 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1290 Int)) (and (= .cse0 (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1288))) (let ((.cse4 (select .cse1 .cse3))) (store (store (store .cse1 .cse2 v_ArrVal_1290) .cse3 (+ .cse4 1)) (+ (* .cse4 4) 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1296)))) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 0))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1296 Int) (v_ArrVal_1288 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1290 Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) v_ArrVal_1288))) (let ((.cse5 (select .cse9 .cse8))) (or (= 400 .cse5) (< (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1290) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse8) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_121| (select .cse10 .cse8)))))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (let ((.cse13 (select .cse0 .cse3))) (or (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1290 Int)) (< (select (select (store (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1290) .cse3 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse8) 4) |c_~#queue~0.offset|) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse8) 2147483647)) (= 400 .cse13))))) is different from false [2022-11-25 17:04:56,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (exists ((v_ArrVal_1296 Int) (v_ArrVal_1288 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1290 Int)) (and (= .cse0 (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1288))) (let ((.cse4 (select .cse1 .cse3))) (store (store (store .cse1 .cse2 v_ArrVal_1290) .cse3 (+ .cse4 1)) (+ (* .cse4 4) 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1296))))) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 0))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (let ((.cse5 (select .cse0 .cse3))) (or (= 400 .cse5) (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (< (let ((.cse8 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse8)) |c_~#queue~0.offset|) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse8)) 2147483647)))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-11-25 17:04:57,404 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (exists ((v_ArrVal_1296 Int) (v_ArrVal_1288 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1290 Int)) (and (= .cse0 (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1288))) (let ((.cse4 (select .cse1 .cse3))) (store (store (store .cse1 .cse2 v_ArrVal_1290) .cse3 (+ .cse4 1)) (+ (* .cse4 4) 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1296))))) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 0))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (< (let ((.cse7 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse3 (+ (select .cse0 .cse3) 1))) |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse7)) |c_~#queue~0.offset|) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse7)) 2147483647)))) is different from false [2022-11-25 17:04:58,245 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1294))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1296)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1296 Int) (v_ArrVal_1297 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1296))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1297) |c_~#queue~0.base|) .cse2) 2147483647)))) is different from false [2022-11-25 17:05:03,255 INFO L130 PetriNetUnfolder]: 7240/14084 cut-off events. [2022-11-25 17:05:03,255 INFO L131 PetriNetUnfolder]: For 610403/610423 co-relation queries the response was YES. [2022-11-25 17:05:03,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125616 conditions, 14084 events. 7240/14084 cut-off events. For 610403/610423 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 114095 event pairs, 2838 based on Foata normal form. 214/12678 useless extension candidates. Maximal degree in co-relation 123956. Up to 6047 conditions per place. [2022-11-25 17:05:03,494 INFO L137 encePairwiseOnDemand]: 456/478 looper letters, 369 selfloop transitions, 264 changer transitions 0/638 dead transitions. [2022-11-25 17:05:03,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 638 transitions, 12191 flow [2022-11-25 17:05:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 17:05:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-25 17:05:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5748 transitions. [2022-11-25 17:05:03,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.400836820083682 [2022-11-25 17:05:03,505 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5748 transitions. [2022-11-25 17:05:03,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5748 transitions. [2022-11-25 17:05:03,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:05:03,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5748 transitions. [2022-11-25 17:05:03,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 191.6) internal successors, (5748), 30 states have internal predecessors, (5748), 0 states have call successors, (0), 0 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-25 17:05:03,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 478.0) internal successors, (14818), 31 states have internal predecessors, (14818), 0 states have call successors, (0), 0 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-25 17:05:03,536 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 478.0) internal successors, (14818), 31 states have internal predecessors, (14818), 0 states have call successors, (0), 0 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-25 17:05:03,536 INFO L175 Difference]: Start difference. First operand has 256 places, 359 transitions, 4823 flow. Second operand 30 states and 5748 transitions. [2022-11-25 17:05:03,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 638 transitions, 12191 flow [2022-11-25 17:05:04,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 638 transitions, 10774 flow, removed 606 selfloop flow, removed 13 redundant places. [2022-11-25 17:05:04,435 INFO L231 Difference]: Finished difference. Result has 294 places, 485 transitions, 7359 flow [2022-11-25 17:05:04,436 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=3898, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7359, PETRI_PLACES=294, PETRI_TRANSITIONS=485} [2022-11-25 17:05:04,436 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 235 predicate places. [2022-11-25 17:05:04,436 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 485 transitions, 7359 flow [2022-11-25 17:05:04,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 183.8181818181818) internal successors, (6066), 33 states have internal predecessors, (6066), 0 states have call successors, (0), 0 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-25 17:05:04,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:05:04,437 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:04,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:04,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:04,638 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:05:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash 74035857, now seen corresponding path program 2 times [2022-11-25 17:05:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:04,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446156372] [2022-11-25 17:05:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:06,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446156372] [2022-11-25 17:05:06,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446156372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880660408] [2022-11-25 17:05:06,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:05:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:06,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:06,067 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:06,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:05:06,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:05:06,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:06,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-25 17:05:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:06,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:06,348 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:05:06,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:05:06,372 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:05:06,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:05:06,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:05:06,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 17:05:06,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 17:05:06,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 17:05:06,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:06,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 17:05:07,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-25 17:05:07,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-25 17:05:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:07,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:07,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1406 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1404) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1406)) .cse1)) 2147483647)) is different from false [2022-11-25 17:05:07,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1406 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1404) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1406)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-25 17:05:07,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1406 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1400) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1404) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1406)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-25 17:05:07,674 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1406 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1399))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1400) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1404) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1406)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-25 17:05:07,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1398 Int) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1400 Int) (v_ArrVal_1406 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1398)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1399))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1400) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1404) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1406)) .cse2)) 2147483647)))))) is different from false [2022-11-25 17:05:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 17:05:07,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880660408] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:07,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:05:07,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-25 17:05:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323468162] [2022-11-25 17:05:07,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:07,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 17:05:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 17:05:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=573, Unknown=12, NotChecked=280, Total=1056 [2022-11-25 17:05:08,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 17:05:08,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 485 transitions, 7359 flow. Second operand has 33 states, 33 states have (on average 183.8181818181818) internal successors, (6066), 33 states have internal predecessors, (6066), 0 states have call successors, (0), 0 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-25 17:05:08,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:05:08,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 17:05:08,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:05:22,038 INFO L130 PetriNetUnfolder]: 8318/16136 cut-off events. [2022-11-25 17:05:22,039 INFO L131 PetriNetUnfolder]: For 1029044/1029190 co-relation queries the response was YES. [2022-11-25 17:05:22,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165547 conditions, 16136 events. 8318/16136 cut-off events. For 1029044/1029190 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 132767 event pairs, 2832 based on Foata normal form. 70/14324 useless extension candidates. Maximal degree in co-relation 165161. Up to 5310 conditions per place. [2022-11-25 17:05:22,328 INFO L137 encePairwiseOnDemand]: 457/478 looper letters, 459 selfloop transitions, 207 changer transitions 0/671 dead transitions. [2022-11-25 17:05:22,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 671 transitions, 13914 flow [2022-11-25 17:05:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 17:05:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-25 17:05:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4613 transitions. [2022-11-25 17:05:22,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4021094839609484 [2022-11-25 17:05:22,335 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4613 transitions. [2022-11-25 17:05:22,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4613 transitions. [2022-11-25 17:05:22,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:05:22,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4613 transitions. [2022-11-25 17:05:22,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 192.20833333333334) internal successors, (4613), 24 states have internal predecessors, (4613), 0 states have call successors, (0), 0 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-25 17:05:22,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 478.0) internal successors, (11950), 25 states have internal predecessors, (11950), 0 states have call successors, (0), 0 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-25 17:05:22,358 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 478.0) internal successors, (11950), 25 states have internal predecessors, (11950), 0 states have call successors, (0), 0 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-25 17:05:22,358 INFO L175 Difference]: Start difference. First operand has 294 places, 485 transitions, 7359 flow. Second operand 24 states and 4613 transitions. [2022-11-25 17:05:22,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 671 transitions, 13914 flow [2022-11-25 17:05:23,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 671 transitions, 12393 flow, removed 699 selfloop flow, removed 8 redundant places. [2022-11-25 17:05:23,537 INFO L231 Difference]: Finished difference. Result has 321 places, 525 transitions, 7668 flow [2022-11-25 17:05:23,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=6067, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7668, PETRI_PLACES=321, PETRI_TRANSITIONS=525} [2022-11-25 17:05:23,538 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 262 predicate places. [2022-11-25 17:05:23,538 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 525 transitions, 7668 flow [2022-11-25 17:05:23,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 183.8181818181818) internal successors, (6066), 33 states have internal predecessors, (6066), 0 states have call successors, (0), 0 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-25 17:05:23,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:05:23,539 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:23,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:23,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:23,740 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:05:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1948192069, now seen corresponding path program 1 times [2022-11-25 17:05:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22739086] [2022-11-25 17:05:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:24,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22739086] [2022-11-25 17:05:24,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22739086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:24,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110493328] [2022-11-25 17:05:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:24,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:24,675 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:24,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:05:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:24,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 17:05:24,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:24,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:24,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:24,952 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:05:24,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 17:05:24,978 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 17:05:24,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 17:05:25,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 17:05:25,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 17:05:25,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 17:05:25,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:25,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 17:05:25,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-25 17:05:25,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2022-11-25 17:05:26,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-25 17:05:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:26,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:26,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1512))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-25 17:05:26,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1512))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-25 17:05:26,570 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1512))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse2) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| (select .cse1 .cse2))))))) is different from false [2022-11-25 17:05:26,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1508 Int) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1508) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1512))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-25 17:05:26,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1508 Int) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1507)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1508) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1512))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| (select .cse0 .cse1))) (< 0 (+ (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse1) 2147483650)))))) is different from false [2022-11-25 17:05:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 17:05:26,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110493328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:26,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:05:26,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-11-25 17:05:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180762157] [2022-11-25 17:05:26,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:26,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 17:05:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:05:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=534, Unknown=17, NotChecked=260, Total=930 [2022-11-25 17:05:26,985 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-25 17:05:26,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 525 transitions, 7668 flow. Second operand has 31 states, 31 states have (on average 183.93548387096774) internal successors, (5702), 31 states have internal predecessors, (5702), 0 states have call successors, (0), 0 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-25 17:05:26,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:05:26,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-25 17:05:26,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:05:40,887 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse6)) (.cse1 (select .cse2 1604)) (.cse4 (select .cse2 .cse3)) (.cse5 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse6)))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= 0 (+ .cse0 2147483648)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_~#queue~0.base| 4)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#stored_elements~0.base| 4) (= |c_~#queue~0.offset| 0) (or (<= 402 .cse1) (<= .cse1 400)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse3) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| .cse4)))) .cse5 (or (<= 401 .cse0) (<= .cse0 399)) (forall ((v_ArrVal_1515 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse6) 2147483650))) (<= 0 (+ .cse1 2147483648)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| Int) (v_ArrVal_1507 Int) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1508 Int) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1513 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| 4)) v_ArrVal_1507))) (store (store .cse9 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1508) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1512))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| .cse4)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| (select .cse7 .cse3))) (< 0 (+ 2147483650 (select (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_130| 4) |c_~#queue~0.offset|) v_ArrVal_1513)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1515) |c_~#queue~0.base|) .cse3))))))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) .cse5)))) is different from false [2022-11-25 17:05:52,531 INFO L130 PetriNetUnfolder]: 14388/28025 cut-off events. [2022-11-25 17:05:52,531 INFO L131 PetriNetUnfolder]: For 1754606/1754802 co-relation queries the response was YES. [2022-11-25 17:05:52,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284226 conditions, 28025 events. 14388/28025 cut-off events. For 1754606/1754802 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 244481 event pairs, 4636 based on Foata normal form. 252/24898 useless extension candidates. Maximal degree in co-relation 283456. Up to 8881 conditions per place. [2022-11-25 17:05:53,353 INFO L137 encePairwiseOnDemand]: 456/478 looper letters, 710 selfloop transitions, 376 changer transitions 0/1091 dead transitions. [2022-11-25 17:05:53,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1091 transitions, 21568 flow [2022-11-25 17:05:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 17:05:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-11-25 17:05:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 7416 transitions. [2022-11-25 17:05:53,365 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40828011451222196 [2022-11-25 17:05:53,365 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 7416 transitions. [2022-11-25 17:05:53,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 7416 transitions. [2022-11-25 17:05:53,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:05:53,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 7416 transitions. [2022-11-25 17:05:53,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 195.1578947368421) internal successors, (7416), 38 states have internal predecessors, (7416), 0 states have call successors, (0), 0 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-25 17:05:53,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 478.0) internal successors, (18642), 39 states have internal predecessors, (18642), 0 states have call successors, (0), 0 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-25 17:05:53,410 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 478.0) internal successors, (18642), 39 states have internal predecessors, (18642), 0 states have call successors, (0), 0 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-25 17:05:53,410 INFO L175 Difference]: Start difference. First operand has 321 places, 525 transitions, 7668 flow. Second operand 38 states and 7416 transitions. [2022-11-25 17:05:53,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1091 transitions, 21568 flow [2022-11-25 17:05:56,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 1091 transitions, 20812 flow, removed 300 selfloop flow, removed 9 redundant places. [2022-11-25 17:05:56,191 INFO L231 Difference]: Finished difference. Result has 365 places, 701 transitions, 11836 flow [2022-11-25 17:05:56,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=7059, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=11836, PETRI_PLACES=365, PETRI_TRANSITIONS=701} [2022-11-25 17:05:56,192 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 306 predicate places. [2022-11-25 17:05:56,192 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 701 transitions, 11836 flow [2022-11-25 17:05:56,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 183.93548387096774) internal successors, (5702), 31 states have internal predecessors, (5702), 0 states have call successors, (0), 0 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-25 17:05:56,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:05:56,193 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:56,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 17:05:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 17:05:56,400 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:05:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2130876182, now seen corresponding path program 1 times [2022-11-25 17:05:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:56,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284768846] [2022-11-25 17:05:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:56,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284768846] [2022-11-25 17:05:56,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284768846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:56,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771256915] [2022-11-25 17:05:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:56,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:56,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:56,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:56,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:05:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:56,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:05:56,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:56,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:05:56,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771256915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:56,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:05:56,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-11-25 17:05:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835478576] [2022-11-25 17:05:56,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:56,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:05:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:05:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:05:56,820 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-25 17:05:56,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 701 transitions, 11836 flow. Second operand has 4 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 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-25 17:05:56,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:05:56,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-25 17:05:56,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:09,743 INFO L130 PetriNetUnfolder]: 14388/27808 cut-off events. [2022-11-25 17:06:09,744 INFO L131 PetriNetUnfolder]: For 2079015/2079015 co-relation queries the response was YES. [2022-11-25 17:06:10,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306489 conditions, 27808 events. 14388/27808 cut-off events. For 2079015/2079015 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 240673 event pairs, 7784 based on Foata normal form. 384/24824 useless extension candidates. Maximal degree in co-relation 304512. Up to 24499 conditions per place. [2022-11-25 17:06:10,391 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 668 selfloop transitions, 43 changer transitions 0/715 dead transitions. [2022-11-25 17:06:10,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 715 transitions, 13846 flow [2022-11-25 17:06:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:06:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2022-11-25 17:06:10,394 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.518305439330544 [2022-11-25 17:06:10,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2022-11-25 17:06:10,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2022-11-25 17:06:10,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:10,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2022-11-25 17:06:10,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 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-25 17:06:10,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 17:06:10,399 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 17:06:10,399 INFO L175 Difference]: Start difference. First operand has 365 places, 701 transitions, 11836 flow. Second operand 4 states and 991 transitions. [2022-11-25 17:06:10,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 715 transitions, 13846 flow [2022-11-25 17:06:13,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 715 transitions, 12611 flow, removed 522 selfloop flow, removed 11 redundant places. [2022-11-25 17:06:13,694 INFO L231 Difference]: Finished difference. Result has 356 places, 700 transitions, 10687 flow [2022-11-25 17:06:13,695 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=10601, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10687, PETRI_PLACES=356, PETRI_TRANSITIONS=700} [2022-11-25 17:06:13,695 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 297 predicate places. [2022-11-25 17:06:13,695 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 700 transitions, 10687 flow [2022-11-25 17:06:13,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 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-25 17:06:13,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:13,696 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:13,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:13,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 17:06:13,896 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:06:13,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2130876005, now seen corresponding path program 1 times [2022-11-25 17:06:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:13,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180329196] [2022-11-25 17:06:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:06:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:13,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180329196] [2022-11-25 17:06:13,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180329196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:13,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:13,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444761458] [2022-11-25 17:06:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:13,986 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-25 17:06:13,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 700 transitions, 10687 flow. Second operand has 4 states, 4 states have (on average 236.5) internal successors, (946), 4 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-25 17:06:13,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:13,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-25 17:06:13,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:26,001 INFO L130 PetriNetUnfolder]: 13926/27008 cut-off events. [2022-11-25 17:06:26,001 INFO L131 PetriNetUnfolder]: For 1913448/1913448 co-relation queries the response was YES. [2022-11-25 17:06:26,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286243 conditions, 27008 events. 13926/27008 cut-off events. For 1913448/1913448 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 234110 event pairs, 7606 based on Foata normal form. 384/24485 useless extension candidates. Maximal degree in co-relation 284356. Up to 16013 conditions per place. [2022-11-25 17:06:27,069 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 618 selfloop transitions, 91 changer transitions 0/713 dead transitions. [2022-11-25 17:06:27,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 713 transitions, 12673 flow [2022-11-25 17:06:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:06:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 987 transitions. [2022-11-25 17:06:27,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.516213389121339 [2022-11-25 17:06:27,072 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 987 transitions. [2022-11-25 17:06:27,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 987 transitions. [2022-11-25 17:06:27,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:27,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 987 transitions. [2022-11-25 17:06:27,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 246.75) internal successors, (987), 4 states have internal predecessors, (987), 0 states have call successors, (0), 0 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-25 17:06:27,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 17:06:27,077 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 0 states have call successors, (0), 0 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-25 17:06:27,077 INFO L175 Difference]: Start difference. First operand has 356 places, 700 transitions, 10687 flow. Second operand 4 states and 987 transitions. [2022-11-25 17:06:27,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 713 transitions, 12673 flow [2022-11-25 17:06:36,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 713 transitions, 12575 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 17:06:36,694 INFO L231 Difference]: Finished difference. Result has 355 places, 698 transitions, 10759 flow [2022-11-25 17:06:36,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=10577, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10759, PETRI_PLACES=355, PETRI_TRANSITIONS=698} [2022-11-25 17:06:36,695 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 296 predicate places. [2022-11-25 17:06:36,695 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 698 transitions, 10759 flow [2022-11-25 17:06:36,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 236.5) internal successors, (946), 4 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-25 17:06:36,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:36,695 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:36,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:06:36,696 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 17:06:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -822517710, now seen corresponding path program 1 times [2022-11-25 17:06:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464791412] [2022-11-25 17:06:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464791412] [2022-11-25 17:06:36,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464791412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257390871] [2022-11-25 17:06:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:36,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:06:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:36,795 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:06:36,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5bb6d4-57e6-4d1f-8f17-f5d501260a13/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:06:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:37,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:06:37,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:37,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:37,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257390871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:37,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:06:37,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 17:06:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492594290] [2022-11-25 17:06:37,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:37,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:06:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:06:37,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:06:37,183 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-25 17:06:37,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 698 transitions, 10759 flow. Second operand has 10 states, 10 states have (on average 235.6) internal successors, (2356), 10 states have internal predecessors, (2356), 0 states have call successors, (0), 0 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-25 17:06:37,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:37,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-25 17:06:37,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand