/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 11:28:22,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 11:28:22,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 11:28:22,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 11:28:22,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 11:28:22,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 11:28:22,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 11:28:22,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 11:28:22,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 11:28:22,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 11:28:22,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 11:28:22,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 11:28:22,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 11:28:22,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 11:28:22,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 11:28:22,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 11:28:22,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 11:28:22,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 11:28:22,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 11:28:22,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 11:28:22,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 11:28:22,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 11:28:22,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 11:28:22,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 11:28:22,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 11:28:22,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 11:28:22,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 11:28:22,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 11:28:22,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 11:28:22,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 11:28:22,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 11:28:22,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 11:28:22,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 11:28:22,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 11:28:22,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 11:28:22,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 11:28:22,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 11:28:22,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 11:28:22,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 11:28:22,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 11:28:22,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 11:28:22,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-16 11:28:22,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 11:28:22,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 11:28:22,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 11:28:22,631 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 11:28:22,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 11:28:22,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 11:28:22,632 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 11:28:22,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 11:28:22,632 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 11:28:22,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 11:28:22,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 11:28:22,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 11:28:22,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 11:28:22,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 11:28:22,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 11:28:22,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 11:28:22,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:28:22,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 11:28:22,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 11:28:22,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 11:28:22,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 11:28:22,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 11:28:22,635 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 11:28:22,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-16 11:28:22,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 11:28:22,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 11:28:22,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 11:28:22,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 11:28:22,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 11:28:22,817 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 11:28:22,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-09-16 11:28:22,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae9529a4/8d5eb19b924e4be1a17b39a456502ea3/FLAG5edaffd3a [2022-09-16 11:28:23,329 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 11:28:23,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-09-16 11:28:23,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae9529a4/8d5eb19b924e4be1a17b39a456502ea3/FLAG5edaffd3a [2022-09-16 11:28:23,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae9529a4/8d5eb19b924e4be1a17b39a456502ea3 [2022-09-16 11:28:23,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 11:28:23,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 11:28:23,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 11:28:23,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 11:28:23,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 11:28:23,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab71d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23, skipping insertion in model container [2022-09-16 11:28:23,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 11:28:23,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 11:28:23,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-09-16 11:28:23,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-09-16 11:28:23,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:28:23,812 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 11:28:23,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-09-16 11:28:23,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-09-16 11:28:23,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:28:23,903 INFO L208 MainTranslator]: Completed translation [2022-09-16 11:28:23,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23 WrapperNode [2022-09-16 11:28:23,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 11:28:23,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 11:28:23,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 11:28:23,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 11:28:23,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,958 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-09-16 11:28:23,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 11:28:23,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 11:28:23,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 11:28:23,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 11:28:23,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 11:28:23,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 11:28:23,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 11:28:23,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 11:28:23,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (1/1) ... [2022-09-16 11:28:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:28:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:28:24,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-16 11:28:24,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-16 11:28:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-16 11:28:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-16 11:28:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-16 11:28:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-16 11:28:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 11:28:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 11:28:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 11:28:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 11:28:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-16 11:28:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 11:28:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 11:28:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 11:28:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 11:28:24,060 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 11:28:24,208 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 11:28:24,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 11:28:24,521 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 11:28:24,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 11:28:24,537 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-16 11:28:24,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:28:24 BoogieIcfgContainer [2022-09-16 11:28:24,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 11:28:24,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 11:28:24,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 11:28:24,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 11:28:24,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 11:28:23" (1/3) ... [2022-09-16 11:28:24,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2607b018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:28:24, skipping insertion in model container [2022-09-16 11:28:24,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:28:23" (2/3) ... [2022-09-16 11:28:24,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2607b018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:28:24, skipping insertion in model container [2022-09-16 11:28:24,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:28:24" (3/3) ... [2022-09-16 11:28:24,545 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-09-16 11:28:24,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 11:28:24,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-09-16 11:28:24,557 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 11:28:24,641 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-16 11:28:24,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 253 transitions, 522 flow [2022-09-16 11:28:24,774 INFO L130 PetriNetUnfolder]: 13/251 cut-off events. [2022-09-16 11:28:24,774 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-09-16 11:28:24,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 251 events. 13/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-09-16 11:28:24,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 253 transitions, 522 flow [2022-09-16 11:28:24,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 241 transitions, 491 flow [2022-09-16 11:28:24,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 11:28:24,810 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=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;@7b03324b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 11:28:24,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-09-16 11:28:24,844 INFO L130 PetriNetUnfolder]: 6/140 cut-off events. [2022-09-16 11:28:24,845 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-09-16 11:28:24,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:24,846 INFO L208 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:24,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash -731197578, now seen corresponding path program 1 times [2022-09-16 11:28:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:24,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161540917] [2022-09-16 11:28:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161540917] [2022-09-16 11:28:25,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161540917] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:25,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:25,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-16 11:28:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901172051] [2022-09-16 11:28:25,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:25,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:28:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:28:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:28:25,344 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 253 [2022-09-16 11:28:25,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 241 transitions, 491 flow. Second operand has 12 states, 12 states have (on average 190.5) internal successors, (2286), 12 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:25,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:25,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 253 [2022-09-16 11:28:25,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:26,021 INFO L130 PetriNetUnfolder]: 611/2942 cut-off events. [2022-09-16 11:28:26,021 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-09-16 11:28:26,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 2942 events. 611/2942 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 24642 event pairs, 459 based on Foata normal form. 118/2695 useless extension candidates. Maximal degree in co-relation 3504. Up to 882 conditions per place. [2022-09-16 11:28:26,042 INFO L137 encePairwiseOnDemand]: 236/253 looper letters, 42 selfloop transitions, 12 changer transitions 0/229 dead transitions. [2022-09-16 11:28:26,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 229 transitions, 575 flow [2022-09-16 11:28:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-16 11:28:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-16 11:28:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2503 transitions. [2022-09-16 11:28:26,060 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7610215871085436 [2022-09-16 11:28:26,061 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2503 transitions. [2022-09-16 11:28:26,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2503 transitions. [2022-09-16 11:28:26,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:26,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2503 transitions. [2022-09-16 11:28:26,073 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-09-16 11:28:26,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 253.0) internal successors, (3542), 14 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:26,086 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 253.0) internal successors, (3542), 14 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:26,087 INFO L175 Difference]: Start difference. First operand has 235 places, 241 transitions, 491 flow. Second operand 13 states and 2503 transitions. [2022-09-16 11:28:26,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 229 transitions, 575 flow [2022-09-16 11:28:26,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 229 transitions, 570 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-16 11:28:26,100 INFO L231 Difference]: Finished difference. Result has 237 places, 229 transitions, 486 flow [2022-09-16 11:28:26,101 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=486, PETRI_PLACES=237, PETRI_TRANSITIONS=229} [2022-09-16 11:28:26,104 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 2 predicate places. [2022-09-16 11:28:26,104 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 229 transitions, 486 flow [2022-09-16 11:28:26,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 190.5) internal successors, (2286), 12 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:26,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:26,106 INFO L208 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:26,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 11:28:26,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash 992572438, now seen corresponding path program 1 times [2022-09-16 11:28:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618838138] [2022-09-16 11:28:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618838138] [2022-09-16 11:28:33,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618838138] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:33,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 11:28:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025700776] [2022-09-16 11:28:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:33,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:28:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:33,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:28:33,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:28:33,495 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2022-09-16 11:28:33,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 229 transitions, 486 flow. Second operand has 18 states, 18 states have (on average 181.88888888888889) internal successors, (3274), 18 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:33,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:33,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2022-09-16 11:28:33,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:36,506 INFO L130 PetriNetUnfolder]: 1364/5590 cut-off events. [2022-09-16 11:28:36,507 INFO L131 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2022-09-16 11:28:36,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 5590 events. 1364/5590 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 51733 event pairs, 1005 based on Foata normal form. 1/4826 useless extension candidates. Maximal degree in co-relation 7678. Up to 1675 conditions per place. [2022-09-16 11:28:36,537 INFO L137 encePairwiseOnDemand]: 232/253 looper letters, 108 selfloop transitions, 27 changer transitions 0/301 dead transitions. [2022-09-16 11:28:36,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 301 transitions, 906 flow [2022-09-16 11:28:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:28:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-16 11:28:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3739 transitions. [2022-09-16 11:28:36,543 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7389328063241106 [2022-09-16 11:28:36,543 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3739 transitions. [2022-09-16 11:28:36,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3739 transitions. [2022-09-16 11:28:36,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:36,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3739 transitions. [2022-09-16 11:28:36,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 186.95) internal successors, (3739), 20 states have internal predecessors, (3739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:36,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:36,556 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:36,557 INFO L175 Difference]: Start difference. First operand has 237 places, 229 transitions, 486 flow. Second operand 20 states and 3739 transitions. [2022-09-16 11:28:36,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 301 transitions, 906 flow [2022-09-16 11:28:36,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 301 transitions, 883 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-09-16 11:28:36,564 INFO L231 Difference]: Finished difference. Result has 254 places, 250 transitions, 620 flow [2022-09-16 11:28:36,564 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=620, PETRI_PLACES=254, PETRI_TRANSITIONS=250} [2022-09-16 11:28:36,565 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 19 predicate places. [2022-09-16 11:28:36,565 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 250 transitions, 620 flow [2022-09-16 11:28:36,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 181.88888888888889) internal successors, (3274), 18 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:36,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:36,568 INFO L208 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:36,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 11:28:36,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2115220582, now seen corresponding path program 1 times [2022-09-16 11:28:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:36,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549637441] [2022-09-16 11:28:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:37,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549637441] [2022-09-16 11:28:37,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549637441] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:37,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:37,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 11:28:37,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635954560] [2022-09-16 11:28:37,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:37,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-09-16 11:28:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-09-16 11:28:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-09-16 11:28:37,148 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 253 [2022-09-16 11:28:37,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 250 transitions, 620 flow. Second operand has 20 states, 20 states have (on average 171.2) internal successors, (3424), 20 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:37,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:37,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 253 [2022-09-16 11:28:37,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:39,100 INFO L130 PetriNetUnfolder]: 2220/7785 cut-off events. [2022-09-16 11:28:39,101 INFO L131 PetriNetUnfolder]: For 892/899 co-relation queries the response was YES. [2022-09-16 11:28:39,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 7785 events. 2220/7785 cut-off events. For 892/899 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 73121 event pairs, 175 based on Foata normal form. 86/7091 useless extension candidates. Maximal degree in co-relation 12298. Up to 1746 conditions per place. [2022-09-16 11:28:39,142 INFO L137 encePairwiseOnDemand]: 231/253 looper letters, 210 selfloop transitions, 44 changer transitions 0/411 dead transitions. [2022-09-16 11:28:39,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 411 transitions, 1509 flow [2022-09-16 11:28:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 11:28:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-09-16 11:28:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3960 transitions. [2022-09-16 11:28:39,148 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7114624505928854 [2022-09-16 11:28:39,148 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3960 transitions. [2022-09-16 11:28:39,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3960 transitions. [2022-09-16 11:28:39,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:39,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3960 transitions. [2022-09-16 11:28:39,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 180.0) internal successors, (3960), 22 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 253.0) internal successors, (5819), 23 states have internal predecessors, (5819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,164 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 253.0) internal successors, (5819), 23 states have internal predecessors, (5819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,164 INFO L175 Difference]: Start difference. First operand has 254 places, 250 transitions, 620 flow. Second operand 22 states and 3960 transitions. [2022-09-16 11:28:39,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 411 transitions, 1509 flow [2022-09-16 11:28:39,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 411 transitions, 1496 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-09-16 11:28:39,175 INFO L231 Difference]: Finished difference. Result has 275 places, 279 transitions, 865 flow [2022-09-16 11:28:39,176 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=865, PETRI_PLACES=275, PETRI_TRANSITIONS=279} [2022-09-16 11:28:39,177 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 40 predicate places. [2022-09-16 11:28:39,178 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 279 transitions, 865 flow [2022-09-16 11:28:39,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 171.2) internal successors, (3424), 20 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:39,179 INFO L208 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 11:28:39,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1381084976, now seen corresponding path program 1 times [2022-09-16 11:28:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255441703] [2022-09-16 11:28:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:39,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255441703] [2022-09-16 11:28:39,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255441703] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:39,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:39,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-16 11:28:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913775715] [2022-09-16 11:28:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:39,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:28:39,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:28:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:28:39,218 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 253 [2022-09-16 11:28:39,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 279 transitions, 865 flow. Second operand has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:39,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 253 [2022-09-16 11:28:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:39,526 INFO L130 PetriNetUnfolder]: 220/3317 cut-off events. [2022-09-16 11:28:39,526 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-09-16 11:28:39,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4053 conditions, 3317 events. 220/3317 cut-off events. For 227/229 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 29858 event pairs, 15 based on Foata normal form. 0/2897 useless extension candidates. Maximal degree in co-relation 3961. Up to 224 conditions per place. [2022-09-16 11:28:39,546 INFO L137 encePairwiseOnDemand]: 248/253 looper letters, 15 selfloop transitions, 4 changer transitions 0/286 dead transitions. [2022-09-16 11:28:39,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 286 transitions, 919 flow [2022-09-16 11:28:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 11:28:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-16 11:28:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 952 transitions. [2022-09-16 11:28:39,549 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9407114624505929 [2022-09-16 11:28:39,549 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 952 transitions. [2022-09-16 11:28:39,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 952 transitions. [2022-09-16 11:28:39,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:39,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 952 transitions. [2022-09-16 11:28:39,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,553 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,553 INFO L175 Difference]: Start difference. First operand has 275 places, 279 transitions, 865 flow. Second operand 4 states and 952 transitions. [2022-09-16 11:28:39,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 286 transitions, 919 flow [2022-09-16 11:28:39,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 286 transitions, 886 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-09-16 11:28:39,560 INFO L231 Difference]: Finished difference. Result has 272 places, 282 transitions, 860 flow [2022-09-16 11:28:39,560 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=272, PETRI_TRANSITIONS=282} [2022-09-16 11:28:39,561 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 37 predicate places. [2022-09-16 11:28:39,562 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 282 transitions, 860 flow [2022-09-16 11:28:39,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:39,565 INFO L208 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:39,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 11:28:39,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1147024205, now seen corresponding path program 1 times [2022-09-16 11:28:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:39,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327574601] [2022-09-16 11:28:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327574601] [2022-09-16 11:28:39,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327574601] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:39,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:39,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:28:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027464307] [2022-09-16 11:28:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:39,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:28:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:28:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:28:39,602 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 253 [2022-09-16 11:28:39,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 282 transitions, 860 flow. Second operand has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:39,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:39,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 253 [2022-09-16 11:28:39,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:40,022 INFO L130 PetriNetUnfolder]: 372/4923 cut-off events. [2022-09-16 11:28:40,022 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-09-16 11:28:40,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6385 conditions, 4923 events. 372/4923 cut-off events. For 323/333 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 51804 event pairs, 31 based on Foata normal form. 0/4347 useless extension candidates. Maximal degree in co-relation 6298. Up to 486 conditions per place. [2022-09-16 11:28:40,055 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 21 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-09-16 11:28:40,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 292 transitions, 933 flow [2022-09-16 11:28:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:28:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 11:28:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1178 transitions. [2022-09-16 11:28:40,057 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9312252964426877 [2022-09-16 11:28:40,057 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1178 transitions. [2022-09-16 11:28:40,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1178 transitions. [2022-09-16 11:28:40,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:40,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1178 transitions. [2022-09-16 11:28:40,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.6) internal successors, (1178), 5 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:40,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:40,061 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:40,061 INFO L175 Difference]: Start difference. First operand has 272 places, 282 transitions, 860 flow. Second operand 5 states and 1178 transitions. [2022-09-16 11:28:40,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 292 transitions, 933 flow [2022-09-16 11:28:40,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 292 transitions, 931 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 11:28:40,068 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 890 flow [2022-09-16 11:28:40,069 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=890, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-09-16 11:28:40,069 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 43 predicate places. [2022-09-16 11:28:40,070 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 890 flow [2022-09-16 11:28:40,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:40,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:40,070 INFO L208 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 11:28:40,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:40,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash 96222015, now seen corresponding path program 1 times [2022-09-16 11:28:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:40,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111546443] [2022-09-16 11:28:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111546443] [2022-09-16 11:28:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111546443] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:41,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:41,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 11:28:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322598071] [2022-09-16 11:28:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:28:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:28:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:28:41,276 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2022-09-16 11:28:41,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 890 flow. Second operand has 18 states, 18 states have (on average 182.05555555555554) internal successors, (3277), 18 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:41,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:41,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2022-09-16 11:28:41,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:45,558 INFO L130 PetriNetUnfolder]: 6682/26257 cut-off events. [2022-09-16 11:28:45,558 INFO L131 PetriNetUnfolder]: For 4468/4535 co-relation queries the response was YES. [2022-09-16 11:28:45,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43975 conditions, 26257 events. 6682/26257 cut-off events. For 4468/4535 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 328760 event pairs, 4290 based on Foata normal form. 11/23511 useless extension candidates. Maximal degree in co-relation 43861. Up to 8780 conditions per place. [2022-09-16 11:28:45,746 INFO L137 encePairwiseOnDemand]: 231/253 looper letters, 134 selfloop transitions, 33 changer transitions 0/352 dead transitions. [2022-09-16 11:28:45,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 352 transitions, 1397 flow [2022-09-16 11:28:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:28:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-16 11:28:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3743 transitions. [2022-09-16 11:28:45,752 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7397233201581027 [2022-09-16 11:28:45,752 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3743 transitions. [2022-09-16 11:28:45,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3743 transitions. [2022-09-16 11:28:45,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:45,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3743 transitions. [2022-09-16 11:28:45,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 187.15) internal successors, (3743), 20 states have internal predecessors, (3743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:45,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:45,764 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 253.0) internal successors, (5313), 21 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:45,765 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 890 flow. Second operand 20 states and 3743 transitions. [2022-09-16 11:28:45,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 352 transitions, 1397 flow [2022-09-16 11:28:45,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 352 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 11:28:45,804 INFO L231 Difference]: Finished difference. Result has 301 places, 295 transitions, 1033 flow [2022-09-16 11:28:45,805 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1033, PETRI_PLACES=301, PETRI_TRANSITIONS=295} [2022-09-16 11:28:45,807 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 66 predicate places. [2022-09-16 11:28:45,807 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 295 transitions, 1033 flow [2022-09-16 11:28:45,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 182.05555555555554) internal successors, (3277), 18 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:45,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:45,808 INFO L208 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, 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, 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, 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, 1] [2022-09-16 11:28:45,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-16 11:28:45,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -531736689, now seen corresponding path program 1 times [2022-09-16 11:28:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:45,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301093348] [2022-09-16 11:28:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:46,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301093348] [2022-09-16 11:28:46,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301093348] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:46,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:46,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-16 11:28:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543191944] [2022-09-16 11:28:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:46,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 11:28:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 11:28:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-09-16 11:28:46,166 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 253 [2022-09-16 11:28:46,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 295 transitions, 1033 flow. Second operand has 19 states, 19 states have (on average 171.47368421052633) internal successors, (3258), 19 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:46,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:46,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 253 [2022-09-16 11:28:46,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:49,980 INFO L130 PetriNetUnfolder]: 7235/26097 cut-off events. [2022-09-16 11:28:49,981 INFO L131 PetriNetUnfolder]: For 6069/6084 co-relation queries the response was YES. [2022-09-16 11:28:50,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46390 conditions, 26097 events. 7235/26097 cut-off events. For 6069/6084 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 321285 event pairs, 890 based on Foata normal form. 238/24301 useless extension candidates. Maximal degree in co-relation 46254. Up to 6630 conditions per place. [2022-09-16 11:28:50,197 INFO L137 encePairwiseOnDemand]: 232/253 looper letters, 195 selfloop transitions, 42 changer transitions 0/413 dead transitions. [2022-09-16 11:28:50,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 413 transitions, 1805 flow [2022-09-16 11:28:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-16 11:28:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-16 11:28:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3422 transitions. [2022-09-16 11:28:50,202 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7118785105055128 [2022-09-16 11:28:50,202 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3422 transitions. [2022-09-16 11:28:50,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3422 transitions. [2022-09-16 11:28:50,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:50,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3422 transitions. [2022-09-16 11:28:50,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 180.10526315789474) internal successors, (3422), 19 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:50,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 253.0) internal successors, (5060), 20 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:50,216 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 253.0) internal successors, (5060), 20 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:50,216 INFO L175 Difference]: Start difference. First operand has 301 places, 295 transitions, 1033 flow. Second operand 19 states and 3422 transitions. [2022-09-16 11:28:50,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 413 transitions, 1805 flow [2022-09-16 11:28:50,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 413 transitions, 1773 flow, removed 2 selfloop flow, removed 12 redundant places. [2022-09-16 11:28:50,305 INFO L231 Difference]: Finished difference. Result has 311 places, 303 transitions, 1169 flow [2022-09-16 11:28:50,305 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1169, PETRI_PLACES=311, PETRI_TRANSITIONS=303} [2022-09-16 11:28:50,306 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 76 predicate places. [2022-09-16 11:28:50,306 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 303 transitions, 1169 flow [2022-09-16 11:28:50,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.47368421052633) internal successors, (3258), 19 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:50,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:50,307 INFO L208 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, 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, 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, 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, 1, 1] [2022-09-16 11:28:50,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 11:28:50,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1482775012, now seen corresponding path program 1 times [2022-09-16 11:28:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275939687] [2022-09-16 11:28:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:50,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275939687] [2022-09-16 11:28:50,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275939687] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:50,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:50,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:28:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990475345] [2022-09-16 11:28:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:28:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:28:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:28:50,339 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 253 [2022-09-16 11:28:50,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 303 transitions, 1169 flow. Second operand has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:50,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:50,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 253 [2022-09-16 11:28:50,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:51,154 INFO L130 PetriNetUnfolder]: 377/6392 cut-off events. [2022-09-16 11:28:51,155 INFO L131 PetriNetUnfolder]: For 854/902 co-relation queries the response was YES. [2022-09-16 11:28:51,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8512 conditions, 6392 events. 377/6392 cut-off events. For 854/902 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 69588 event pairs, 23 based on Foata normal form. 0/5824 useless extension candidates. Maximal degree in co-relation 8418. Up to 195 conditions per place. [2022-09-16 11:28:51,219 INFO L137 encePairwiseOnDemand]: 246/253 looper letters, 21 selfloop transitions, 4 changer transitions 0/313 dead transitions. [2022-09-16 11:28:51,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 1245 flow [2022-09-16 11:28:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:28:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 11:28:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1178 transitions. [2022-09-16 11:28:51,226 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9312252964426877 [2022-09-16 11:28:51,226 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1178 transitions. [2022-09-16 11:28:51,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1178 transitions. [2022-09-16 11:28:51,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:51,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1178 transitions. [2022-09-16 11:28:51,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.6) internal successors, (1178), 5 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,230 INFO L175 Difference]: Start difference. First operand has 311 places, 303 transitions, 1169 flow. Second operand 5 states and 1178 transitions. [2022-09-16 11:28:51,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 1245 flow [2022-09-16 11:28:51,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 313 transitions, 1212 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-09-16 11:28:51,245 INFO L231 Difference]: Finished difference. Result has 307 places, 306 transitions, 1168 flow [2022-09-16 11:28:51,246 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1168, PETRI_PLACES=307, PETRI_TRANSITIONS=306} [2022-09-16 11:28:51,247 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 72 predicate places. [2022-09-16 11:28:51,248 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 306 transitions, 1168 flow [2022-09-16 11:28:51,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:51,248 INFO L208 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-16 11:28:51,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 742742521, now seen corresponding path program 1 times [2022-09-16 11:28:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:51,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138688809] [2022-09-16 11:28:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:51,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:51,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138688809] [2022-09-16 11:28:51,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138688809] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:51,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:51,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:28:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708076770] [2022-09-16 11:28:51,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:51,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 11:28:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 11:28:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 11:28:51,282 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 253 [2022-09-16 11:28:51,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 306 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:51,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 253 [2022-09-16 11:28:51,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:51,395 INFO L130 PetriNetUnfolder]: 49/941 cut-off events. [2022-09-16 11:28:51,396 INFO L131 PetriNetUnfolder]: For 230/231 co-relation queries the response was YES. [2022-09-16 11:28:51,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 941 events. 49/941 cut-off events. For 230/231 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4228 event pairs, 2 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1361. Up to 20 conditions per place. [2022-09-16 11:28:51,402 INFO L137 encePairwiseOnDemand]: 249/253 looper letters, 7 selfloop transitions, 2 changer transitions 5/287 dead transitions. [2022-09-16 11:28:51,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 287 transitions, 1049 flow [2022-09-16 11:28:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 11:28:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-16 11:28:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2022-09-16 11:28:51,403 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9499341238471674 [2022-09-16 11:28:51,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 721 transitions. [2022-09-16 11:28:51,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 721 transitions. [2022-09-16 11:28:51,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:51,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 721 transitions. [2022-09-16 11:28:51,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,406 INFO L175 Difference]: Start difference. First operand has 307 places, 306 transitions, 1168 flow. Second operand 3 states and 721 transitions. [2022-09-16 11:28:51,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 287 transitions, 1049 flow [2022-09-16 11:28:51,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 287 transitions, 1037 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-09-16 11:28:51,413 INFO L231 Difference]: Finished difference. Result has 304 places, 281 transitions, 1006 flow [2022-09-16 11:28:51,414 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1006, PETRI_PLACES=304, PETRI_TRANSITIONS=281} [2022-09-16 11:28:51,415 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 69 predicate places. [2022-09-16 11:28:51,415 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 281 transitions, 1006 flow [2022-09-16 11:28:51,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:51,416 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:51,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 11:28:51,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash 603226518, now seen corresponding path program 1 times [2022-09-16 11:28:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:51,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395818398] [2022-09-16 11:28:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:51,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395818398] [2022-09-16 11:28:51,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395818398] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:51,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:51,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-09-16 11:28:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043039523] [2022-09-16 11:28:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:51,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-16 11:28:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:51,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-16 11:28:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-09-16 11:28:51,698 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 253 [2022-09-16 11:28:51,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 281 transitions, 1006 flow. Second operand has 17 states, 17 states have (on average 185.64705882352942) internal successors, (3156), 17 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:51,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:51,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 253 [2022-09-16 11:28:51,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:52,323 INFO L130 PetriNetUnfolder]: 302/1925 cut-off events. [2022-09-16 11:28:52,323 INFO L131 PetriNetUnfolder]: For 681/685 co-relation queries the response was YES. [2022-09-16 11:28:52,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1925 events. 302/1925 cut-off events. For 681/685 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12014 event pairs, 213 based on Foata normal form. 2/1809 useless extension candidates. Maximal degree in co-relation 3274. Up to 578 conditions per place. [2022-09-16 11:28:52,335 INFO L137 encePairwiseOnDemand]: 237/253 looper letters, 71 selfloop transitions, 29 changer transitions 0/289 dead transitions. [2022-09-16 11:28:52,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 289 transitions, 1220 flow [2022-09-16 11:28:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 11:28:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-16 11:28:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2829 transitions. [2022-09-16 11:28:52,338 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2022-09-16 11:28:52,338 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2829 transitions. [2022-09-16 11:28:52,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2829 transitions. [2022-09-16 11:28:52,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:52,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2829 transitions. [2022-09-16 11:28:52,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 188.6) internal successors, (2829), 15 states have internal predecessors, (2829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:52,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:52,345 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:52,345 INFO L175 Difference]: Start difference. First operand has 304 places, 281 transitions, 1006 flow. Second operand 15 states and 2829 transitions. [2022-09-16 11:28:52,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 289 transitions, 1220 flow [2022-09-16 11:28:52,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 289 transitions, 1216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-16 11:28:52,353 INFO L231 Difference]: Finished difference. Result has 318 places, 284 transitions, 1090 flow [2022-09-16 11:28:52,353 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1090, PETRI_PLACES=318, PETRI_TRANSITIONS=284} [2022-09-16 11:28:52,353 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 83 predicate places. [2022-09-16 11:28:52,354 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 284 transitions, 1090 flow [2022-09-16 11:28:52,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 185.64705882352942) internal successors, (3156), 17 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:52,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:52,354 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-16 11:28:52,355 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -593318960, now seen corresponding path program 1 times [2022-09-16 11:28:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:52,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724571111] [2022-09-16 11:28:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724571111] [2022-09-16 11:28:52,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724571111] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:28:52,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:28:52,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-16 11:28:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269754119] [2022-09-16 11:28:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:28:52,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-16 11:28:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-16 11:28:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-09-16 11:28:52,799 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 253 [2022-09-16 11:28:52,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 284 transitions, 1090 flow. Second operand has 19 states, 19 states have (on average 174.89473684210526) internal successors, (3323), 19 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:52,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:52,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 253 [2022-09-16 11:28:52,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:53,709 INFO L130 PetriNetUnfolder]: 295/1886 cut-off events. [2022-09-16 11:28:53,709 INFO L131 PetriNetUnfolder]: For 759/763 co-relation queries the response was YES. [2022-09-16 11:28:53,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3425 conditions, 1886 events. 295/1886 cut-off events. For 759/763 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11789 event pairs, 99 based on Foata normal form. 3/1780 useless extension candidates. Maximal degree in co-relation 3279. Up to 472 conditions per place. [2022-09-16 11:28:53,724 INFO L137 encePairwiseOnDemand]: 237/253 looper letters, 95 selfloop transitions, 23 changer transitions 0/298 dead transitions. [2022-09-16 11:28:53,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 298 transitions, 1362 flow [2022-09-16 11:28:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 11:28:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-16 11:28:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2678 transitions. [2022-09-16 11:28:53,727 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.70566534914361 [2022-09-16 11:28:53,727 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2678 transitions. [2022-09-16 11:28:53,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2678 transitions. [2022-09-16 11:28:53,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:28:53,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2678 transitions. [2022-09-16 11:28:53,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 178.53333333333333) internal successors, (2678), 15 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:53,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:53,735 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 253.0) internal successors, (4048), 16 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:53,735 INFO L175 Difference]: Start difference. First operand has 318 places, 284 transitions, 1090 flow. Second operand 15 states and 2678 transitions. [2022-09-16 11:28:53,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 298 transitions, 1362 flow [2022-09-16 11:28:53,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 298 transitions, 1331 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-09-16 11:28:53,743 INFO L231 Difference]: Finished difference. Result has 323 places, 285 transitions, 1127 flow [2022-09-16 11:28:53,744 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1127, PETRI_PLACES=323, PETRI_TRANSITIONS=285} [2022-09-16 11:28:53,744 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 88 predicate places. [2022-09-16 11:28:53,744 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 285 transitions, 1127 flow [2022-09-16 11:28:53,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 174.89473684210526) internal successors, (3323), 19 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:53,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:28:53,745 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:28:53,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-16 11:28:53,745 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:28:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:28:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1414442702, now seen corresponding path program 1 times [2022-09-16 11:28:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:28:53,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890242906] [2022-09-16 11:28:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:28:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:28:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890242906] [2022-09-16 11:28:54,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890242906] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:28:54,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316701472] [2022-09-16 11:28:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:28:54,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:28:54,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:28:54,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:28:54,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-16 11:28:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:28:54,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 11:28:54,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:28:54,685 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:28:54,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:28:54,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:28:54,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:28:55,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:28:55,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:28:55,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:28:55,333 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:28:55,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 11:28:55,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:28:55,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:28:55,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:28:55,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:55,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2022-09-16 11:28:55,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:28:55,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:28:56,094 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:28:56,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 42 [2022-09-16 11:28:56,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:56,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-09-16 11:28:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:28:56,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:28:56,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:28:56,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:28:56,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:28:56,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:28:56,452 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 11:28:56,461 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 11:28:56,491 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int)) (or (not (<= v_ArrVal_316 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_316) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:28:56,528 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_316) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_316) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:28:56,543 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse1 .cse2 v_ArrVal_316) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_316))))) is different from false [2022-09-16 11:28:56,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_314)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_316) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_316) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse4))))) is different from false [2022-09-16 11:28:56,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (or (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_314)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_316) (= .cse2 400) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_316) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 (+ |c_~#queue~0.offset| 1604)))) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) is different from false [2022-09-16 11:28:56,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_314)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (select .cse3 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_316) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_316) (= 400 .cse5)))))) is different from false [2022-09-16 11:28:56,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse4 .cse1)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (= .cse2 400) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_322)) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_316)))))) is different from false [2022-09-16 11:28:56,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse2 .cse1)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_316) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_316) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse3) 2147483647))))))) is different from false [2022-09-16 11:28:57,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_312)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_322)) .cse5) 2147483647) (not (<= v_ArrVal_312 0)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_316) (= 400 .cse6))))))) is different from false [2022-09-16 11:28:57,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:57,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 309 treesize of output 194 [2022-09-16 11:28:57,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:57,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 306 [2022-09-16 11:28:57,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 206 treesize of output 182 [2022-09-16 11:28:57,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 183 treesize of output 163 [2022-09-16 11:28:57,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:57,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 11:28:57,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:57,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 440 treesize of output 416 [2022-09-16 11:28:58,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:28:58,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-09-16 11:28:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 11:28:59,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316701472] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:28:59,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:28:59,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-09-16 11:28:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892974965] [2022-09-16 11:28:59,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:28:59,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 11:28:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:28:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 11:28:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=3754, Unknown=15, NotChecked=2100, Total=6320 [2022-09-16 11:28:59,072 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 253 [2022-09-16 11:28:59,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 285 transitions, 1127 flow. Second operand has 80 states, 80 states have (on average 160.1625) internal successors, (12813), 80 states have internal predecessors, (12813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:28:59,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:28:59,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 253 [2022-09-16 11:28:59,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:28:59,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604))) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse2 .cse1)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_316) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_316) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse3) 2147483647))))))) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= .cse7 0) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= (select .cse8 1608) 0) (<= .cse7 0) (<= (select .cse8 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= (select .cse8 1604) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse8 (+ 1608 |c_~#queue~0.offset|)) 0) (= (select |c_#valid| 7) 1))) is different from false [2022-09-16 11:29:00,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 1604) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select .cse3 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_316) (= 400 .cse5) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_316) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse4) 2147483647))))))) (= (select .cse0 1608) 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (<= (select .cse8 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse8 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:29:00,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse0 (+ |c_ULTIMATE.start_empty_~q#1.offset| 1604)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse0)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)))) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select .cse3 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_316) (= 400 .cse5) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_316) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse4) 2147483647))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse8 1608) 0) (<= (select .cse9 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (= 0 (select .cse8 .cse0)) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:29:01,326 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse2 .cse1)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_316) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_316) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse3) 2147483647))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select .cse7 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse8 (= (select .cse9 1608) 0) (= (select .cse9 1604) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 1604)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)))) (and (not .cse8) (= (select .cse7 1608) 0) (= (select .cse7 1604) 0)))) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse7 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:29:01,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse4 .cse1)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (= .cse2 400) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_322)) .cse5) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_316)))))) (= (select .cse6 1608) 0) (<= (select .cse6 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse6 1604) 0) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse6 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:29:02,308 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_314)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (select .cse3 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_316) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_316) (= 400 .cse5)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select .cse6 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse7 1608) 0) (= (select .cse7 1604) 0) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse6 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:29:04,326 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= (select .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (or (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_314)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse2 .cse6))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_316) (= .cse4 400) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_316) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 (+ |c_~#queue~0.offset| 1604)))) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:29:06,911 INFO L130 PetriNetUnfolder]: 702/3825 cut-off events. [2022-09-16 11:29:06,911 INFO L131 PetriNetUnfolder]: For 1679/1685 co-relation queries the response was YES. [2022-09-16 11:29:06,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7200 conditions, 3825 events. 702/3825 cut-off events. For 1679/1685 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 30319 event pairs, 406 based on Foata normal form. 6/3608 useless extension candidates. Maximal degree in co-relation 7050. Up to 660 conditions per place. [2022-09-16 11:29:06,932 INFO L137 encePairwiseOnDemand]: 219/253 looper letters, 196 selfloop transitions, 83 changer transitions 0/430 dead transitions. [2022-09-16 11:29:06,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 430 transitions, 2369 flow [2022-09-16 11:29:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-09-16 11:29:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-09-16 11:29:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8002 transitions. [2022-09-16 11:29:06,939 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6454787448576268 [2022-09-16 11:29:06,939 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 8002 transitions. [2022-09-16 11:29:06,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 8002 transitions. [2022-09-16 11:29:06,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:06,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8002 transitions. [2022-09-16 11:29:06,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 163.30612244897958) internal successors, (8002), 49 states have internal predecessors, (8002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:06,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 253.0) internal successors, (12650), 50 states have internal predecessors, (12650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:06,960 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 253.0) internal successors, (12650), 50 states have internal predecessors, (12650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:06,960 INFO L175 Difference]: Start difference. First operand has 323 places, 285 transitions, 1127 flow. Second operand 49 states and 8002 transitions. [2022-09-16 11:29:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 430 transitions, 2369 flow [2022-09-16 11:29:06,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 430 transitions, 2325 flow, removed 6 selfloop flow, removed 13 redundant places. [2022-09-16 11:29:06,970 INFO L231 Difference]: Finished difference. Result has 373 places, 327 transitions, 1658 flow [2022-09-16 11:29:06,971 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=1658, PETRI_PLACES=373, PETRI_TRANSITIONS=327} [2022-09-16 11:29:06,971 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 138 predicate places. [2022-09-16 11:29:06,971 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 327 transitions, 1658 flow [2022-09-16 11:29:06,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 160.1625) internal successors, (12813), 80 states have internal predecessors, (12813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:06,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:06,974 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:29:06,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-09-16 11:29:07,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-09-16 11:29:07,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:29:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 898051427, now seen corresponding path program 1 times [2022-09-16 11:29:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38006358] [2022-09-16 11:29:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:29:07,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38006358] [2022-09-16 11:29:07,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38006358] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:29:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050819009] [2022-09-16 11:29:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:07,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:29:07,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:29:07,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:29:07,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-16 11:29:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:07,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2022-09-16 11:29:07,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:29:07,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:29:07,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 11:29:08,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:08,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 11:29:08,177 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 11:29:08,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-09-16 11:29:08,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-09-16 11:29:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:29:08,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:29:36,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_384 Int) (v_ArrVal_383 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_383) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_384) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_384 2147483648) 0))) is different from false [2022-09-16 11:29:36,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_384 Int) (v_ArrVal_381 Int) (v_ArrVal_383 (Array Int Int))) (or (< (+ v_ArrVal_384 2147483648) 0) (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_381)) |c_~#stored_elements~0.base| v_ArrVal_383) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_384) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-09-16 11:29:36,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:36,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-09-16 11:29:36,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:36,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-09-16 11:29:36,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-09-16 11:29:36,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-09-16 11:29:36,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:36,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-09-16 11:29:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:29:36,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050819009] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:29:36,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:29:36,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 49 [2022-09-16 11:29:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894953901] [2022-09-16 11:29:36,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:29:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-09-16 11:29:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:29:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-09-16 11:29:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1998, Unknown=61, NotChecked=186, Total=2450 [2022-09-16 11:29:36,479 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 253 [2022-09-16 11:29:36,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 327 transitions, 1658 flow. Second operand has 50 states, 50 states have (on average 183.1) internal successors, (9155), 50 states have internal predecessors, (9155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:36,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:29:36,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 253 [2022-09-16 11:29:36,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:29:39,412 INFO L130 PetriNetUnfolder]: 988/6219 cut-off events. [2022-09-16 11:29:39,412 INFO L131 PetriNetUnfolder]: For 2730/2730 co-relation queries the response was YES. [2022-09-16 11:29:39,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11249 conditions, 6219 events. 988/6219 cut-off events. For 2730/2730 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 57553 event pairs, 326 based on Foata normal form. 11/5881 useless extension candidates. Maximal degree in co-relation 11094. Up to 1001 conditions per place. [2022-09-16 11:29:39,470 INFO L137 encePairwiseOnDemand]: 232/253 looper letters, 180 selfloop transitions, 89 changer transitions 0/451 dead transitions. [2022-09-16 11:29:39,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 451 transitions, 2782 flow [2022-09-16 11:29:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 11:29:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-09-16 11:29:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4871 transitions. [2022-09-16 11:29:39,475 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7404986318029796 [2022-09-16 11:29:39,475 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4871 transitions. [2022-09-16 11:29:39,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4871 transitions. [2022-09-16 11:29:39,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:29:39,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4871 transitions. [2022-09-16 11:29:39,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 187.34615384615384) internal successors, (4871), 26 states have internal predecessors, (4871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:39,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 253.0) internal successors, (6831), 27 states have internal predecessors, (6831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:39,485 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 253.0) internal successors, (6831), 27 states have internal predecessors, (6831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:39,485 INFO L175 Difference]: Start difference. First operand has 373 places, 327 transitions, 1658 flow. Second operand 26 states and 4871 transitions. [2022-09-16 11:29:39,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 451 transitions, 2782 flow [2022-09-16 11:29:39,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 451 transitions, 2467 flow, removed 102 selfloop flow, removed 28 redundant places. [2022-09-16 11:29:39,508 INFO L231 Difference]: Finished difference. Result has 380 places, 364 transitions, 1931 flow [2022-09-16 11:29:39,509 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1931, PETRI_PLACES=380, PETRI_TRANSITIONS=364} [2022-09-16 11:29:39,510 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 145 predicate places. [2022-09-16 11:29:39,510 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 364 transitions, 1931 flow [2022-09-16 11:29:39,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 183.1) internal successors, (9155), 50 states have internal predecessors, (9155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:29:39,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:29:39,512 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1] [2022-09-16 11:29:39,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-16 11:29:39,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-09-16 11:29:39,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:29:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:29:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2106394750, now seen corresponding path program 1 times [2022-09-16 11:29:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:29:39,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313772835] [2022-09-16 11:29:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:29:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:29:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:29:40,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313772835] [2022-09-16 11:29:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313772835] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:29:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751941421] [2022-09-16 11:29:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:29:40,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:29:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:29:40,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:29:40,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-16 11:29:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:29:40,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 11:29:40,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:29:40,970 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:29:40,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-09-16 11:29:41,001 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:29:41,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:29:41,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:29:41,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:29:41,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:29:41,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:29:41,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:29:41,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:41,783 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:29:41,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 11:29:41,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:41,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:29:41,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:29:42,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:42,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:29:42,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:29:42,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:29:42,475 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:29:42,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 11:29:42,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:29:42,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-09-16 11:29:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:29:42,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:30:14,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:30:14,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_457 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-09-16 11:30:14,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_457) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:30:14,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-09-16 11:30:14,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_456 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-09-16 11:30:14,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_456) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 11:30:14,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_456) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 11:30:14,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (< (+ (select .cse0 .cse2) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-09-16 11:30:15,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_456) .cse3 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_456) (< (+ (select .cse1 .cse3) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-09-16 11:30:15,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_456) .cse3 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_456) (< (+ (select .cse1 .cse3) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse3))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 11:30:15,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (< (+ (select .cse0 .cse2) 1) v_ArrVal_456) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1)))))))) is different from false [2022-09-16 11:30:15,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_457) (< (+ (select .cse4 .cse3) 1) v_ArrVal_456))))))) is different from false [2022-09-16 11:30:15,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_456) .cse3 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_457) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse1) 2147483647))))))) is different from false [2022-09-16 11:30:15,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_450 Int) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_456) .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_456) (< (+ (select .cse0 .cse2) 1) v_ArrVal_457) (not (<= v_ArrVal_450 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse2))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse2))))))))) is different from false [2022-09-16 11:30:15,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:15,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 270 treesize of output 185 [2022-09-16 11:30:15,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:15,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 640 [2022-09-16 11:30:15,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 524 treesize of output 500 [2022-09-16 11:30:15,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 386 treesize of output 354 [2022-09-16 11:30:15,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 301 treesize of output 289 [2022-09-16 11:30:15,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 9 [2022-09-16 11:30:16,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:16,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 321 [2022-09-16 11:30:17,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:17,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-09-16 11:30:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 11:30:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751941421] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:30:17,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:30:17,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-09-16 11:30:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356018339] [2022-09-16 11:30:17,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:30:17,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 11:30:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:30:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 11:30:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=4347, Unknown=51, NotChecked=2086, Total=6972 [2022-09-16 11:30:17,558 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 253 [2022-09-16 11:30:17,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 364 transitions, 1931 flow. Second operand has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:30:17,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:30:17,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 253 [2022-09-16 11:30:17,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:30:18,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse0 1608) 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 0) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_456) .cse4 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse4))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_457) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse2) 2147483647))))))) (= 7 |c_~#queue~0.base|) (= (select .cse0 1604) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:30:19,352 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 1604) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= (select .cse0 1608) 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_456) .cse5 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse6 .cse5))) (< (+ (select .cse2 .cse5) 1) v_ArrVal_457) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse3) 2147483647))))))) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:30:19,996 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse1 (+ |c_ULTIMATE.start_empty_~q#1.offset| 1604)) (.cse3 (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|))) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1))) (or .cse0 (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse2 1608) 0) (or .cse3 (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse1))) (<= (select .cse4 (+ |c_~#queue~0.offset| 1604)) 0) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_456) .cse8 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse5 .cse6) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse7 .cse8))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse9 .cse8))) (< (+ (select .cse5 .cse8) 1) v_ArrVal_457) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse6) 2147483647))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (= 0 (select .cse2 .cse1)) (or .cse3 (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse4 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:30:20,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (.cse11 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (not .cse11)) (.cse10 (not .cse7)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 0) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_456) .cse4 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse4))) (< (+ (select .cse1 .cse4) 1) v_ArrVal_457) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse2) 2147483647))))))) (= 7 |c_~#queue~0.base|) (or (and .cse7 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (= (select .cse8 1604) 0)) (and .cse9 .cse10 (= (select .cse0 1604) 0)) (and .cse11 (= (select .cse12 1604) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 1604)))) (let ((.cse13 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)))) (or (and .cse11 (= (select .cse12 1608) 0) .cse13 (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (and .cse9 .cse10 (= (select .cse0 1608) 0)) (and .cse13 .cse7 (= (select .cse8 1608) 0) (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 0)))) is different from false [2022-09-16 11:30:21,255 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (let ((.cse9 (not .cse7)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|)) (.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_457) (< (+ (select .cse4 .cse3) 1) v_ArrVal_456))))))) (= |c_~#queue~0.offset| 0) (<= (select .cse6 (+ |c_~#queue~0.offset| 1604)) 0) (or (and .cse7 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (= (select .cse8 1604) 0)) (and .cse9 (= (select .cse6 1604) 0))) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (and .cse9 (= (select .cse6 1608) 0)) (and .cse7 (= (select .cse8 1608) 0) (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|)))) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse6 (+ 1608 |c_~#queue~0.offset|)) 0)))) is different from false [2022-09-16 11:30:22,713 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 1608) 0) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_454)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse3 v_ArrVal_456) .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_457) (< (+ (select .cse1 .cse3) 1) v_ArrVal_456) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse5 .cse2)))))))) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 1604) 0) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:30:24,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_457 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_456) .cse3 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_456) (< (+ (select .cse1 .cse3) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse3))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select .cse5 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse6 1608) 0) (= (select .cse6 1604) 0) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse5 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:30:26,202 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= (select .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_457 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_454)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_456) .cse5 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_456) (< (+ (select .cse3 .cse5) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))))) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:30:27,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| 7)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (<= (select .cse0 .cse1) 1) (<= (* (select .cse2 1604) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (<= (select .cse2 1608) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= (select .cse3 .cse4) 1) (<= (select .cse2 (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (<= (select .cse0 .cse4) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse2 (+ 1608 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 (+ |c_~#queue~0.offset| 1604))))))) (<= (* (select .cse3 .cse1) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 0))) is different from false [2022-09-16 11:30:27,861 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 1608) 1) (= |c_~#queue~0.offset| 0) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_459 (Array Int Int)) (v_ArrVal_460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse1 (+ |c_~#queue~0.offset| 1604))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:30:36,662 INFO L130 PetriNetUnfolder]: 1133/6630 cut-off events. [2022-09-16 11:30:36,662 INFO L131 PetriNetUnfolder]: For 3515/3519 co-relation queries the response was YES. [2022-09-16 11:30:36,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12959 conditions, 6630 events. 1133/6630 cut-off events. For 3515/3519 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 61368 event pairs, 710 based on Foata normal form. 4/6284 useless extension candidates. Maximal degree in co-relation 12790. Up to 2227 conditions per place. [2022-09-16 11:30:36,725 INFO L137 encePairwiseOnDemand]: 219/253 looper letters, 210 selfloop transitions, 90 changer transitions 0/464 dead transitions. [2022-09-16 11:30:36,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 464 transitions, 3188 flow [2022-09-16 11:30:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 11:30:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-09-16 11:30:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7088 transitions. [2022-09-16 11:30:36,730 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.651530471550694 [2022-09-16 11:30:36,730 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7088 transitions. [2022-09-16 11:30:36,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7088 transitions. [2022-09-16 11:30:36,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:30:36,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7088 transitions. [2022-09-16 11:30:36,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 164.8372093023256) internal successors, (7088), 43 states have internal predecessors, (7088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:30:36,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 253.0) internal successors, (11132), 44 states have internal predecessors, (11132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:30:36,748 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 253.0) internal successors, (11132), 44 states have internal predecessors, (11132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:30:36,748 INFO L175 Difference]: Start difference. First operand has 380 places, 364 transitions, 1931 flow. Second operand 43 states and 7088 transitions. [2022-09-16 11:30:36,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 464 transitions, 3188 flow [2022-09-16 11:30:36,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 464 transitions, 3075 flow, removed 51 selfloop flow, removed 5 redundant places. [2022-09-16 11:30:36,775 INFO L231 Difference]: Finished difference. Result has 440 places, 427 transitions, 2648 flow [2022-09-16 11:30:36,775 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2648, PETRI_PLACES=440, PETRI_TRANSITIONS=427} [2022-09-16 11:30:36,775 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 205 predicate places. [2022-09-16 11:30:36,776 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 427 transitions, 2648 flow [2022-09-16 11:30:36,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.02380952380952) internal successors, (13694), 84 states have internal predecessors, (13694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:30:36,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:30:36,777 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1] [2022-09-16 11:30:36,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 11:30:36,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:30:36,984 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:30:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:30:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 896431314, now seen corresponding path program 2 times [2022-09-16 11:30:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:30:36,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312140884] [2022-09-16 11:30:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:30:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:30:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:30:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:30:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:30:37,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312140884] [2022-09-16 11:30:37,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312140884] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:30:37,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762497923] [2022-09-16 11:30:37,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:30:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:30:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:30:37,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:30:37,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 11:30:38,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:30:38,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:30:38,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-09-16 11:30:38,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:30:38,185 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:30:38,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-09-16 11:30:38,214 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:30:38,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:30:38,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:30:38,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:30:38,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:30:38,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:30:38,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:30:38,906 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:30:38,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 11:30:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:30:39,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:30:39,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:30:39,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:30:39,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:39,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:30:39,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:30:39,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:30:39,633 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:30:39,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 11:30:39,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:30:39,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-09-16 11:30:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:30:39,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:31:14,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:31:14,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_534 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_534 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:31:14,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_534 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:31:14,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_534 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-09-16 11:31:14,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534)))))) is different from false [2022-09-16 11:31:14,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534) (not (<= v_ArrVal_531 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-09-16 11:31:14,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_531)))))) is different from false [2022-09-16 11:31:14,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_531) (< (+ (select .cse3 .cse4) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-09-16 11:31:14,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_528)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (< (+ (select .cse2 .cse3) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-09-16 11:31:14,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (or (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_534))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) is different from false [2022-09-16 11:31:14,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse4 .cse5 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_531)))))))) is different from false [2022-09-16 11:31:15,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_531)))))))) is different from false [2022-09-16 11:31:15,279 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 .cse4))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_534))))))))) is different from false [2022-09-16 11:31:15,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_526 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_526)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_531) (not (<= v_ArrVal_526 0)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_534) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse5 .cse1))))))))))) is different from false [2022-09-16 11:31:15,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:15,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 408 treesize of output 248 [2022-09-16 11:31:15,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:15,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 518 treesize of output 514 [2022-09-16 11:31:15,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 211 treesize of output 199 [2022-09-16 11:31:15,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 373 treesize of output 341 [2022-09-16 11:31:15,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 336 treesize of output 320 [2022-09-16 11:31:15,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 9 [2022-09-16 11:31:15,986 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:15,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 212 [2022-09-16 11:31:16,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:31:16,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-09-16 11:31:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 11:31:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762497923] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:31:17,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:31:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-09-16 11:31:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407520524] [2022-09-16 11:31:17,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:31:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-16 11:31:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:31:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-16 11:31:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=4216, Unknown=52, NotChecked=2058, Total=6806 [2022-09-16 11:31:17,128 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 253 [2022-09-16 11:31:17,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 427 transitions, 2648 flow. Second operand has 83 states, 83 states have (on average 163.04819277108433) internal successors, (13533), 83 states have internal predecessors, (13533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:31:17,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:31:17,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 253 [2022-09-16 11:31:17,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:31:37,909 WARN L233 SmtUtils]: Spent 20.37s on a formula simplification. DAG size of input: 97 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 11:31:38,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse0 1608) 0) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_531) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_534))))))))) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 1604) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:31:39,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 1604) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= (select .cse0 1608) 0) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_531) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse3 .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_534))))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (<= (select .cse9 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:31:39,777 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse13 (+ |c_ULTIMATE.start_empty_~q#1.offset| 1604))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse2 (= |c_ULTIMATE.start_empty_~q#1.offset| 0)) (.cse3 (= 0 (select .cse1 .cse13))) (.cse12 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or .cse0 (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= (select .cse1 1608) 0) .cse2 .cse3 (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse10 |c_~#queue~0.base| (store .cse9 .cse8 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_531) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse8))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse6 .cse8))) (< (+ (select .cse9 .cse8) 1) v_ArrVal_534))))))))) (<= (select .cse12 (+ |c_~#queue~0.offset| 1604)) 0) (or (not .cse0) (and (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1608) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse13)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)) .cse2 .cse3)) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse12 (+ 1608 |c_~#queue~0.offset|)) 0)))) is different from false [2022-09-16 11:31:40,409 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not .cse0) (= (select .cse1 1608) 0) (= (select .cse1 1604) 0)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse0 (= (select .cse2 1608) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse2 1604) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 1604)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse7 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_531) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse7))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse7))) (< (+ (select .cse8 .cse7) 1) v_ArrVal_534))))))))) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:31:42,117 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (and (let ((.cse0 (= (select .cse2 1608) 0)) (.cse1 (= (select .cse2 1604) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse0 .cse1) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) .cse0 .cse1))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (<= (select .cse2 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse8 .cse6 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 .cse4))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) .cse6) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse7 .cse4))) (< (+ (select .cse8 .cse6) 1) v_ArrVal_531)))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse2 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:31:43,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (= (select .cse2 1608) 0)) (.cse1 (= (select .cse2 1604) 0))) (or (and (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) .cse0 .cse1) (and .cse0 .cse1 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|)))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse7 .cse8 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse3 (select .cse9 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (select (store (store .cse9 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse3 .cse4 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse5 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select .cse6 .cse4))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_531)))))))) (<= (select .cse10 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse10 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:31:45,757 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| Int)) (or (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36|)) v_ArrVal_528)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_534))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_36| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (let ((.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (= (select .cse10 .cse8) 0)) (.cse7 (= (select .cse10 .cse9) 0))) (or (and .cse6 .cse7 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (and .cse6 .cse7 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse8)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse9)))))) (<= (select .cse11 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse11 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:31:49,203 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 1608) 1) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 (+ |c_~#queue~0.offset| 1604))))))) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6) (= 0 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) is different from false [2022-09-16 11:31:49,732 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 1608) 1) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select .cse1 (+ |c_~#queue~0.offset| 1604))))))) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-16 11:32:00,307 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_536 Int)) (< (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_536) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647))))) is different from false [2022-09-16 11:32:03,456 INFO L130 PetriNetUnfolder]: 3075/20402 cut-off events. [2022-09-16 11:32:03,456 INFO L131 PetriNetUnfolder]: For 8346/8376 co-relation queries the response was YES. [2022-09-16 11:32:03,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36323 conditions, 20402 events. 3075/20402 cut-off events. For 8346/8376 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 255601 event pairs, 1646 based on Foata normal form. 19/19216 useless extension candidates. Maximal degree in co-relation 36121. Up to 1988 conditions per place. [2022-09-16 11:32:03,793 INFO L137 encePairwiseOnDemand]: 216/253 looper letters, 493 selfloop transitions, 262 changer transitions 0/919 dead transitions. [2022-09-16 11:32:03,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 919 transitions, 6913 flow [2022-09-16 11:32:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-09-16 11:32:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-09-16 11:32:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 17137 transitions. [2022-09-16 11:32:03,804 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6576230860739092 [2022-09-16 11:32:03,804 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 17137 transitions. [2022-09-16 11:32:03,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 17137 transitions. [2022-09-16 11:32:03,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:32:03,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 17137 transitions. [2022-09-16 11:32:03,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 166.37864077669903) internal successors, (17137), 103 states have internal predecessors, (17137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:03,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 253.0) internal successors, (26312), 104 states have internal predecessors, (26312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:03,841 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 253.0) internal successors, (26312), 104 states have internal predecessors, (26312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:03,841 INFO L175 Difference]: Start difference. First operand has 440 places, 427 transitions, 2648 flow. Second operand 103 states and 17137 transitions. [2022-09-16 11:32:03,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 919 transitions, 6913 flow [2022-09-16 11:32:03,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 919 transitions, 6816 flow, removed 34 selfloop flow, removed 14 redundant places. [2022-09-16 11:32:03,918 INFO L231 Difference]: Finished difference. Result has 577 places, 603 transitions, 5008 flow [2022-09-16 11:32:03,918 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=5008, PETRI_PLACES=577, PETRI_TRANSITIONS=603} [2022-09-16 11:32:03,919 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 342 predicate places. [2022-09-16 11:32:03,919 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 603 transitions, 5008 flow [2022-09-16 11:32:03,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 163.04819277108433) internal successors, (13533), 83 states have internal predecessors, (13533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:03,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:32:03,921 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1] [2022-09-16 11:32:03,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 11:32:04,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-09-16 11:32:04,135 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:32:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:32:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash 186067282, now seen corresponding path program 3 times [2022-09-16 11:32:04,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:32:04,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688593051] [2022-09-16 11:32:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:32:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:32:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:32:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:32:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:32:25,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688593051] [2022-09-16 11:32:25,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688593051] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:32:25,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467273330] [2022-09-16 11:32:25,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 11:32:25,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:32:25,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:32:25,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:32:25,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 11:32:25,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-16 11:32:25,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:32:25,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 77 conjunts are in the unsatisfiable core [2022-09-16 11:32:25,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:32:25,299 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:32:25,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-09-16 11:32:25,328 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:32:25,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:32:25,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:32:25,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:32:25,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:32:26,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:32:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:26,024 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:32:26,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 11:32:26,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:26,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:32:26,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:32:26,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:26,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2022-09-16 11:32:26,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:32:26,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:26,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:32:26,791 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:32:26,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 42 [2022-09-16 11:32:26,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:26,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-09-16 11:32:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:32:26,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:32:27,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:27,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:27,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:27,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:27,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-09-16 11:32:27,156 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 11:32:27,164 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-09-16 11:32:27,183 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (or (not (<= v_ArrVal_606 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_606) .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) is different from false [2022-09-16 11:32:27,209 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_606) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_606) .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) is different from false [2022-09-16 11:32:27,220 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_606) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse0 .cse1 v_ArrVal_606) .cse3 (+ (select .cse0 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) is different from false [2022-09-16 11:32:27,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_604)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse1 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_606) .cse3 (+ .cse4 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse4) (< (+ (select .cse1 .cse2) 1) v_ArrVal_606))))) is different from false [2022-09-16 11:32:27,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int)) (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_604)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse1 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_606) .cse3 (+ .cse4 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse4) (< (+ (select .cse1 .cse2) 1) v_ArrVal_606))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) is different from false [2022-09-16 11:32:27,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_604)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_606) (< (select (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_606) .cse4 (+ .cse0 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse5 .cse4)))))))) is different from false [2022-09-16 11:32:27,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select .cse2 .cse1)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_606) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_606) .cse1 (+ .cse4 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse3) 2147483647)))))) is different from false [2022-09-16 11:32:27,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_606) (< (select (let ((.cse2 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_606) .cse3 (+ .cse5 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse1) 2147483647) (= 400 .cse5) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse6 .cse3))))))))) is different from false [2022-09-16 11:32:27,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_602 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_602)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_606) .cse1 (+ .cse5 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse6 .cse1))) (not (<= v_ArrVal_602 0)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_606) (= 400 .cse5))))))) is different from false [2022-09-16 11:32:27,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:27,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 315 treesize of output 200 [2022-09-16 11:32:27,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:27,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 732 treesize of output 718 [2022-09-16 11:32:27,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 646 treesize of output 598 [2022-09-16 11:32:27,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 405 treesize of output 377 [2022-09-16 11:32:27,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 714 treesize of output 618 [2022-09-16 11:32:27,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 9 [2022-09-16 11:32:28,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:28,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 456 treesize of output 432 [2022-09-16 11:32:30,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:30,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-09-16 11:32:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-09-16 11:32:30,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467273330] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:32:30,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:32:30,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 31] total 85 [2022-09-16 11:32:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956741728] [2022-09-16 11:32:30,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:32:30,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-16 11:32:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:32:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-16 11:32:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=4353, Unknown=16, NotChecked=2416, Total=7310 [2022-09-16 11:32:30,216 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 253 [2022-09-16 11:32:30,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 603 transitions, 5008 flow. Second operand has 86 states, 86 states have (on average 159.04651162790697) internal successors, (13678), 86 states have internal predecessors, (13678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:30,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:32:30,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 253 [2022-09-16 11:32:30,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:32:31,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (or (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|) .cse0) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= .cse1 .cse2) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse3 .cse6))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_606) (< (select (let ((.cse5 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_606) .cse6 (+ .cse8 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse6)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse4) 2147483647) (= 400 .cse8) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse9 .cse6))))))))) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= (select .cse2 (+ |c_ULTIMATE.start_init_~q#1.offset| 1604)) 0) (<= (select .cse10 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= .cse1 .cse10) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (or .cse0 (not (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (<= (select .cse10 (+ 1608 |c_~#queue~0.offset|)) 0) (= (select |c_#valid| 7) 1))) is different from false [2022-09-16 11:32:32,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse12 .cse0))) (let ((.cse11 (store .cse12 .cse13 0))) (let ((.cse10 (@diff .cse11 .cse0))) (let ((.cse1 (store .cse11 .cse10 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|) 1604) 0) (= .cse0 (store .cse1 .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (= .cse0 .cse1) (<= .cse2 1600)) (or (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse3 .cse6))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_606) (< (select (let ((.cse5 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_606) .cse6 (+ .cse8 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse6)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse4) 2147483647) (= 400 .cse8) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse9 .cse6))))))))) (or (<= .cse10 1600) (= .cse0 .cse11)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (<= (select .cse12 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (or (= .cse0 .cse12) (<= .cse13 1600)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse12 (+ 1608 |c_~#queue~0.offset|)) 0)))))))) is different from false [2022-09-16 11:32:32,724 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse12 .cse0))) (let ((.cse11 (store .cse12 .cse13 0))) (let ((.cse10 (@diff .cse11 .cse0))) (let ((.cse1 (store .cse11 .cse10 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (= .cse0 .cse1) (<= .cse2 1600)) (or (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse3 .cse6))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_606) (< (select (let ((.cse5 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_606) .cse6 (+ .cse8 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse6)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse4) 2147483647) (= 400 .cse8) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse9 .cse6))))))))) (or (<= .cse10 1600) (= .cse0 .cse11)) (<= (select .cse12 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|) (+ |c_ULTIMATE.start_empty_~q#1.offset| 1604))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (= .cse0 .cse12) (<= .cse13 1600)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse12 (+ 1608 |c_~#queue~0.offset|)) 0)))))))) is different from false [2022-09-16 11:32:33,379 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse13 (@diff .cse12 .cse0))) (let ((.cse11 (store .cse12 .cse13 0))) (let ((.cse10 (@diff .cse11 .cse0))) (let ((.cse1 (store .cse11 .cse10 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (or (= .cse0 .cse1) (<= .cse2 1600)) (or (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse3 .cse6))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_606) (< (select (let ((.cse5 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_606) .cse6 (+ .cse8 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse6)) |c_~#queue~0.offset|) v_ArrVal_612)) .cse4) 2147483647) (= 400 .cse8) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse9 .cse6))))))))) (or (<= .cse10 1600) (= .cse0 .cse11)) (<= (select .cse12 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or (= .cse0 .cse12) (<= .cse13 1600)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse12 (+ 1608 |c_~#queue~0.offset|)) 0)))))))) is different from false [2022-09-16 11:32:34,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 ((as const (Array Int Int)) 0))) (let ((.cse11 (@diff .cse1 .cse8))) (let ((.cse14 (store .cse1 .cse11 0))) (let ((.cse17 (@diff .cse14 .cse8))) (let ((.cse9 (store .cse14 .cse17 0))) (let ((.cse18 (@diff .cse9 .cse8))) (let ((.cse16 (store .cse9 .cse18 0))) (let ((.cse0 (= .cse8 .cse16))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (or .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (<= (select .cse1 (+ |c_~#queue~0.offset| 1604)) 0) (forall ((v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse4 .cse3)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_606) (= 400 .cse6) (< (select (let ((.cse7 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_606) .cse3 (+ .cse6 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_612)) .cse5) 2147483647)))))) (= 7 |c_~#queue~0.base|) (let ((.cse10 (<= .cse18 1600)) (.cse13 (<= .cse17 1600)) (.cse12 (<= .cse11 1600))) (or (and .cse0 (or (= .cse8 .cse9) .cse10) (or (= (select .cse1 .cse11) 0) .cse12) (or .cse13 (= .cse8 .cse14))) (let ((.cse15 (@diff .cse16 .cse8))) (and .cse10 (<= .cse15 1600) .cse13 (= .cse8 (store .cse16 .cse15 0)) .cse12)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse1 (+ 1608 |c_~#queue~0.offset|)) 0)))))))))) is different from false [2022-09-16 11:32:35,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse16 (@diff .cse15 .cse0))) (let ((.cse14 (store .cse15 .cse16 0))) (let ((.cse19 (@diff .cse14 .cse0))) (let ((.cse17 (store .cse14 .cse19 0))) (let ((.cse18 (@diff .cse17 .cse0))) (let ((.cse1 (store .cse17 .cse18 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse13 (= .cse0 .cse1)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= .cse0 (store .cse1 .cse2 0)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_604)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select .cse4 .cse7))) (or (= 400 .cse3) (< (+ (select .cse4 .cse5) 1) v_ArrVal_606) (< (select (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_606) .cse7 (+ .cse3 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select .cse8 .cse7)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select .cse9 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (let ((.cse12 (<= .cse19 1600)) (.cse11 (<= .cse16 1600)) (.cse10 (<= .cse18 1600))) (or (and .cse10 .cse11 .cse12 (<= .cse2 1600)) (and .cse13 (or (= .cse0 .cse14) .cse12) (or .cse11 (= (select .cse15 .cse16) 0)) (or .cse10 (= .cse0 .cse17))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (or .cse13 (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 1608 |c_~#queue~0.offset|)) 0)))))))))) is different from false [2022-09-16 11:32:37,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 .cse1) 0) (or .cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse3))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int)) (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_604)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse5 .cse7)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_606) .cse7 (+ .cse8 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_612)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse8) (< (+ (select .cse5 .cse6) 1) v_ArrVal_606))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) .cse2) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= (select .cse0 .cse3) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (select .cse9 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:32:44,836 INFO L130 PetriNetUnfolder]: 3462/22479 cut-off events. [2022-09-16 11:32:44,836 INFO L131 PetriNetUnfolder]: For 127427/127485 co-relation queries the response was YES. [2022-09-16 11:32:45,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57557 conditions, 22479 events. 3462/22479 cut-off events. For 127427/127485 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 285993 event pairs, 2295 based on Foata normal form. 9/21103 useless extension candidates. Maximal degree in co-relation 57305. Up to 6703 conditions per place. [2022-09-16 11:32:45,425 INFO L137 encePairwiseOnDemand]: 216/253 looper letters, 431 selfloop transitions, 104 changer transitions 0/692 dead transitions. [2022-09-16 11:32:45,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 692 transitions, 7167 flow [2022-09-16 11:32:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-09-16 11:32:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-09-16 11:32:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 6173 transitions. [2022-09-16 11:32:45,434 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6420844601622634 [2022-09-16 11:32:45,434 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 6173 transitions. [2022-09-16 11:32:45,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 6173 transitions. [2022-09-16 11:32:45,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:32:45,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 6173 transitions. [2022-09-16 11:32:45,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 162.44736842105263) internal successors, (6173), 38 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:45,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 253.0) internal successors, (9867), 39 states have internal predecessors, (9867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:45,453 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 253.0) internal successors, (9867), 39 states have internal predecessors, (9867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:45,454 INFO L175 Difference]: Start difference. First operand has 577 places, 603 transitions, 5008 flow. Second operand 38 states and 6173 transitions. [2022-09-16 11:32:45,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 692 transitions, 7167 flow [2022-09-16 11:32:45,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 692 transitions, 6606 flow, removed 241 selfloop flow, removed 27 redundant places. [2022-09-16 11:32:45,723 INFO L231 Difference]: Finished difference. Result has 593 places, 636 transitions, 5153 flow [2022-09-16 11:32:45,723 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=5153, PETRI_PLACES=593, PETRI_TRANSITIONS=636} [2022-09-16 11:32:45,724 INFO L287 CegarLoopForPetriNet]: 235 programPoint places, 358 predicate places. [2022-09-16 11:32:45,724 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 636 transitions, 5153 flow [2022-09-16 11:32:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 159.04651162790697) internal successors, (13678), 86 states have internal predecessors, (13678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:32:45,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:32:45,726 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1] [2022-09-16 11:32:45,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-16 11:32:45,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 11:32:45,946 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-09-16 11:32:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:32:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash -183309312, now seen corresponding path program 4 times [2022-09-16 11:32:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:32:45,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466389525] [2022-09-16 11:32:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:32:45,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:32:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:32:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:32:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:32:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466389525] [2022-09-16 11:32:47,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466389525] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:32:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249593705] [2022-09-16 11:32:47,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 11:32:47,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:32:47,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:32:47,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:32:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 11:32:47,237 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 11:32:47,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:32:47,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 73 conjunts are in the unsatisfiable core [2022-09-16 11:32:47,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:32:47,305 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 11:32:47,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-09-16 11:32:47,334 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:32:47,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:32:47,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 11:32:47,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:32:47,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:32:47,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:32:47,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:47,991 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-09-16 11:32:47,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-09-16 11:32:48,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:48,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 11:32:48,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:32:48,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:48,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-09-16 11:32:48,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:32:48,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:32:48,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-09-16 11:32:48,734 INFO L356 Elim1Store]: treesize reduction 75, result has 22.7 percent of original size [2022-09-16 11:32:48,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 42 [2022-09-16 11:32:48,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:32:48,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-09-16 11:32:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:32:48,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:33:29,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-09-16 11:33:29,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:33:29,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_685 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-09-16 11:33:29,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_685) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-16 11:33:29,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_685))))) is different from false [2022-09-16 11:33:29,912 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_685 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_685)))))) is different from false [2022-09-16 11:33:29,926 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_685 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_685)))))) is different from false [2022-09-16 11:33:29,967 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_685 Int) (v_ArrVal_682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_682) .cse2 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_682 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_685) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-09-16 11:33:30,018 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_685 Int) (v_ArrVal_682 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_682) .cse2 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_682) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_685) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-09-16 11:33:32,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_680)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|)) (.cse3 (select .cse1 .cse4))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_682) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_685) (= 400 .cse3))))) is different from false [2022-09-16 11:33:32,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_680)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (= 400 .cse0) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_685) (< (+ (select .cse2 .cse3) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-09-16 11:33:32,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_680)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse1 (select .cse4 .cse3)) (.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_682) .cse3 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (= 400 .cse1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse3))) (< (+ .cse1 1) v_ArrVal_685) (< (+ (select .cse4 .cse5) 1) v_ArrVal_682) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-09-16 11:33:32,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse5 .cse4)) (.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse1) 2147483647) (= .cse2 400) (< (+ .cse2 1) v_ArrVal_685) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 .cse4)))))))) is different from false [2022-09-16 11:33:32,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_679))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse4)) (.cse5 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_685) (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse5 .cse4))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse2) 2147483647))))))) is different from false [2022-09-16 11:33:32,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_677 Int) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_677)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_679))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_682) .cse3 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|)) (.cse5 (select .cse4 .cse3))) (or (not (<= v_ArrVal_677 0)) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse0 .cse3))) (= 400 .cse5) (< (+ 1 .cse5) v_ArrVal_685))))))) is different from false [2022-09-16 11:33:32,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:32,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 289 treesize of output 189 [2022-09-16 11:33:32,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:32,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 700 treesize of output 692 [2022-09-16 11:33:32,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 215 treesize of output 199 [2022-09-16 11:33:32,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 542 treesize of output 518 [2022-09-16 11:33:32,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 578 treesize of output 530 [2022-09-16 11:33:32,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:32,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-09-16 11:33:33,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:33,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 174 [2022-09-16 11:33:33,552 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-09-16 11:33:33,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:33:33,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-09-16 11:33:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-09-16 11:33:34,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249593705] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:33:34,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:33:34,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 31] total 85 [2022-09-16 11:33:34,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832049874] [2022-09-16 11:33:34,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:33:34,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-16 11:33:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:33:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-16 11:33:34,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=4443, Unknown=70, NotChecked=2280, Total=7310 [2022-09-16 11:33:34,147 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 253 [2022-09-16 11:33:34,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 636 transitions, 5153 flow. Second operand has 86 states, 86 states have (on average 159.0581395348837) internal successors, (13679), 86 states have internal predecessors, (13679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:33:34,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:33:34,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 253 [2022-09-16 11:33:34,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:33:37,471 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_679))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse4)) (.cse5 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_685) (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse5 .cse4))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse2) 2147483647))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse7 1608) 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (<= (select .cse7 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse7 1604) 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse7 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:38,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 1604) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select .cse0 1608) 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_679))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select .cse2 .cse5)) (.cse6 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_682) .cse5 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_685) (= 400 .cse1) (< (+ (select .cse2 .cse3) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse6 .cse5))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse3) 2147483647))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (<= (select .cse8 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse8 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:38,925 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse0 (+ |c_ULTIMATE.start_empty_~q#1.offset| 1604)) (.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_ULTIMATE.start_empty_~q#1.base|)) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| .cse0)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_679))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select .cse2 .cse5)) (.cse6 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_682) .cse5 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_685) (= 400 .cse1) (< (+ (select .cse2 .cse3) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse6 .cse5))) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse3) 2147483647))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= (select .cse8 1608) 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (<= (select .cse9 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (= 0 (select .cse8 .cse0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse9 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:39,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_679))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse4)) (.cse5 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_685) (= 400 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse5 .cse4))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse2) 2147483647))))))) (= |c_~#queue~0.offset| 0) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (let ((.cse7 (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse9 (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))))) (or (and (not .cse7) (= (select .cse8 1608) 0) .cse9 (= (select .cse8 1604) 0)) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base|))) (and .cse7 (= (select .cse10 1608) 0) .cse9 (= (select .cse10 1604) 0) (not (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 1604)) (not (= 1608 |c_ULTIMATE.start_main_~#id1~0#1.offset|)))))) (<= (select .cse8 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse8 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:40,527 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 1608) 0) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (= (select .cse0 1604) 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_680)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse6 .cse5)) (.cse1 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_682) .cse5 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) .cse2) 2147483647) (= .cse3 400) (< (+ .cse3 1) v_ArrVal_685) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse5))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse1 .cse5)))))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:42,216 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (or (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (<= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_680)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (select .cse5 .cse4)) (.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 .cse6 v_ArrVal_682) .cse4 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (= 400 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse4))) (< (+ .cse2 1) v_ArrVal_685) (< (+ (select .cse5 .cse6) 1) v_ArrVal_682) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) (= (select .cse7 1608) 0) (= (select .cse7 1604) 0) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse0 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:44,222 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 .cse1) 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (or (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse1)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse2))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (= (select .cse0 .cse2) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_685 Int) (v_ArrVal_682 Int) (v_ArrVal_680 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_680)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select .cse5 .cse7)) (.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_682) .cse7 v_ArrVal_685)) |c_~#stored_elements~0.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687) |c_~#queue~0.base|))) (or (= 400 .cse3) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_688) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_685) (< (+ (select .cse5 .cse6) 1) v_ArrVal_682) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| (select .cse4 (+ |c_~#queue~0.offset| 1604)))))))))) (<= (select .cse8 (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6) (<= (select .cse8 (+ 1608 |c_~#queue~0.offset|)) 0))) is different from false [2022-09-16 11:33:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 11:33:48,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-16 11:33:48,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-09-16 11:33:48,807 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-09-16 11:33:48,809 INFO L158 Benchmark]: Toolchain (without parser) took 325449.53ms. Allocated memory was 188.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 159.5MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 899.2MB. Max. memory is 8.0GB. [2022-09-16 11:33:48,809 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 188.7MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 11:33:48,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.03ms. Allocated memory was 188.7MB in the beginning and 266.3MB in the end (delta: 77.6MB). Free memory was 159.2MB in the beginning and 216.5MB in the end (delta: -57.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-09-16 11:33:48,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.29ms. Allocated memory is still 266.3MB. Free memory was 216.5MB in the beginning and 213.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 11:33:48,809 INFO L158 Benchmark]: Boogie Preprocessor took 23.00ms. Allocated memory is still 266.3MB. Free memory was 213.4MB in the beginning and 211.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 11:33:48,810 INFO L158 Benchmark]: RCFGBuilder took 557.26ms. Allocated memory is still 266.3MB. Free memory was 211.3MB in the beginning and 190.7MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-09-16 11:33:48,810 INFO L158 Benchmark]: TraceAbstraction took 324267.81ms. Allocated memory was 266.3MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 190.2MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 854.1MB. Max. memory is 8.0GB. [2022-09-16 11:33:48,811 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 188.7MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.03ms. Allocated memory was 188.7MB in the beginning and 266.3MB in the end (delta: 77.6MB). Free memory was 159.2MB in the beginning and 216.5MB in the end (delta: -57.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.29ms. Allocated memory is still 266.3MB. Free memory was 216.5MB in the beginning and 213.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.00ms. Allocated memory is still 266.3MB. Free memory was 213.4MB in the beginning and 211.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 557.26ms. Allocated memory is still 266.3MB. Free memory was 211.3MB in the beginning and 190.7MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 324267.81ms. Allocated memory was 266.3MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 190.2MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 854.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-09-16 11:33:49,027 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-09-16 11:33:49,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...