./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 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_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS --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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:29:46,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:29:46,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:29:46,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:29:46,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:29:46,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:29:46,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:29:46,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:29:46,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:29:46,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:29:46,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:29:46,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:29:46,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:29:46,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:29:46,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:29:46,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:29:46,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:29:46,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:29:46,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:29:46,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:29:46,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:29:46,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:29:46,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:29:46,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:29:46,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:29:46,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:29:46,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:29:46,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:29:46,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:29:46,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:29:46,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:29:46,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:29:46,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:29:46,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:29:46,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:29:46,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:29:46,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:29:46,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:29:46,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:29:46,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:29:46,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:29:46,606 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-23 03:29:46,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:29:46,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:29:46,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:29:46,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:29:46,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:29:46,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:29:46,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:29:46,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:29:46,638 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:29:46,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:29:46,640 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:29:46,640 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:29:46,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:29:46,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:29:46,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:29:46,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:29:46,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:29:46,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:29:46,642 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 03:29:46,642 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:29:46,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:29:46,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:29:46,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:29:46,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:29:46,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:29:46,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:29:46,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:29:46,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:29:46,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:29:46,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:29:46,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:29:46,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:29:46,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:29:46,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:29:46,647 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:29:46,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:29:46,647 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_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/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_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-23 03:29:46,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:29:46,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:29:46,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:29:46,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:29:46,994 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:29:46,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-23 03:29:50,037 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:29:50,380 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:29:50,381 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-23 03:29:50,398 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/data/9a97c9896/c9361019e11648f4b449dc3cdc5d597b/FLAG2394b211f [2022-11-23 03:29:50,414 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/data/9a97c9896/c9361019e11648f4b449dc3cdc5d597b [2022-11-23 03:29:50,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:29:50,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:29:50,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:29:50,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:29:50,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:29:50,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:50" (1/1) ... [2022-11-23 03:29:50,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34233187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:50, skipping insertion in model container [2022-11-23 03:29:50,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:50" (1/1) ... [2022-11-23 03:29:50,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:29:50,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:29:51,048 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_a0cd22a3-1ae2-4624-ad57-d33152f24018/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-23 03:29:51,051 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_a0cd22a3-1ae2-4624-ad57-d33152f24018/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-23 03:29:51,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:29:51,076 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:29:51,162 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_a0cd22a3-1ae2-4624-ad57-d33152f24018/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-23 03:29:51,171 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_a0cd22a3-1ae2-4624-ad57-d33152f24018/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-23 03:29:51,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:29:51,250 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:29:51,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51 WrapperNode [2022-11-23 03:29:51,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:29:51,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:29:51,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:29:51,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:29:51,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,344 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-23 03:29:51,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:29:51,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:29:51,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:29:51,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:29:51,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,416 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:29:51,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:29:51,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:29:51,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:29:51,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (1/1) ... [2022-11-23 03:29:51,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:29:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:29:51,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:29:51,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:29:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-23 03:29:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-23 03:29:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-23 03:29:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-23 03:29:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:29:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:29:51,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:29:51,540 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:29:51,689 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:29:51,691 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:29:52,188 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:29:52,198 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:29:52,207 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 03:29:52,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:52 BoogieIcfgContainer [2022-11-23 03:29:52,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:29:52,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:29:52,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:29:52,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:29:52,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:29:50" (1/3) ... [2022-11-23 03:29:52,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f3d381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:29:52, skipping insertion in model container [2022-11-23 03:29:52,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:51" (2/3) ... [2022-11-23 03:29:52,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f3d381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:29:52, skipping insertion in model container [2022-11-23 03:29:52,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:52" (3/3) ... [2022-11-23 03:29:52,223 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-23 03:29:52,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:29:52,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:29:52,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-23 03:29:52,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:29:52,423 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 03:29:52,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-23 03:29:52,570 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-23 03:29:52,571 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 03:29:52,579 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-23 03:29:52,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-23 03:29:52,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-23 03:29:52,590 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:29:52,606 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-23 03:29:52,609 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 239 transitions, 487 flow [2022-11-23 03:29:52,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 239 transitions, 487 flow [2022-11-23 03:29:52,702 INFO L130 PetriNetUnfolder]: 13/239 cut-off events. [2022-11-23 03:29:52,702 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 03:29:52,709 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-23 03:29:52,717 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-23 03:30:04,898 INFO L134 LiptonReduction]: Checked pairs total: 31775 [2022-11-23 03:30:04,898 INFO L136 LiptonReduction]: Total number of compositions: 227 [2022-11-23 03:30:04,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:30:04,921 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;@31484997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:30:04,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-23 03:30:04,927 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-11-23 03:30:04,927 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 03:30:04,928 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:04,928 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:04,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1252954978, now seen corresponding path program 1 times [2022-11-23 03:30:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:04,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302697633] [2022-11-23 03:30:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:05,887 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-23 03:30:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:05,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302697633] [2022-11-23 03:30:05,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302697633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:05,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:05,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:30:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621020180] [2022-11-23 03:30:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:05,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:30:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:30:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:30:06,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-23 03:30:06,290 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-23 03:30:06,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:06,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-23 03:30:06,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:06,828 INFO L130 PetriNetUnfolder]: 1630/2709 cut-off events. [2022-11-23 03:30:06,828 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-23 03:30:06,831 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-23 03:30:06,844 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 58 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2022-11-23 03:30:06,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 281 flow [2022-11-23 03:30:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1192 transitions. [2022-11-23 03:30:06,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49874476987447697 [2022-11-23 03:30:06,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1192 transitions. [2022-11-23 03:30:06,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1192 transitions. [2022-11-23 03:30:06,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:06,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1192 transitions. [2022-11-23 03:30:06,886 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-23 03:30:06,896 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-23 03:30:06,898 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-23 03:30:06,900 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 5 states and 1192 transitions. [2022-11-23 03:30:06,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 281 flow [2022-11-23 03:30:06,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:30:06,909 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 169 flow [2022-11-23 03:30:06,912 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-23 03:30:06,916 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2022-11-23 03:30:06,917 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 169 flow [2022-11-23 03:30:06,918 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-23 03:30:06,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:06,919 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:06,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:30:06,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash 186648025, now seen corresponding path program 1 times [2022-11-23 03:30:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:06,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869882257] [2022-11-23 03:30:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:08,393 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-23 03:30:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:08,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869882257] [2022-11-23 03:30:08,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869882257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:08,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:08,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:30:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826295016] [2022-11-23 03:30:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:08,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:08,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:09,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-23 03:30:09,164 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-23 03:30:09,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:09,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-23 03:30:09,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:10,242 INFO L130 PetriNetUnfolder]: 2142/3574 cut-off events. [2022-11-23 03:30:10,243 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-11-23 03:30:10,248 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-23 03:30:10,263 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 112 selfloop transitions, 13 changer transitions 0/131 dead transitions. [2022-11-23 03:30:10,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 131 transitions, 566 flow [2022-11-23 03:30:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1234 transitions. [2022-11-23 03:30:10,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5163179916317991 [2022-11-23 03:30:10,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1234 transitions. [2022-11-23 03:30:10,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1234 transitions. [2022-11-23 03:30:10,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:10,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1234 transitions. [2022-11-23 03:30:10,272 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-23 03:30:10,277 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-23 03:30:10,279 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-23 03:30:10,279 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 169 flow. Second operand 5 states and 1234 transitions. [2022-11-23 03:30:10,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 131 transitions, 566 flow [2022-11-23 03:30:10,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:30:10,290 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 241 flow [2022-11-23 03:30:10,290 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-23 03:30:10,291 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2022-11-23 03:30:10,291 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 241 flow [2022-11-23 03:30:10,292 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-23 03:30:10,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:10,293 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:10,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:30:10,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash 186900985, now seen corresponding path program 2 times [2022-11-23 03:30:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:10,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018212196] [2022-11-23 03:30:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:11,066 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-23 03:30:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:11,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018212196] [2022-11-23 03:30:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018212196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:11,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:11,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:30:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953112946] [2022-11-23 03:30:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:11,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:11,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 478 [2022-11-23 03:30:11,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:11,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:11,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 478 [2022-11-23 03:30:11,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:12,628 INFO L130 PetriNetUnfolder]: 2711/4511 cut-off events. [2022-11-23 03:30:12,629 INFO L131 PetriNetUnfolder]: For 979/979 co-relation queries the response was YES. [2022-11-23 03:30:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10039 conditions, 4511 events. 2711/4511 cut-off events. For 979/979 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 26200 event pairs, 1503 based on Foata normal form. 0/3454 useless extension candidates. Maximal degree in co-relation 5626. Up to 3432 conditions per place. [2022-11-23 03:30:12,659 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 124 selfloop transitions, 14 changer transitions 0/144 dead transitions. [2022-11-23 03:30:12,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 684 flow [2022-11-23 03:30:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:30:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:30:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1679 transitions. [2022-11-23 03:30:12,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5017931858936043 [2022-11-23 03:30:12,665 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1679 transitions. [2022-11-23 03:30:12,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1679 transitions. [2022-11-23 03:30:12,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:12,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1679 transitions. [2022-11-23 03:30:12,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:12,678 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-23 03:30:12,680 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-23 03:30:12,680 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 241 flow. Second operand 7 states and 1679 transitions. [2022-11-23 03:30:12,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 684 flow [2022-11-23 03:30:12,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 144 transitions, 668 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-11-23 03:30:12,692 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 310 flow [2022-11-23 03:30:12,692 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2022-11-23 03:30:12,694 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2022-11-23 03:30:12,694 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 310 flow [2022-11-23 03:30:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:12,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:12,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:12,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:30:12,697 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 186900986, now seen corresponding path program 1 times [2022-11-23 03:30:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:12,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772145245] [2022-11-23 03:30:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:12,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:13,805 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-23 03:30:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772145245] [2022-11-23 03:30:13,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772145245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:13,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:13,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:30:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905521940] [2022-11-23 03:30:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:13,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:13,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:13,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:14,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-23 03:30:14,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:14,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:14,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-23 03:30:14,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:15,485 INFO L130 PetriNetUnfolder]: 2662/4416 cut-off events. [2022-11-23 03:30:15,486 INFO L131 PetriNetUnfolder]: For 966/966 co-relation queries the response was YES. [2022-11-23 03:30:15,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10095 conditions, 4416 events. 2662/4416 cut-off events. For 966/966 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 25548 event pairs, 439 based on Foata normal form. 31/3448 useless extension candidates. Maximal degree in co-relation 7571. Up to 3326 conditions per place. [2022-11-23 03:30:15,513 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 118 selfloop transitions, 14 changer transitions 0/138 dead transitions. [2022-11-23 03:30:15,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 138 transitions, 699 flow [2022-11-23 03:30:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1237 transitions. [2022-11-23 03:30:15,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5175732217573221 [2022-11-23 03:30:15,522 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1237 transitions. [2022-11-23 03:30:15,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1237 transitions. [2022-11-23 03:30:15,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:15,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1237 transitions. [2022-11-23 03:30:15,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 247.4) internal successors, (1237), 5 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:15,531 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-23 03:30:15,532 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-23 03:30:15,533 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 310 flow. Second operand 5 states and 1237 transitions. [2022-11-23 03:30:15,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 138 transitions, 699 flow [2022-11-23 03:30:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 689 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:30:15,547 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 338 flow [2022-11-23 03:30:15,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2022-11-23 03:30:15,549 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2022-11-23 03:30:15,549 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 338 flow [2022-11-23 03:30:15,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:15,550 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:15,550 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:15,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:30:15,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1122777527, now seen corresponding path program 1 times [2022-11-23 03:30:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:15,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020022560] [2022-11-23 03:30:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:15,604 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-23 03:30:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020022560] [2022-11-23 03:30:15,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020022560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:15,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:15,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:30:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856830542] [2022-11-23 03:30:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:15,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:30:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:30:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:30:15,624 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-23 03:30:15,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 338 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-23 03:30:15,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:15,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-23 03:30:15,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:16,545 INFO L130 PetriNetUnfolder]: 4518/7347 cut-off events. [2022-11-23 03:30:16,546 INFO L131 PetriNetUnfolder]: For 3791/3791 co-relation queries the response was YES. [2022-11-23 03:30:16,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17329 conditions, 7347 events. 4518/7347 cut-off events. For 3791/3791 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 44625 event pairs, 2211 based on Foata normal form. 0/5653 useless extension candidates. Maximal degree in co-relation 14554. Up to 4490 conditions per place. [2022-11-23 03:30:16,709 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 158 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2022-11-23 03:30:16,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 167 transitions, 1016 flow [2022-11-23 03:30:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:30:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:30:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1053 transitions. [2022-11-23 03:30:16,713 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5507322175732218 [2022-11-23 03:30:16,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1053 transitions. [2022-11-23 03:30:16,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1053 transitions. [2022-11-23 03:30:16,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:16,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1053 transitions. [2022-11-23 03:30:16,717 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-23 03:30:16,719 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-23 03:30:16,720 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-23 03:30:16,720 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 338 flow. Second operand 4 states and 1053 transitions. [2022-11-23 03:30:16,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 167 transitions, 1016 flow [2022-11-23 03:30:16,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 167 transitions, 942 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-23 03:30:16,733 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 334 flow [2022-11-23 03:30:16,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2022-11-23 03:30:16,737 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2022-11-23 03:30:16,737 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 334 flow [2022-11-23 03:30:16,738 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-23 03:30:16,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:16,738 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:16,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:30:16,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash -782335366, now seen corresponding path program 1 times [2022-11-23 03:30:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:16,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475477177] [2022-11-23 03:30:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:18,166 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-23 03:30:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:18,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475477177] [2022-11-23 03:30:18,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475477177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:18,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:18,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:30:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090353207] [2022-11-23 03:30:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:18,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:30:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:30:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:30:18,911 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 478 [2022-11-23 03:30:18,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 334 flow. Second operand has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:18,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:18,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 478 [2022-11-23 03:30:18,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:20,344 INFO L130 PetriNetUnfolder]: 4364/7242 cut-off events. [2022-11-23 03:30:20,344 INFO L131 PetriNetUnfolder]: For 2861/2863 co-relation queries the response was YES. [2022-11-23 03:30:20,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17500 conditions, 7242 events. 4364/7242 cut-off events. For 2861/2863 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 44725 event pairs, 3026 based on Foata normal form. 0/5907 useless extension candidates. Maximal degree in co-relation 12807. Up to 6979 conditions per place. [2022-11-23 03:30:20,402 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 78 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2022-11-23 03:30:20,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 529 flow [2022-11-23 03:30:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2022-11-23 03:30:20,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.500418410041841 [2022-11-23 03:30:20,407 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1196 transitions. [2022-11-23 03:30:20,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1196 transitions. [2022-11-23 03:30:20,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:20,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1196 transitions. [2022-11-23 03:30:20,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 239.2) internal successors, (1196), 5 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:20,415 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-23 03:30:20,416 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-23 03:30:20,417 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 334 flow. Second operand 5 states and 1196 transitions. [2022-11-23 03:30:20,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 529 flow [2022-11-23 03:30:20,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:30:20,433 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 369 flow [2022-11-23 03:30:20,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2022-11-23 03:30:20,436 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2022-11-23 03:30:20,436 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 369 flow [2022-11-23 03:30:20,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:20,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:20,437 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:20,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:30:20,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1554621182, now seen corresponding path program 1 times [2022-11-23 03:30:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:20,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026898013] [2022-11-23 03:30:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:21,413 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-23 03:30:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:21,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026898013] [2022-11-23 03:30:21,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026898013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:21,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:21,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:30:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106856101] [2022-11-23 03:30:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:21,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:21,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:22,365 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 478 [2022-11-23 03:30:22,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 223.83333333333334) internal successors, (1343), 6 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:22,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:22,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 478 [2022-11-23 03:30:22,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:23,532 INFO L130 PetriNetUnfolder]: 4589/7597 cut-off events. [2022-11-23 03:30:23,532 INFO L131 PetriNetUnfolder]: For 2583/2617 co-relation queries the response was YES. [2022-11-23 03:30:23,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18782 conditions, 7597 events. 4589/7597 cut-off events. For 2583/2617 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 47824 event pairs, 1045 based on Foata normal form. 98/6580 useless extension candidates. Maximal degree in co-relation 12963. Up to 5766 conditions per place. [2022-11-23 03:30:23,580 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 131 selfloop transitions, 16 changer transitions 0/153 dead transitions. [2022-11-23 03:30:23,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 153 transitions, 862 flow [2022-11-23 03:30:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1238 transitions. [2022-11-23 03:30:23,584 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2022-11-23 03:30:23,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1238 transitions. [2022-11-23 03:30:23,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1238 transitions. [2022-11-23 03:30:23,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:23,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1238 transitions. [2022-11-23 03:30:23,588 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-23 03:30:23,592 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-23 03:30:23,593 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-23 03:30:23,594 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 369 flow. Second operand 5 states and 1238 transitions. [2022-11-23 03:30:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 153 transitions, 862 flow [2022-11-23 03:30:23,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 850 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:30:23,628 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 417 flow [2022-11-23 03:30:23,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2022-11-23 03:30:23,629 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 28 predicate places. [2022-11-23 03:30:23,629 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 417 flow [2022-11-23 03:30:23,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.83333333333334) internal successors, (1343), 6 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:23,630 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:23,631 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:23,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:30:23,631 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 161938586, now seen corresponding path program 2 times [2022-11-23 03:30:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:23,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140344094] [2022-11-23 03:30:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:23,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:24,271 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-23 03:30:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140344094] [2022-11-23 03:30:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140344094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:24,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:24,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:30:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750853266] [2022-11-23 03:30:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:24,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:24,939 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-23 03:30:24,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:24,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:24,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-23 03:30:24,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:26,234 INFO L130 PetriNetUnfolder]: 5003/8229 cut-off events. [2022-11-23 03:30:26,234 INFO L131 PetriNetUnfolder]: For 4635/4657 co-relation queries the response was YES. [2022-11-23 03:30:26,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21419 conditions, 8229 events. 5003/8229 cut-off events. For 4635/4657 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 51967 event pairs, 2032 based on Foata normal form. 98/7151 useless extension candidates. Maximal degree in co-relation 11493. Up to 5786 conditions per place. [2022-11-23 03:30:26,285 INFO L137 encePairwiseOnDemand]: 469/478 looper letters, 133 selfloop transitions, 18 changer transitions 0/157 dead transitions. [2022-11-23 03:30:26,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 157 transitions, 936 flow [2022-11-23 03:30:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1242 transitions. [2022-11-23 03:30:26,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196652719665272 [2022-11-23 03:30:26,290 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1242 transitions. [2022-11-23 03:30:26,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1242 transitions. [2022-11-23 03:30:26,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:26,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1242 transitions. [2022-11-23 03:30:26,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 248.4) internal successors, (1242), 5 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:26,298 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-23 03:30:26,299 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-23 03:30:26,300 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 417 flow. Second operand 5 states and 1242 transitions. [2022-11-23 03:30:26,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 157 transitions, 936 flow [2022-11-23 03:30:26,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 157 transitions, 912 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:30:26,337 INFO L231 Difference]: Finished difference. Result has 89 places, 89 transitions, 472 flow [2022-11-23 03:30:26,337 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=472, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2022-11-23 03:30:26,338 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2022-11-23 03:30:26,338 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 472 flow [2022-11-23 03:30:26,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:26,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:26,340 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:26,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:30:26,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash 952572074, now seen corresponding path program 1 times [2022-11-23 03:30:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:26,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429854642] [2022-11-23 03:30:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:26,400 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-23 03:30:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:26,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429854642] [2022-11-23 03:30:26,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429854642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:26,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:26,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:30:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036751192] [2022-11-23 03:30:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:26,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:30:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:26,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:30:26,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:30:26,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 478 [2022-11-23 03:30:26,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 472 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-23 03:30:26,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:26,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 478 [2022-11-23 03:30:26,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:26,689 INFO L130 PetriNetUnfolder]: 991/1877 cut-off events. [2022-11-23 03:30:26,689 INFO L131 PetriNetUnfolder]: For 970/970 co-relation queries the response was YES. [2022-11-23 03:30:26,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4794 conditions, 1877 events. 991/1877 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10487 event pairs, 695 based on Foata normal form. 92/1717 useless extension candidates. Maximal degree in co-relation 3767. Up to 1031 conditions per place. [2022-11-23 03:30:26,700 INFO L137 encePairwiseOnDemand]: 474/478 looper letters, 77 selfloop transitions, 2 changer transitions 8/91 dead transitions. [2022-11-23 03:30:26,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 603 flow [2022-11-23 03:30:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:30:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:30:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2022-11-23 03:30:26,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5362622036262203 [2022-11-23 03:30:26,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 769 transitions. [2022-11-23 03:30:26,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 769 transitions. [2022-11-23 03:30:26,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:26,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 769 transitions. [2022-11-23 03:30:26,707 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-23 03:30:26,718 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-23 03:30:26,727 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-23 03:30:26,727 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 472 flow. Second operand 3 states and 769 transitions. [2022-11-23 03:30:26,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 603 flow [2022-11-23 03:30:26,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 91 transitions, 576 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 03:30:26,733 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 374 flow [2022-11-23 03:30:26,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2022-11-23 03:30:26,735 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 29 predicate places. [2022-11-23 03:30:26,736 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 374 flow [2022-11-23 03:30:26,736 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-23 03:30:26,736 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:26,736 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:30:26,737 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1686342882, now seen corresponding path program 3 times [2022-11-23 03:30:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397693182] [2022-11-23 03:30:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:27,427 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-23 03:30:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397693182] [2022-11-23 03:30:27,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397693182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:27,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:27,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:30:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020856861] [2022-11-23 03:30:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:27,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:28,102 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 478 [2022-11-23 03:30:28,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:28,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:28,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 478 [2022-11-23 03:30:28,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:28,690 INFO L130 PetriNetUnfolder]: 897/1721 cut-off events. [2022-11-23 03:30:28,690 INFO L131 PetriNetUnfolder]: For 889/889 co-relation queries the response was YES. [2022-11-23 03:30:28,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4329 conditions, 1721 events. 897/1721 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9580 event pairs, 281 based on Foata normal form. 36/1545 useless extension candidates. Maximal degree in co-relation 3410. Up to 918 conditions per place. [2022-11-23 03:30:28,701 INFO L137 encePairwiseOnDemand]: 470/478 looper letters, 97 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2022-11-23 03:30:28,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 687 flow [2022-11-23 03:30:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:30:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:30:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1210 transitions. [2022-11-23 03:30:28,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2022-11-23 03:30:28,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1210 transitions. [2022-11-23 03:30:28,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1210 transitions. [2022-11-23 03:30:28,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:28,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1210 transitions. [2022-11-23 03:30:28,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:28,714 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-23 03:30:28,715 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-23 03:30:28,715 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 374 flow. Second operand 5 states and 1210 transitions. [2022-11-23 03:30:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 687 flow [2022-11-23 03:30:28,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 673 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-23 03:30:28,722 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 401 flow [2022-11-23 03:30:28,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2022-11-23 03:30:28,724 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 31 predicate places. [2022-11-23 03:30:28,724 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 401 flow [2022-11-23 03:30:28,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:28,725 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:28,725 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:28,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:30:28,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2060660023, now seen corresponding path program 1 times [2022-11-23 03:30:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:28,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954588158] [2022-11-23 03:30:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:28,800 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-23 03:30:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:28,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954588158] [2022-11-23 03:30:28,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954588158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:28,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:28,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:30:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766412947] [2022-11-23 03:30:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:28,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:30:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:30:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:30:28,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-23 03:30:28,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 401 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-23 03:30:28,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:28,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-23 03:30:28,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:29,137 INFO L130 PetriNetUnfolder]: 770/1444 cut-off events. [2022-11-23 03:30:29,137 INFO L131 PetriNetUnfolder]: For 913/913 co-relation queries the response was YES. [2022-11-23 03:30:29,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 1444 events. 770/1444 cut-off events. For 913/913 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7018 event pairs, 572 based on Foata normal form. 10/1263 useless extension candidates. Maximal degree in co-relation 3229. Up to 915 conditions per place. [2022-11-23 03:30:29,148 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 86 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2022-11-23 03:30:29,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 621 flow [2022-11-23 03:30:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:30:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:30:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2022-11-23 03:30:29,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5251046025104602 [2022-11-23 03:30:29,152 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1004 transitions. [2022-11-23 03:30:29,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1004 transitions. [2022-11-23 03:30:29,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:29,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1004 transitions. [2022-11-23 03:30:29,155 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-23 03:30:29,158 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-23 03:30:29,159 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-23 03:30:29,159 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 401 flow. Second operand 4 states and 1004 transitions. [2022-11-23 03:30:29,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 621 flow [2022-11-23 03:30:29,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 598 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-23 03:30:29,166 INFO L231 Difference]: Finished difference. Result has 92 places, 79 transitions, 401 flow [2022-11-23 03:30:29,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=92, PETRI_TRANSITIONS=79} [2022-11-23 03:30:29,167 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 33 predicate places. [2022-11-23 03:30:29,167 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 79 transitions, 401 flow [2022-11-23 03:30:29,167 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-23 03:30:29,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:29,168 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:29,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:30:29,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186173, now seen corresponding path program 1 times [2022-11-23 03:30:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383566376] [2022-11-23 03:30:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:30,264 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-23 03:30:30,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:30,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383566376] [2022-11-23 03:30:30,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383566376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:30,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649356612] [2022-11-23 03:30:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:30,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:30,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:30,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:30:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:30,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-23 03:30:30,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:30,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:30,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:30,626 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:30:30,627 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-23 03:30:30,641 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:30:30,642 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-23 03:30:30,775 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-23 03:30:30,938 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-23 03:30:31,161 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-23 03:30:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:31,259 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-23 03:30:31,476 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-23 03:30:31,692 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-23 03:30:31,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:30:31,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-23 03:30:31,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-23 03:30:32,115 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_435) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-11-23 03:30:32,161 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int) (v_ArrVal_435 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_433)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_435) (< (+ (select .cse1 .cse3) 1) v_ArrVal_438) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-23 03:30:34,798 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-23 03:30:34,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649356612] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:30:34,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:30:34,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-23 03:30:34,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338762429] [2022-11-23 03:30:34,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:30:34,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 03:30:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:34,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 03:30:34,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=588, Unknown=10, NotChecked=220, Total=992 [2022-11-23 03:30:34,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 478 [2022-11-23 03:30:34,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 79 transitions, 401 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-23 03:30:34,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:34,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 478 [2022-11-23 03:30:34,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:43,649 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-23 03:30:45,665 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-23 03:30:45,705 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ (select .cse4 .cse5) 1)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse1) 2147483647) (< .cse2 v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 .cse3)))))) (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_435) .cse5 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse1) 2147483647) (< .cse2 v_ArrVal_438) (not (<= v_ArrVal_435 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse6 .cse3))))))))) is different from false [2022-11-23 03:30:46,530 INFO L130 PetriNetUnfolder]: 783/1491 cut-off events. [2022-11-23 03:30:46,530 INFO L131 PetriNetUnfolder]: For 945/945 co-relation queries the response was YES. [2022-11-23 03:30:46,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 1491 events. 783/1491 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7437 event pairs, 632 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 3396. Up to 1391 conditions per place. [2022-11-23 03:30:46,541 INFO L137 encePairwiseOnDemand]: 463/478 looper letters, 80 selfloop transitions, 43 changer transitions 0/128 dead transitions. [2022-11-23 03:30:46,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 128 transitions, 883 flow [2022-11-23 03:30:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 03:30:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-23 03:30:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3710 transitions. [2022-11-23 03:30:46,552 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3880753138075314 [2022-11-23 03:30:46,553 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3710 transitions. [2022-11-23 03:30:46,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3710 transitions. [2022-11-23 03:30:46,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:46,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3710 transitions. [2022-11-23 03:30:46,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 185.5) internal successors, (3710), 20 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:46,576 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-23 03:30:46,580 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-23 03:30:46,580 INFO L175 Difference]: Start difference. First operand has 92 places, 79 transitions, 401 flow. Second operand 20 states and 3710 transitions. [2022-11-23 03:30:46,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 128 transitions, 883 flow [2022-11-23 03:30:46,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:30:46,588 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 725 flow [2022-11-23 03:30:46,588 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=725, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2022-11-23 03:30:46,589 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 58 predicate places. [2022-11-23 03:30:46,589 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 725 flow [2022-11-23 03:30:46,591 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-23 03:30:46,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:46,592 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:46,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:30:46,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 03:30:46,800 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1146186174, now seen corresponding path program 1 times [2022-11-23 03:30:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:46,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632213781] [2022-11-23 03:30:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:47,308 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-23 03:30:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:47,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632213781] [2022-11-23 03:30:47,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632213781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:47,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594879063] [2022-11-23 03:30:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:47,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:47,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:47,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:47,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:30:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:47,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 03:30:47,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:47,616 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-23 03:30:47,699 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-23 03:30:47,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:47,742 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-23 03:30:47,854 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-23 03:30:47,854 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-23 03:30:47,937 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-23 03:30:47,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:30:48,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_520 (Array Int Int))) (or (< (+ v_ArrVal_522 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_520) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_522) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2022-11-23 03:30:48,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:30:48,196 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-23 03:30:48,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:30:48,210 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-23 03:30:48,219 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-23 03:30:48,241 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-23 03:30:48,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:30:48,256 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-23 03:30:48,368 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-23 03:30:48,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594879063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:30:48,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:30:48,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-23 03:30:48,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989589070] [2022-11-23 03:30:48,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:30:48,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 03:30:48,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:48,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 03:30:48,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=361, Unknown=7, NotChecked=40, Total=506 [2022-11-23 03:30:48,541 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 478 [2022-11-23 03:30:48,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 725 flow. Second operand has 23 states, 23 states have (on average 193.08695652173913) internal successors, (4441), 23 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:48,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:48,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 478 [2022-11-23 03:30:48,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:30:49,642 INFO L130 PetriNetUnfolder]: 1426/2732 cut-off events. [2022-11-23 03:30:49,642 INFO L131 PetriNetUnfolder]: For 1762/1762 co-relation queries the response was YES. [2022-11-23 03:30:49,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7485 conditions, 2732 events. 1426/2732 cut-off events. For 1762/1762 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15969 event pairs, 549 based on Foata normal form. 12/2397 useless extension candidates. Maximal degree in co-relation 7222. Up to 1100 conditions per place. [2022-11-23 03:30:49,661 INFO L137 encePairwiseOnDemand]: 471/478 looper letters, 161 selfloop transitions, 30 changer transitions 0/196 dead transitions. [2022-11-23 03:30:49,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 196 transitions, 1440 flow [2022-11-23 03:30:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:30:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:30:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1469 transitions. [2022-11-23 03:30:49,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43903167961745365 [2022-11-23 03:30:49,671 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1469 transitions. [2022-11-23 03:30:49,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1469 transitions. [2022-11-23 03:30:49,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:30:49,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1469 transitions. [2022-11-23 03:30:49,675 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-23 03:30:49,680 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-23 03:30:49,682 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-23 03:30:49,682 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 725 flow. Second operand 7 states and 1469 transitions. [2022-11-23 03:30:49,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 196 transitions, 1440 flow [2022-11-23 03:30:49,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 1338 flow, removed 41 selfloop flow, removed 4 redundant places. [2022-11-23 03:30:49,701 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 758 flow [2022-11-23 03:30:49,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=758, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2022-11-23 03:30:49,703 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 63 predicate places. [2022-11-23 03:30:49,703 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 758 flow [2022-11-23 03:30:49,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 193.08695652173913) internal successors, (4441), 23 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:30:49,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:30:49,705 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:49,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:30:49,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 03:30:49,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:30:49,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash 556427979, now seen corresponding path program 1 times [2022-11-23 03:30:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:49,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873452078] [2022-11-23 03:30:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:51,536 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-23 03:30:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873452078] [2022-11-23 03:30:51,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873452078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:51,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435177730] [2022-11-23 03:30:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:51,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:51,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:30:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:51,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-23 03:30:51,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:51,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-23 03:30:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:51,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:51,782 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:30:51,783 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 12 treesize of output 20 [2022-11-23 03:30:51,805 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:30:51,806 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-23 03:30:51,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:51,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:51,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 03:30:52,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:30:52,053 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 03:30:52,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-23 03:30:52,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:52,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:30:52,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 03:30:52,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-23 03:30:52,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:52,429 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 25 [2022-11-23 03:30:52,566 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 03:30:52,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-23 03:30:52,608 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-23 03:30:52,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:30:52,739 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-23 03:30:52,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-23 03:30:52,866 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_614 Int)) (or (not (<= v_ArrVal_614 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_614) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-11-23 03:30:52,890 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_614 Int)) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_614) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_614) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-23 03:30:52,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int) (v_ArrVal_614 Int) (v_ArrVal_612 Int)) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.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_612))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_614) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_614) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_619)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-23 03:30:58,733 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-23 03:30:58,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435177730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:30:58,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:30:58,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-23 03:30:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503443201] [2022-11-23 03:30:58,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:30:58,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 03:30:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 03:30:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=685, Unknown=8, NotChecked=300, Total=1190 [2022-11-23 03:30:58,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-23 03:30:58,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 758 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-23 03:30:58,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:30:58,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-23 03:30:58,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:31:02,379 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (< (select .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (forall ((v_ArrVal_619 Int)) (< (select (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_619)) .cse3) 2147483647)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 Int)) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse0 .cse5 (+ (select .cse0 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_618) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse2)) |c_~#queue~0.offset|) v_ArrVal_619)) .cse3) 2147483647)))) is different from false [2022-11-23 03:31:04,460 INFO L130 PetriNetUnfolder]: 2427/4669 cut-off events. [2022-11-23 03:31:04,461 INFO L131 PetriNetUnfolder]: For 4002/4002 co-relation queries the response was YES. [2022-11-23 03:31:04,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12739 conditions, 4669 events. 2427/4669 cut-off events. For 4002/4002 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 30601 event pairs, 713 based on Foata normal form. 27/4113 useless extension candidates. Maximal degree in co-relation 12307. Up to 2184 conditions per place. [2022-11-23 03:31:04,488 INFO L137 encePairwiseOnDemand]: 457/478 looper letters, 174 selfloop transitions, 85 changer transitions 0/264 dead transitions. [2022-11-23 03:31:04,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 264 transitions, 1803 flow [2022-11-23 03:31:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 03:31:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-23 03:31:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3559 transitions. [2022-11-23 03:31:04,500 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3918740365558247 [2022-11-23 03:31:04,501 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3559 transitions. [2022-11-23 03:31:04,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3559 transitions. [2022-11-23 03:31:04,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:31:04,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3559 transitions. [2022-11-23 03:31:04,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 187.31578947368422) internal successors, (3559), 19 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:04,528 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-23 03:31:04,532 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-23 03:31:04,533 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 758 flow. Second operand 19 states and 3559 transitions. [2022-11-23 03:31:04,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 264 transitions, 1803 flow [2022-11-23 03:31:04,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 264 transitions, 1763 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-11-23 03:31:04,559 INFO L231 Difference]: Finished difference. Result has 145 places, 162 transitions, 1352 flow [2022-11-23 03:31:04,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1352, PETRI_PLACES=145, PETRI_TRANSITIONS=162} [2022-11-23 03:31:04,560 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 86 predicate places. [2022-11-23 03:31:04,561 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 162 transitions, 1352 flow [2022-11-23 03:31:04,564 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-23 03:31:04,564 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:31:04,564 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:04,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:04,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 03:31:04,773 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:31:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash -397295570, now seen corresponding path program 1 times [2022-11-23 03:31:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:04,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728342147] [2022-11-23 03:31:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:07,188 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-23 03:31:07,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:07,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728342147] [2022-11-23 03:31:07,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728342147] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:07,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550209429] [2022-11-23 03:31:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:07,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:07,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:07,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:31:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:07,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 03:31:07,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:07,375 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:31:07,376 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-23 03:31:07,389 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 03:31:07,389 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-23 03:31:07,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2022-11-23 03:31:07,589 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-23 03:31:07,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:07,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 03:31:07,760 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-23 03:31:07,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:07,816 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-23 03:31:07,960 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-23 03:31:07,960 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-23 03:31:08,063 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-23 03:31:08,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:31:08,709 INFO L321 Elim1Store]: treesize reduction 36, result has 59.6 percent of original size [2022-11-23 03:31:08,710 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 3 case distinctions, treesize of input 87 treesize of output 74 [2022-11-23 03:31:08,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:31:08,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 86 treesize of output 104 [2022-11-23 03:31:08,751 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-23 03:31:08,828 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-23 03:31:08,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:31:08,841 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 53 treesize of output 53 [2022-11-23 03:31:09,050 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-23 03:31:09,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550209429] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:31:09,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:31:09,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-23 03:31:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490129412] [2022-11-23 03:31:09,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:31:09,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 03:31:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 03:31:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=605, Unknown=19, NotChecked=0, Total=756 [2022-11-23 03:31:12,062 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-23 03:31:12,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 162 transitions, 1352 flow. Second operand has 28 states, 28 states have (on average 183.82142857142858) internal successors, (5147), 28 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:12,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:31:12,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-23 03:31:12,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:31:16,713 INFO L130 PetriNetUnfolder]: 3084/6028 cut-off events. [2022-11-23 03:31:16,713 INFO L131 PetriNetUnfolder]: For 19525/19534 co-relation queries the response was YES. [2022-11-23 03:31:16,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24324 conditions, 6028 events. 3084/6028 cut-off events. For 19525/19534 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 42778 event pairs, 1046 based on Foata normal form. 18/5294 useless extension candidates. Maximal degree in co-relation 23870. Up to 2743 conditions per place. [2022-11-23 03:31:16,756 INFO L137 encePairwiseOnDemand]: 467/478 looper letters, 191 selfloop transitions, 39 changer transitions 0/235 dead transitions. [2022-11-23 03:31:16,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 235 transitions, 2286 flow [2022-11-23 03:31:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:31:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-23 03:31:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2503 transitions. [2022-11-23 03:31:16,762 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40280012874155136 [2022-11-23 03:31:16,763 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2503 transitions. [2022-11-23 03:31:16,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2503 transitions. [2022-11-23 03:31:16,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:31:16,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2503 transitions. [2022-11-23 03:31:16,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 192.53846153846155) internal successors, (2503), 13 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:16,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 478.0) internal successors, (6692), 14 states have internal predecessors, (6692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:16,779 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 478.0) internal successors, (6692), 14 states have internal predecessors, (6692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:16,779 INFO L175 Difference]: Start difference. First operand has 145 places, 162 transitions, 1352 flow. Second operand 13 states and 2503 transitions. [2022-11-23 03:31:16,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 235 transitions, 2286 flow [2022-11-23 03:31:16,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 235 transitions, 2118 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-11-23 03:31:16,837 INFO L231 Difference]: Finished difference. Result has 150 places, 167 transitions, 1326 flow [2022-11-23 03:31:16,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1326, PETRI_PLACES=150, PETRI_TRANSITIONS=167} [2022-11-23 03:31:16,838 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 91 predicate places. [2022-11-23 03:31:16,838 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 167 transitions, 1326 flow [2022-11-23 03:31:16,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 183.82142857142858) internal successors, (5147), 28 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:16,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:31:16,840 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:16,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:17,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:17,046 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:31:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1948192109, now seen corresponding path program 1 times [2022-11-23 03:31:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:17,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908808642] [2022-11-23 03:31:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:17,932 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-23 03:31:17,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908808642] [2022-11-23 03:31:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908808642] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636992181] [2022-11-23 03:31:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:17,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:17,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:17,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:31:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:18,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-23 03:31:18,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:18,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:18,134 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:31:18,135 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-23 03:31:18,155 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:31:18,156 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-23 03:31:18,291 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-23 03:31:18,377 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-23 03:31:18,579 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-23 03:31:18,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:31:18,659 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-23 03:31:18,871 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-23 03:31:19,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-23 03:31:19,181 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 59 treesize of output 54 [2022-11-23 03:31:19,370 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-23 03:31:19,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:31:19,409 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-23 03:31:19,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2022-11-23 03:31:19,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_822)) |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (<= v_ArrVal_822 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse2))))))) is different from false [2022-11-23 03:31:20,411 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_820 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_820) .cse4 v_ArrVal_822)) |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_822)))))) is different from false [2022-11-23 03:31:20,461 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int) (v_ArrVal_820 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_819)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_820) .cse1 v_ArrVal_822)) |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_822) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2022-11-23 03:31:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-23 03:31:24,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636992181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:31:24,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:31:24,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-11-23 03:31:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194163792] [2022-11-23 03:31:24,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:31:24,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 03:31:24,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 03:31:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=508, Unknown=12, NotChecked=260, Total=930 [2022-11-23 03:31:24,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-23 03:31:24,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 167 transitions, 1326 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-23 03:31:24,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:31:24,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-23 03:31:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:31:49,669 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 131 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:31:56,918 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 127 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:32:05,378 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 104 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:32:05,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_824 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_824))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse1) 2147483647))))) (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse3 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse1) 2147483647)))))) is different from false [2022-11-23 03:32:06,267 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int)) (< (select (select (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_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_95| 4) |c_~#queue~0.offset|) v_ArrVal_825)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_827) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2022-11-23 03:32:08,395 INFO L130 PetriNetUnfolder]: 4717/9186 cut-off events. [2022-11-23 03:32:08,395 INFO L131 PetriNetUnfolder]: For 28775/28784 co-relation queries the response was YES. [2022-11-23 03:32:08,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37277 conditions, 9186 events. 4717/9186 cut-off events. For 28775/28784 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 68176 event pairs, 1416 based on Foata normal form. 165/8275 useless extension candidates. Maximal degree in co-relation 33496. Up to 4313 conditions per place. [2022-11-23 03:32:08,461 INFO L137 encePairwiseOnDemand]: 457/478 looper letters, 238 selfloop transitions, 146 changer transitions 0/389 dead transitions. [2022-11-23 03:32:08,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 389 transitions, 3958 flow [2022-11-23 03:32:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 03:32:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-23 03:32:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4634 transitions. [2022-11-23 03:32:08,470 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4039400278940028 [2022-11-23 03:32:08,470 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4634 transitions. [2022-11-23 03:32:08,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4634 transitions. [2022-11-23 03:32:08,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:32:08,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4634 transitions. [2022-11-23 03:32:08,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 193.08333333333334) internal successors, (4634), 24 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:08,499 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-23 03:32:08,501 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-23 03:32:08,502 INFO L175 Difference]: Start difference. First operand has 150 places, 167 transitions, 1326 flow. Second operand 24 states and 4634 transitions. [2022-11-23 03:32:08,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 389 transitions, 3958 flow [2022-11-23 03:32:08,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 389 transitions, 3884 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-11-23 03:32:08,559 INFO L231 Difference]: Finished difference. Result has 179 places, 269 transitions, 2936 flow [2022-11-23 03:32:08,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2936, PETRI_PLACES=179, PETRI_TRANSITIONS=269} [2022-11-23 03:32:08,560 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 120 predicate places. [2022-11-23 03:32:08,561 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 269 transitions, 2936 flow [2022-11-23 03:32:08,562 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-23 03:32:08,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:32:08,562 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:08,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:08,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 03:32:08,774 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:32:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1948192069, now seen corresponding path program 1 times [2022-11-23 03:32:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:08,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821477752] [2022-11-23 03:32:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:09,839 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-23 03:32:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:09,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821477752] [2022-11-23 03:32:09,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821477752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:09,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204997265] [2022-11-23 03:32:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:09,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:09,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:32:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:10,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 03:32:10,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:10,049 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:32:10,049 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-23 03:32:10,367 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 43 treesize of output 21 [2022-11-23 03:32:10,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:32:10,436 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 28 [2022-11-23 03:32:10,582 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 03:32:10,583 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 33 [2022-11-23 03:32:10,662 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 28 [2022-11-23 03:32:10,718 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 28 [2022-11-23 03:32:10,738 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-23 03:32:10,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:32:10,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_919) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483650))) is different from false [2022-11-23 03:32:10,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 Int) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (< 0 (+ (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_916))) (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_917)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_919) |c_~#queue~0.base|) .cse2)) 2147483650))) is different from false [2022-11-23 03:32:10,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 Int) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_916))) (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_917)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_919) |c_~#queue~0.base|) .cse2))))) is different from false [2022-11-23 03:32:11,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:32:11,061 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 63 [2022-11-23 03:32:11,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:32:11,074 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 113 treesize of output 113 [2022-11-23 03:32:11,085 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 88 treesize of output 80 [2022-11-23 03:32:11,093 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 55 treesize of output 43 [2022-11-23 03:32:11,106 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 18 treesize of output 10 [2022-11-23 03:32:11,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:32:11,149 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 79 treesize of output 67 [2022-11-23 03:32:11,351 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-23 03:32:11,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204997265] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:32:11,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:32:11,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-23 03:32:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618398434] [2022-11-23 03:32:11,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:32:11,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 03:32:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:11,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 03:32:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=537, Unknown=9, NotChecked=150, Total=812 [2022-11-23 03:32:11,525 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 478 [2022-11-23 03:32:11,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 269 transitions, 2936 flow. Second operand has 29 states, 29 states have (on average 184.06896551724137) internal successors, (5338), 29 states have internal predecessors, (5338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:11,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:32:11,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 478 [2022-11-23 03:32:11,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:32:17,758 INFO L130 PetriNetUnfolder]: 6408/12576 cut-off events. [2022-11-23 03:32:17,758 INFO L131 PetriNetUnfolder]: For 315031/315035 co-relation queries the response was YES. [2022-11-23 03:32:17,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90631 conditions, 12576 events. 6408/12576 cut-off events. For 315031/315035 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 93532 event pairs, 2040 based on Foata normal form. 249/11515 useless extension candidates. Maximal degree in co-relation 85191. Up to 4288 conditions per place. [2022-11-23 03:32:17,885 INFO L137 encePairwiseOnDemand]: 459/478 looper letters, 372 selfloop transitions, 135 changer transitions 0/512 dead transitions. [2022-11-23 03:32:17,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 512 transitions, 8114 flow [2022-11-23 03:32:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:32:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-23 03:32:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4851 transitions. [2022-11-23 03:32:17,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4059414225941423 [2022-11-23 03:32:17,893 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4851 transitions. [2022-11-23 03:32:17,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4851 transitions. [2022-11-23 03:32:17,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:32:17,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4851 transitions. [2022-11-23 03:32:17,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 194.04) internal successors, (4851), 25 states have internal predecessors, (4851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:17,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 478.0) internal successors, (12428), 26 states have internal predecessors, (12428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:17,915 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 478.0) internal successors, (12428), 26 states have internal predecessors, (12428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:17,915 INFO L175 Difference]: Start difference. First operand has 179 places, 269 transitions, 2936 flow. Second operand 25 states and 4851 transitions. [2022-11-23 03:32:17,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 512 transitions, 8114 flow [2022-11-23 03:32:18,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 512 transitions, 7625 flow, removed 232 selfloop flow, removed 5 redundant places. [2022-11-23 03:32:18,147 INFO L231 Difference]: Finished difference. Result has 205 places, 319 transitions, 3794 flow [2022-11-23 03:32:18,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3794, PETRI_PLACES=205, PETRI_TRANSITIONS=319} [2022-11-23 03:32:18,148 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 146 predicate places. [2022-11-23 03:32:18,148 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 319 transitions, 3794 flow [2022-11-23 03:32:18,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 184.06896551724137) internal successors, (5338), 29 states have internal predecessors, (5338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:18,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:32:18,150 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:18,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 03:32:18,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 03:32:18,355 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:32:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:18,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1632641953, now seen corresponding path program 1 times [2022-11-23 03:32:18,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:18,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524104150] [2022-11-23 03:32:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:18,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:18,432 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-23 03:32:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:18,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524104150] [2022-11-23 03:32:18,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524104150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:18,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:32:18,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:32:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442330914] [2022-11-23 03:32:18,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:18,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:32:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:32:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:32:18,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-23 03:32:18,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 319 transitions, 3794 flow. Second operand has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:18,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:32:18,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-23 03:32:18,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:32:21,437 INFO L130 PetriNetUnfolder]: 6418/12470 cut-off events. [2022-11-23 03:32:21,437 INFO L131 PetriNetUnfolder]: For 501882/501882 co-relation queries the response was YES. [2022-11-23 03:32:21,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106121 conditions, 12470 events. 6418/12470 cut-off events. For 501882/501882 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 92158 event pairs, 3506 based on Foata normal form. 172/11150 useless extension candidates. Maximal degree in co-relation 101566. Up to 7087 conditions per place. [2022-11-23 03:32:21,555 INFO L137 encePairwiseOnDemand]: 472/478 looper letters, 295 selfloop transitions, 33 changer transitions 0/332 dead transitions. [2022-11-23 03:32:21,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 332 transitions, 4870 flow [2022-11-23 03:32:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:32:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:32:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 988 transitions. [2022-11-23 03:32:21,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5167364016736402 [2022-11-23 03:32:21,558 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 988 transitions. [2022-11-23 03:32:21,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 988 transitions. [2022-11-23 03:32:21,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:32:21,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 988 transitions. [2022-11-23 03:32:21,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:21,562 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-23 03:32:21,562 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-23 03:32:21,563 INFO L175 Difference]: Start difference. First operand has 205 places, 319 transitions, 3794 flow. Second operand 4 states and 988 transitions. [2022-11-23 03:32:21,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 332 transitions, 4870 flow [2022-11-23 03:32:21,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 332 transitions, 4079 flow, removed 339 selfloop flow, removed 11 redundant places. [2022-11-23 03:32:21,783 INFO L231 Difference]: Finished difference. Result has 196 places, 317 transitions, 3055 flow [2022-11-23 03:32:21,784 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3055, PETRI_PLACES=196, PETRI_TRANSITIONS=317} [2022-11-23 03:32:21,784 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 137 predicate places. [2022-11-23 03:32:21,784 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 317 transitions, 3055 flow [2022-11-23 03:32:21,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:21,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:32:21,784 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:21,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 03:32:21,785 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:32:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2130876182, now seen corresponding path program 1 times [2022-11-23 03:32:21,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:21,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177865086] [2022-11-23 03:32:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:21,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:21,881 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-23 03:32:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177865086] [2022-11-23 03:32:21,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177865086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856340471] [2022-11-23 03:32:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:21,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:21,887 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:21,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:32:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:22,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:32:22,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:22,133 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-23 03:32:22,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:32:22,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856340471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:22,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:32:22,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 03:32:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512842155] [2022-11-23 03:32:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:22,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:32:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:22,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:32:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:32:22,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 478 [2022-11-23 03:32:22,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 317 transitions, 3055 flow. Second operand has 6 states, 6 states have (on average 235.66666666666666) internal successors, (1414), 6 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:22,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:32:22,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 478 [2022-11-23 03:32:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:32:24,932 INFO L130 PetriNetUnfolder]: 6208/12072 cut-off events. [2022-11-23 03:32:24,933 INFO L131 PetriNetUnfolder]: For 477818/477818 co-relation queries the response was YES. [2022-11-23 03:32:24,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99350 conditions, 12072 events. 6208/12072 cut-off events. For 477818/477818 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 88413 event pairs, 3150 based on Foata normal form. 172/10962 useless extension candidates. Maximal degree in co-relation 95506. Up to 10348 conditions per place. [2022-11-23 03:32:25,066 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 322 selfloop transitions, 14 changer transitions 0/340 dead transitions. [2022-11-23 03:32:25,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 340 transitions, 4528 flow [2022-11-23 03:32:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:32:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:32:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1475 transitions. [2022-11-23 03:32:25,071 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5142956764295676 [2022-11-23 03:32:25,071 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1475 transitions. [2022-11-23 03:32:25,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1475 transitions. [2022-11-23 03:32:25,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:32:25,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1475 transitions. [2022-11-23 03:32:25,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:25,078 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-23 03:32:25,079 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-23 03:32:25,079 INFO L175 Difference]: Start difference. First operand has 196 places, 317 transitions, 3055 flow. Second operand 6 states and 1475 transitions. [2022-11-23 03:32:25,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 340 transitions, 4528 flow [2022-11-23 03:32:25,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 340 transitions, 4428 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-11-23 03:32:25,282 INFO L231 Difference]: Finished difference. Result has 198 places, 316 transitions, 3021 flow [2022-11-23 03:32:25,283 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2993, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3021, PETRI_PLACES=198, PETRI_TRANSITIONS=316} [2022-11-23 03:32:25,283 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 139 predicate places. [2022-11-23 03:32:25,283 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 316 transitions, 3021 flow [2022-11-23 03:32:25,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.66666666666666) internal successors, (1414), 6 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:25,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:32:25,284 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-23 03:32:25,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:25,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:25,486 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:32:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1016720084, now seen corresponding path program 1 times [2022-11-23 03:32:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:25,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127488068] [2022-11-23 03:32:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:32:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:25,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127488068] [2022-11-23 03:32:25,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127488068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:25,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:32:25,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:32:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624525958] [2022-11-23 03:32:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:25,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:32:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:32:25,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:32:25,601 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 478 [2022-11-23 03:32:25,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 316 transitions, 3021 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:25,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:32:25,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 478 [2022-11-23 03:32:25,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:32:27,601 INFO L130 PetriNetUnfolder]: 4415/8981 cut-off events. [2022-11-23 03:32:27,601 INFO L131 PetriNetUnfolder]: For 322940/322940 co-relation queries the response was YES. [2022-11-23 03:32:27,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61403 conditions, 8981 events. 4415/8981 cut-off events. For 322940/322940 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 62079 event pairs, 508 based on Foata normal form. 516/8685 useless extension candidates. Maximal degree in co-relation 60654. Up to 7957 conditions per place. [2022-11-23 03:32:27,662 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 275 selfloop transitions, 5 changer transitions 0/282 dead transitions. [2022-11-23 03:32:27,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 282 transitions, 3464 flow [2022-11-23 03:32:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:32:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:32:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2022-11-23 03:32:27,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5320781032078103 [2022-11-23 03:32:27,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 763 transitions. [2022-11-23 03:32:27,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 763 transitions. [2022-11-23 03:32:27,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:32:27,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 763 transitions. [2022-11-23 03:32:27,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:27,668 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-23 03:32:27,669 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-23 03:32:27,669 INFO L175 Difference]: Start difference. First operand has 198 places, 316 transitions, 3021 flow. Second operand 3 states and 763 transitions. [2022-11-23 03:32:27,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 282 transitions, 3464 flow [2022-11-23 03:32:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 282 transitions, 3439 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-23 03:32:27,757 INFO L231 Difference]: Finished difference. Result has 195 places, 272 transitions, 2737 flow [2022-11-23 03:32:27,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2727, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2737, PETRI_PLACES=195, PETRI_TRANSITIONS=272} [2022-11-23 03:32:27,758 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 136 predicate places. [2022-11-23 03:32:27,758 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 272 transitions, 2737 flow [2022-11-23 03:32:27,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:27,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:32:27,759 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, 1] [2022-11-23 03:32:27,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 03:32:27,759 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:32:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1329132328, now seen corresponding path program 1 times [2022-11-23 03:32:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:27,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545077490] [2022-11-23 03:32:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:27,831 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-23 03:32:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545077490] [2022-11-23 03:32:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545077490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824424122] [2022-11-23 03:32:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:27,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:27,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:27,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:32:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:28,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:32:28,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:28,070 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-23 03:32:28,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:32:28,107 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-23 03:32:28,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824424122] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:32:28,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:32:28,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-23 03:32:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174475998] [2022-11-23 03:32:28,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:32:28,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:32:28,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:32:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:32:28,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 478 [2022-11-23 03:32:28,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 272 transitions, 2737 flow. Second operand has 10 states, 10 states have (on average 235.4) internal successors, (2354), 10 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:28,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:32:28,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 478 [2022-11-23 03:32:28,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:32:29,746 INFO L130 PetriNetUnfolder]: 2852/5953 cut-off events. [2022-11-23 03:32:29,746 INFO L131 PetriNetUnfolder]: For 196439/196473 co-relation queries the response was YES. [2022-11-23 03:32:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42747 conditions, 5953 events. 2852/5953 cut-off events. For 196439/196473 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 37164 event pairs, 1921 based on Foata normal form. 50/5513 useless extension candidates. Maximal degree in co-relation 41999. Up to 4002 conditions per place. [2022-11-23 03:32:29,802 INFO L137 encePairwiseOnDemand]: 473/478 looper letters, 262 selfloop transitions, 21 changer transitions 0/287 dead transitions. [2022-11-23 03:32:29,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 287 transitions, 3796 flow [2022-11-23 03:32:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:32:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:32:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1707 transitions. [2022-11-23 03:32:29,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5101613867304244 [2022-11-23 03:32:29,806 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1707 transitions. [2022-11-23 03:32:29,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1707 transitions. [2022-11-23 03:32:29,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:32:29,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1707 transitions. [2022-11-23 03:32:29,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 243.85714285714286) internal successors, (1707), 7 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:29,812 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-23 03:32:29,812 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-23 03:32:29,813 INFO L175 Difference]: Start difference. First operand has 195 places, 272 transitions, 2737 flow. Second operand 7 states and 1707 transitions. [2022-11-23 03:32:29,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 287 transitions, 3796 flow [2022-11-23 03:32:29,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 287 transitions, 3757 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-23 03:32:29,875 INFO L231 Difference]: Finished difference. Result has 202 places, 267 transitions, 2680 flow [2022-11-23 03:32:29,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2680, PETRI_PLACES=202, PETRI_TRANSITIONS=267} [2022-11-23 03:32:29,876 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 143 predicate places. [2022-11-23 03:32:29,876 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 267 transitions, 2680 flow [2022-11-23 03:32:29,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 235.4) internal successors, (2354), 10 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:32:29,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:32:29,877 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:29,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:30,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:30,078 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:32:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1850743264, now seen corresponding path program 2 times [2022-11-23 03:32:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:30,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020329620] [2022-11-23 03:32:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:32:32,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:32,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020329620] [2022-11-23 03:32:32,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020329620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:32,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679660547] [2022-11-23 03:32:32,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:32:32,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:32,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:32,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:32,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 03:32:32,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:32:32,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:32:32,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-23 03:32:32,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:32,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:32:32,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:32:32,471 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:32:32,471 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-23 03:32:32,494 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:32:32,495 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-23 03:32:32,690 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-23 03:32:32,892 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-23 03:32:33,163 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-23 03:32:33,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:32:33,280 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-23 03:32:33,494 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-23 03:32:33,869 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 70 treesize of output 63 [2022-11-23 03:32:34,463 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 75 treesize of output 68 [2022-11-23 03:32:34,727 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 62 treesize of output 64 [2022-11-23 03:32:35,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:32:35,467 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 62 treesize of output 64 [2022-11-23 03:32:36,376 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 80 treesize of output 73 [2022-11-23 03:32:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:32:39,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:32:39,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-23 03:32:39,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-23 03:32:45,085 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 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_1291)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1293) .cse2 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1294) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1293))))) is different from false [2022-11-23 03:32:55,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1293) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1294) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647))))))) is different from false [2022-11-23 03:32:55,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1294) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse3 .cse1))) (not (<= v_ArrVal_1287 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse4 .cse1))))))))) is different from false [2022-11-23 03:32:56,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1294) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse3 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1287) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse6 .cse1)))))))))) is different from false [2022-11-23 03:32:56,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1285) .cse6 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1293) .cse3 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse0 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1294) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1293) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1287) (not (<= v_ArrVal_1285 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-23 03:32:56,224 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1285) .cse6 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1293) .cse3 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse0 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1294) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1293) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1287) (< (+ 1 (select .cse5 .cse7)) v_ArrVal_1285)))))))) is different from false [2022-11-23 03:32:56,312 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int) (v_ArrVal_1293 Int) (v_ArrVal_1284 Int) (v_ArrVal_1294 Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1284)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse6 v_ArrVal_1285) .cse3 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1287) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1293) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1294) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1285) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse7 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse5) 2147483647)))))))) is different from false [2022-11-23 03:33:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-23 03:33:11,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679660547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:33:11,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:33:11,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-11-23 03:33:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429923970] [2022-11-23 03:33:11,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:33:11,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-23 03:33:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:33:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-23 03:33:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1479, Unknown=37, NotChecked=846, Total=2862 [2022-11-23 03:33:11,989 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-23 03:33:11,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 267 transitions, 2680 flow. Second operand has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:33:11,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:33:11,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-23 03:33:11,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:33:22,788 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 110 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:33:33,427 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] [2022-11-23 03:33:36,150 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] [2022-11-23 03:33:40,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 [0] [2022-11-23 03:33:45,013 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] [2022-11-23 03:33:49,475 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] [2022-11-23 03:33:56,416 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] [2022-11-23 03:33:58,858 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] [2022-11-23 03:34:00,968 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] [2022-11-23 03:34:03,100 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] [2022-11-23 03:34:05,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:34:09,969 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] [2022-11-23 03:34:21,842 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] [2022-11-23 03:34:44,012 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] [2022-11-23 03:34:57,720 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] [2022-11-23 03:34:59,782 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-23 03:35:01,819 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-23 03:35:03,827 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-23 03:35:05,844 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-23 03:35:05,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse4 .cse5) 1)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1294) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse1 .cse3)))))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse7 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1293) .cse3 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse3) 1) v_ArrVal_1294) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse7 .cse3))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (< .cse0 v_ArrVal_1287) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse8 .cse3)))))))))))) is different from false [2022-11-23 03:35:07,882 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-23 03:35:21,758 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-23 03:35:23,773 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-23 03:35:25,800 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] [2022-11-23 03:35:28,002 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-23 03:35:30,054 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-23 03:35:30,110 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1287)) |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse3 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1294) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1293) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse3 .cse1))) (not (<= v_ArrVal_1287 .cse4)) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse5 .cse1))))))))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1294 .cse4)) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse9 .cse1)))))))) is different from false [2022-11-23 03:35:32,262 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-23 03:35:33,029 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1289))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1291))) (let ((.cse2 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1293) .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1293) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1294) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647))))))) (forall ((v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse6 .cse1)))))))) is different from false [2022-11-23 03:35:35,310 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-23 03:35:35,323 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1294) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse2 .cse4)))))) (forall ((v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1294 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse5 .cse4)))))))) is different from false [2022-11-23 03:35:37,460 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-23 03:35:39,482 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-23 03:35:41,490 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-23 03:35:43,499 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-23 03:35:45,509 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-23 03:35:47,720 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-23 03:35:49,727 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-23 03:35:51,733 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-23 03:35:53,740 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-23 03:35:55,885 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-23 03:35:57,904 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-23 03:35:59,918 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-23 03:36:02,095 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-23 03:36:04,121 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-23 03:36:06,132 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-23 03:36:08,722 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-23 03:36:10,992 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-23 03:36:13,978 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-23 03:36:16,214 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-23 03:36:18,221 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-23 03:36:20,226 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-23 03:36:22,243 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-23 03:36:24,261 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-23 03:36:26,271 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-23 03:36:28,279 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-23 03:36:31,252 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-23 03:36:33,262 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-23 03:36:52,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse4 .cse6) 1)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1293) .cse6 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1294) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse1 .cse3))) (not (<= v_ArrVal_1293 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))) (forall ((v_ArrVal_1293 Int) (v_ArrVal_1294 Int) (v_ArrVal_1298 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1296 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1293) .cse6 v_ArrVal_1294)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1296) |c_~#stored_elements~0.base| v_ArrVal_1297) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse4 .cse5)) v_ArrVal_1293) (< .cse0 v_ArrVal_1294) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1298) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_106| (select .cse7 .cse3))))))))) is different from false [2022-11-23 03:36:54,423 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-23 03:36:56,867 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-23 03:36:58,881 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-23 03:37:00,889 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-23 03:37:02,894 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-23 03:37:06,868 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-23 03:37:10,418 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-23 03:37:12,478 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-23 03:37:14,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:37:16,568 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-23 03:37:19,171 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-23 03:37:21,186 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-23 03:37:23,589 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-23 03:37:25,597 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-23 03:37:27,787 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-23 03:37:29,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:37:32,103 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-23 03:37:34,110 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-23 03:37:36,652 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-23 03:37:38,800 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-23 03:37:41,099 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-23 03:37:43,793 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-23 03:37:45,808 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-23 03:37:47,814 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-23 03:37:50,245 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-23 03:37:52,801 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-23 03:37:53,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:37:55,825 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-23 03:37:58,477 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-23 03:38:00,630 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-23 03:38:02,637 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-23 03:38:04,809 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-23 03:38:07,000 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-23 03:38:09,032 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-23 03:38:11,038 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-23 03:38:13,256 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-23 03:38:16,181 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-23 03:38:18,486 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-23 03:38:20,592 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-23 03:38:22,948 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-23 03:38:25,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-23 03:38:27,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:38:29,197 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-23 03:38:31,439 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-23 03:38:33,779 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-23 03:38:35,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:38:37,317 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-23 03:38:39,701 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-23 03:38:42,009 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-23 03:38:44,334 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-23 03:38:46,403 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-23 03:38:48,920 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-23 03:38:51,155 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-23 03:38:53,164 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-23 03:38:55,170 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-23 03:38:57,194 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-23 03:38:59,202 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-23 03:39:01,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-23 03:39:03,560 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-23 03:39:05,732 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-23 03:39:07,748 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-23 03:39:09,752 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-23 03:39:11,793 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-23 03:39:14,338 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-23 03:39:16,601 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-23 03:39:19,061 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-23 03:39:21,410 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-23 03:39:23,631 INFO L130 PetriNetUnfolder]: 3620/7644 cut-off events. [2022-11-23 03:39:23,631 INFO L131 PetriNetUnfolder]: For 244758/244792 co-relation queries the response was YES. [2022-11-23 03:39:23,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55526 conditions, 7644 events. 3620/7644 cut-off events. For 244758/244792 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 50724 event pairs, 1887 based on Foata normal form. 26/7072 useless extension candidates. Maximal degree in co-relation 54776. Up to 5128 conditions per place. [2022-11-23 03:39:23,708 INFO L137 encePairwiseOnDemand]: 461/478 looper letters, 344 selfloop transitions, 219 changer transitions 5/572 dead transitions. [2022-11-23 03:39:23,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 572 transitions, 9727 flow [2022-11-23 03:39:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-23 03:39:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-11-23 03:39:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8938 transitions. [2022-11-23 03:39:23,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3816070361198873 [2022-11-23 03:39:23,727 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 8938 transitions. [2022-11-23 03:39:23,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 8938 transitions. [2022-11-23 03:39:23,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:39:23,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8938 transitions. [2022-11-23 03:39:23,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 182.40816326530611) internal successors, (8938), 49 states have internal predecessors, (8938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:39:23,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 478.0) internal successors, (23900), 50 states have internal predecessors, (23900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:39:23,781 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 478.0) internal successors, (23900), 50 states have internal predecessors, (23900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:39:23,781 INFO L175 Difference]: Start difference. First operand has 202 places, 267 transitions, 2680 flow. Second operand 49 states and 8938 transitions. [2022-11-23 03:39:23,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 572 transitions, 9727 flow [2022-11-23 03:39:23,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 572 transitions, 9702 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-23 03:39:23,901 INFO L231 Difference]: Finished difference. Result has 275 places, 418 transitions, 5921 flow [2022-11-23 03:39:23,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2668, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5921, PETRI_PLACES=275, PETRI_TRANSITIONS=418} [2022-11-23 03:39:23,902 INFO L288 CegarLoopForPetriNet]: 59 programPoint places, 216 predicate places. [2022-11-23 03:39:23,902 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 418 transitions, 5921 flow [2022-11-23 03:39:23,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:39:23,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:39:23,903 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 03:39:23,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:39:24,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 03:39:24,104 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-23 03:39:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:39:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1853171494, now seen corresponding path program 3 times [2022-11-23 03:39:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:39:24,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48810598] [2022-11-23 03:39:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:39:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:39:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:39:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:39:26,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:39:26,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48810598] [2022-11-23 03:39:26,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48810598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:39:26,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734333251] [2022-11-23 03:39:26,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:39:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:39:26,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:39:26,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:39:26,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd22a3-1ae2-4624-ad57-d33152f24018/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 03:39:26,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 03:39:26,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:39:26,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-23 03:39:26,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:39:26,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:39:26,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:39:26,801 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 03:39:26,801 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-23 03:39:26,824 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 03:39:26,824 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-23 03:39:27,079 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-23 03:39:27,360 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-23 03:39:27,700 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-23 03:39:27,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:39:27,862 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-23 03:39:28,115 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 60 treesize of output 53 [2022-11-23 03:39:28,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 107 treesize of output 100 [2022-11-23 03:39:30,579 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 75 treesize of output 68 [2022-11-23 03:39:30,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:39:30,929 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 62 treesize of output 64 [2022-11-23 03:39:32,132 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 80 treesize of output 73 [2022-11-23 03:39:36,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-23 03:39:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:39:43,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:39:43,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-23 03:39:43,499 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1419 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))))) is different from false [2022-11-23 03:39:43,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (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_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1417 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-23 03:39:43,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 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_1415)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse4 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1417)))))) is different from false [2022-11-23 03:39:52,198 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (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_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))))))))) is different from false [2022-11-23 03:39:52,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1413 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417))))))) is different from false [2022-11-23 03:39:55,727 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1410) .cse6 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_1415))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1417) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1413) (not (<= v_ArrVal_1410 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-23 03:39:58,894 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1408)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1410) .cse7 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse5) 4)) v_ArrVal_1415))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1417) .cse5 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1417) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1410) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse4 .cse5))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1419) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse1) 2147483647) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1413)))))))) is different from false [2022-11-23 03:40:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 03:40:13,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734333251] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:40:13,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:40:13,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-11-23 03:40:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194775958] [2022-11-23 03:40:13,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:40:13,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-23 03:40:13,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:40:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-23 03:40:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=1479, Unknown=75, NotChecked=760, Total=2862 [2022-11-23 03:40:14,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 478 [2022-11-23 03:40:14,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 418 transitions, 5921 flow. Second operand has 54 states, 54 states have (on average 177.44444444444446) internal successors, (9582), 54 states have internal predecessors, (9582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:40:14,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:40:14,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 478 [2022-11-23 03:40:14,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:40:22,284 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1408))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1410) .cse1 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1410) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1417) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1413) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647))))))))) (exists ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| Int) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1406 Int) (v_ArrVal_1417 Int)) (let ((.cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (store (store (store (store ((as const (Array Int Int)) 0) (+ 3200 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse12 0) .cse10 v_ArrVal_1406) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1408))) (let ((.cse9 (store (store (store .cse13 .cse10 v_ArrVal_1410) .cse12 v_ArrVal_1413) (+ (* v_ArrVal_1413 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1415))) (and (<= v_ArrVal_1406 0) (<= v_ArrVal_1417 (+ 1 (select .cse9 .cse10))) (= .cse11 (store (store (store .cse9 .cse10 v_ArrVal_1417) .cse12 v_ArrVal_1419) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1422)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| v_ArrVal_1419) (<= v_ArrVal_1413 (+ (select .cse13 .cse12) 1)) (<= v_ArrVal_1419 (+ (select .cse9 .cse12) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_110| 0) (<= v_ArrVal_1410 (+ (select .cse13 .cse10) 1))))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (or (< (+ (select .cse11 .cse12) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse14 .cse1))) (< (select (select (store (store .cse15 |c_~#queue~0.base| (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647))))))) is different from false [2022-11-23 03:40:26,756 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] [2022-11-23 03:40:28,767 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] [2022-11-23 03:40:31,178 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] [2022-11-23 03:40:33,185 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] [2022-11-23 03:40:35,491 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] [2022-11-23 03:40:37,528 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] [2022-11-23 03:40:40,082 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (select .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2) (forall ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1408))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1410) .cse2 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse1 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_1417) .cse2 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse4 .cse2))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1410) (< (+ (select .cse1 .cse6) 1) v_ArrVal_1417) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1413) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse6) 2147483647))))))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse10 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse10) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse11 .cse2))) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse6) 2147483647)))))))) is different from false [2022-11-23 03:40:40,231 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1408 Int) (v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1422 Int) (v_ArrVal_1410 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| 4)) v_ArrVal_1408))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1410) .cse1 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse0 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_115| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1410) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1417) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1413) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647))))))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (or (< (+ (select .cse9 .cse10) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse11 .cse1))) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647)))))))) is different from false [2022-11-23 03:40:42,401 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] [2022-11-23 03:40:44,418 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] [2022-11-23 03:41:16,396 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 2147483647)) (< (select .cse0 .cse1) 2147483647) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-11-23 03:41:18,506 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] [2022-11-23 03:41:20,521 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] [2022-11-23 03:41:38,904 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 146 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:41:41,561 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] [2022-11-23 03:41:43,622 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] [2022-11-23 03:41:45,686 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] [2022-11-23 03:41:47,699 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] [2022-11-23 03:41:55,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:41:58,302 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-23 03:42:00,307 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-23 03:42:01,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 03:42:03,362 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-23 03:42:05,513 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-23 03:42:07,518 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-23 03:42:07,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ (select .cse8 .cse9) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse0 (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (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_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< .cse5 v_ArrVal_1413) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417))))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (or (< .cse5 v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse10 .cse4))) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647)))))))) is different from false [2022-11-23 03:42:09,595 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] [2022-11-23 03:42:12,042 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] [2022-11-23 03:42:14,477 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= v_ArrVal_1419 .cse4)))))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse9 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1413 .cse4)) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse8 .cse1))) (< (+ (select .cse9 .cse3) 1) v_ArrVal_1417))))))))) is different from false [2022-11-23 03:42:17,521 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-23 03:42:17,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse0 (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1413 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1417))))))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1413 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1413)) |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_1417) .cse4 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse11 .cse4) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse10 .cse4))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1413) (< (+ (select .cse11 .cse2) 1) v_ArrVal_1417))))))))) is different from false [2022-11-23 03:42:17,941 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1414 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1414))) (let ((.cse6 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse3) 2147483647) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1419) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1417) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse5 .cse1))))))))))) is different from false [2022-11-23 03:42:34,317 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-23 03:42:36,323 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-23 03:42:38,329 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-23 03:42:40,781 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-23 03:42:42,879 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-23 03:42:44,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:42:46,027 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-23 03:42:48,039 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-23 03:42:50,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:42:52,149 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-23 03:42:54,155 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-23 03:42:56,162 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-23 03:42:58,168 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-23 03:43:00,176 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-23 03:43:02,184 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-23 03:43:04,190 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-23 03:43:06,197 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-23 03:43:08,203 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-23 03:43:10,210 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-23 03:43:12,499 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-23 03:43:14,571 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-23 03:43:16,578 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-23 03:43:18,953 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-23 03:43:19,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse13 (select .cse12 .cse3))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_1415)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1417)))))) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse6) 2147483647)) (< (select .cse7 .cse6) 2147483647) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse9 (store .cse12 (+ (* .cse13 4) |c_~#queue~0.offset|) v_ArrVal_1415))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (or (< (+ (select .cse9 .cse3) 1) v_ArrVal_1419) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse11 .cse3))) (< (+ (select .cse9 .cse5) 1) v_ArrVal_1417)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1422 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| .cse13))))))) is different from false [2022-11-23 03:43:21,433 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-23 03:43:23,856 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-23 03:43:26,028 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-23 03:43:28,059 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-23 03:43:30,065 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-23 03:43:32,071 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-23 03:43:34,078 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-23 03:43:36,087 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-23 03:43:38,092 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-23 03:43:40,098 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-23 03:43:42,104 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-23 03:43:44,109 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-23 03:43:46,147 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-23 03:43:48,153 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-23 03:43:50,159 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-23 03:43:52,165 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-23 03:43:54,197 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-23 03:43:56,208 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-23 03:43:58,216 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-23 03:43:58,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 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_1415)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1417) .cse1 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1417)))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1415 Int) (v_ArrVal_1417 Int)) (let ((.cse7 (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1415)))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (or (< (+ (select .cse7 .cse3) 1) v_ArrVal_1419) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse9 .cse3))) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1417)))))))) is different from false [2022-11-23 03:43:58,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_1417) .cse3 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (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_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (< (+ 1 (select .cse2 .cse4)) v_ArrVal_1417)))))) (forall ((v_ArrVal_1424 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4) 2147483647)))) is different from false [2022-11-23 03:44:00,391 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-23 03:44:02,397 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-23 03:44:04,404 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-23 03:44:06,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:44:08,408 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-23 03:44:10,453 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-23 03:44:10,493 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse5 .cse7) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1417) .cse7 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (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_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse3 v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse1 .cse4))) (< (+ 1 (select .cse5 .cse6)) v_ArrVal_1417))))) (forall ((v_ArrVal_1419 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1422 Int) (v_ArrVal_1417 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1417) .cse7 v_ArrVal_1419)) |c_~#stored_elements~0.base| v_ArrVal_1421))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse8 |c_~#queue~0.base| (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse3 v_ArrVal_1419) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse9 .cse4))) (not (<= v_ArrVal_1417 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-23 03:44:12,654 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-23 03:44:14,816 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-23 03:44:16,836 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-23 03:44:18,852 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-23 03:44:20,954 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-23 03:44:22,960 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]