./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 12:34:16,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 12:34:16,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 12:34:16,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 12:34:16,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 12:34:16,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 12:34:16,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 12:34:16,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 12:34:16,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 12:34:16,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 12:34:16,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 12:34:16,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 12:34:16,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 12:34:16,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 12:34:16,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 12:34:16,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 12:34:16,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 12:34:16,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 12:34:16,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 12:34:16,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 12:34:16,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 12:34:16,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 12:34:16,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 12:34:16,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 12:34:16,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 12:34:16,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 12:34:16,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 12:34:16,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 12:34:16,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 12:34:16,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 12:34:16,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 12:34:16,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 12:34:16,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 12:34:16,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 12:34:16,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 12:34:16,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 12:34:16,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 12:34:16,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 12:34:16,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 12:34:16,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 12:34:16,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 12:34:16,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 12:34:16,139 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 12:34:16,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 12:34:16,140 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 12:34:16,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 12:34:16,141 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 12:34:16,141 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 12:34:16,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 12:34:16,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 12:34:16,141 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 12:34:16,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 12:34:16,142 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 12:34:16,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 12:34:16,143 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 12:34:16,144 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 12:34:16,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 12:34:16,144 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 12:34:16,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 12:34:16,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 12:34:16,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 12:34:16,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 12:34:16,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 12:34:16,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 12:34:16,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 12:34:16,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 12:34:16,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 12:34:16,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 12:34:16,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 12:34:16,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 12:34:16,146 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 12:34:16,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 12:34:16,146 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 12:34:16,146 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 12:34:16,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 12:34:16,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 12:34:16,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 12:34:16,370 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 12:34:16,371 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 12:34:16,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-30 12:34:17,326 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 12:34:17,542 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 12:34:17,542 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-30 12:34:17,560 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114974d33/fc1014fe78f74427ae592f86560b7101/FLAG08fb1e702 [2023-08-30 12:34:17,569 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114974d33/fc1014fe78f74427ae592f86560b7101 [2023-08-30 12:34:17,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 12:34:17,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 12:34:17,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 12:34:17,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 12:34:17,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 12:34:17,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:17,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fdbf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17, skipping insertion in model container [2023-08-30 12:34:17,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:17,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 12:34:17,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 12:34:17,896 WARN L247 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.i[43266,43279] [2023-08-30 12:34:17,898 WARN L247 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.i[43543,43556] [2023-08-30 12:34:17,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 12:34:17,907 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 12:34:17,939 WARN L247 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.i[43266,43279] [2023-08-30 12:34:17,941 WARN L247 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.i[43543,43556] [2023-08-30 12:34:17,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 12:34:17,981 INFO L208 MainTranslator]: Completed translation [2023-08-30 12:34:17,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17 WrapperNode [2023-08-30 12:34:17,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 12:34:17,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 12:34:17,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 12:34:17,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 12:34:17,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:17,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,017 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-08-30 12:34:18,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 12:34:18,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 12:34:18,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 12:34:18,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 12:34:18,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 12:34:18,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 12:34:18,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 12:34:18,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 12:34:18,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (1/1) ... [2023-08-30 12:34:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 12:34:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:18,075 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) [2023-08-30 12:34:18,078 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 [2023-08-30 12:34:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 12:34:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 12:34:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 12:34:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 12:34:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 12:34:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 12:34:18,115 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 12:34:18,255 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 12:34:18,257 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 12:34:18,558 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 12:34:18,565 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 12:34:18,566 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 12:34:18,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:34:18 BoogieIcfgContainer [2023-08-30 12:34:18,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 12:34:18,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 12:34:18,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 12:34:18,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 12:34:18,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 12:34:17" (1/3) ... [2023-08-30 12:34:18,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5171c195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:34:18, skipping insertion in model container [2023-08-30 12:34:18,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:17" (2/3) ... [2023-08-30 12:34:18,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5171c195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:34:18, skipping insertion in model container [2023-08-30 12:34:18,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:34:18" (3/3) ... [2023-08-30 12:34:18,573 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-30 12:34:18,578 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 12:34:18,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 12:34:18,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 12:34:18,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 12:34:18,699 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 12:34:18,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 12:34:18,819 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-08-30 12:34:18,820 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 12:34:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 236 events. 13/236 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-08-30 12:34:18,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 12:34:18,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:18,837 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 12:34:18,850 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:18,852 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:18,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:18,903 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-08-30 12:34:18,904 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 12:34:18,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 227 events. 13/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-08-30 12:34:18,912 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-08-30 12:34:25,205 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-08-30 12:34:25,205 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-08-30 12:34:25,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 12:34:25,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41bfe482, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 12:34:25,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 12:34:25,226 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 12:34:25,226 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 12:34:25,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:25,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:25,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:25,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-08-30 12:34:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103273834] [2023-08-30 12:34:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:26,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:26,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103273834] [2023-08-30 12:34:26,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103273834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:26,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:26,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171164481] [2023-08-30 12:34:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:26,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 12:34:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 12:34:26,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 12:34:26,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 12:34:26,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:26,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:26,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 12:34:26,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:27,143 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-08-30 12:34:27,143 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 12:34:27,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2384 events. 1447/2384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11890 event pairs, 1050 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 4563. Up to 2313 conditions per place. [2023-08-30 12:34:27,153 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-08-30 12:34:27,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-08-30 12:34:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-30 12:34:27,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-08-30 12:34:27,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-30 12:34:27,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-30 12:34:27,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:27,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-30 12:34:27,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:27,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:27,179 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:27,180 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-08-30 12:34:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-08-30 12:34:27,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 12:34:27,184 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-08-30 12:34:27,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-30 12:34:27,188 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-30 12:34:27,188 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-08-30 12:34:27,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:27,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:27,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:27,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 12:34:27,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:27,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-08-30 12:34:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085734576] [2023-08-30 12:34:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085734576] [2023-08-30 12:34:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085734576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:27,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620994013] [2023-08-30 12:34:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:27,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:27,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:28,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:28,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:28,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:28,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:28,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:28,848 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-08-30 12:34:28,848 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-08-30 12:34:28,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3185 events. 1909/3185 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17548 event pairs, 356 based on Foata normal form. 0/2452 useless extension candidates. Maximal degree in co-relation 4972. Up to 2371 conditions per place. [2023-08-30 12:34:28,858 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-08-30 12:34:28,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-08-30 12:34:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-08-30 12:34:28,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-08-30 12:34:28,861 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-08-30 12:34:28,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-08-30 12:34:28,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:28,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-08-30 12:34:28,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:28,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:28,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:28,868 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-08-30 12:34:28,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-08-30 12:34:28,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:28,886 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-08-30 12:34:28,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-08-30 12:34:28,887 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-08-30 12:34:28,887 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-08-30 12:34:28,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:28,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:28,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:28,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 12:34:28,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:28,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-08-30 12:34:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041120937] [2023-08-30 12:34:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:29,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:29,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041120937] [2023-08-30 12:34:29,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041120937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:29,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318587390] [2023-08-30 12:34:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:29,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:29,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 12:34:29,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:29,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:29,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 12:34:29,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:29,760 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-08-30 12:34:29,761 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-08-30 12:34:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 3425 events. 2048/3425 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19054 event pairs, 410 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 6211. Up to 2404 conditions per place. [2023-08-30 12:34:29,784 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-08-30 12:34:29,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-08-30 12:34:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 12:34:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 12:34:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-08-30 12:34:29,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-08-30 12:34:29,787 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-08-30 12:34:29,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-08-30 12:34:29,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:29,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-08-30 12:34:29,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:29,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:29,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:29,794 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-08-30 12:34:29,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-08-30 12:34:29,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 658 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:29,804 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-08-30 12:34:29,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2023-08-30 12:34:29,805 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-08-30 12:34:29,805 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-08-30 12:34:29,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:29,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:29,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:29,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 12:34:29,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:29,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-08-30 12:34:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059425796] [2023-08-30 12:34:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:29,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059425796] [2023-08-30 12:34:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059425796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:29,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958715010] [2023-08-30 12:34:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:29,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 12:34:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:29,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 12:34:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 12:34:29,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-08-30 12:34:29,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:29,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:29,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-08-30 12:34:29,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:30,311 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-08-30 12:34:30,312 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-08-30 12:34:30,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5521 events. 3360/5521 cut-off events. For 2431/2471 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33384 event pairs, 1505 based on Foata normal form. 40/4211 useless extension candidates. Maximal degree in co-relation 10283. Up to 3250 conditions per place. [2023-08-30 12:34:30,332 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-08-30 12:34:30,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-08-30 12:34:30,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 12:34:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 12:34:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-30 12:34:30,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-08-30 12:34:30,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-30 12:34:30,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-30 12:34:30,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:30,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-30 12:34:30,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:30,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:30,343 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:30,343 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-08-30 12:34:30,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-08-30 12:34:30,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 163 transitions, 940 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:30,350 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-08-30 12:34:30,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2023-08-30 12:34:30,351 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-08-30 12:34:30,351 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-08-30 12:34:30,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:30,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:30,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:30,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 12:34:30,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:30,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-08-30 12:34:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212176753] [2023-08-30 12:34:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212176753] [2023-08-30 12:34:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212176753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:30,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062791858] [2023-08-30 12:34:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:30,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 12:34:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 12:34:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 12:34:31,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 12:34:31,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:31,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:31,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 12:34:31,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:31,612 INFO L130 PetriNetUnfolder]: 3404/5688 cut-off events. [2023-08-30 12:34:31,612 INFO L131 PetriNetUnfolder]: For 2514/2522 co-relation queries the response was YES. [2023-08-30 12:34:31,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13911 conditions, 5688 events. 3404/5688 cut-off events. For 2514/2522 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34241 event pairs, 2258 based on Foata normal form. 0/4577 useless extension candidates. Maximal degree in co-relation 9525. Up to 5474 conditions per place. [2023-08-30 12:34:31,639 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-08-30 12:34:31,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 92 transitions, 554 flow [2023-08-30 12:34:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2023-08-30 12:34:31,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974016332590943 [2023-08-30 12:34:31,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1340 transitions. [2023-08-30 12:34:31,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1340 transitions. [2023-08-30 12:34:31,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:31,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1340 transitions. [2023-08-30 12:34:31,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:31,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:31,648 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:31,648 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 6 states and 1340 transitions. [2023-08-30 12:34:31,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 92 transitions, 554 flow [2023-08-30 12:34:31,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 552 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:34:31,655 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 404 flow [2023-08-30 12:34:31,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2023-08-30 12:34:31,657 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-08-30 12:34:31,657 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 404 flow [2023-08-30 12:34:31,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:31,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:31,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:31,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 12:34:31,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:31,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-08-30 12:34:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:31,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299653192] [2023-08-30 12:34:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299653192] [2023-08-30 12:34:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299653192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059512539] [2023-08-30 12:34:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:32,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:32,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:32,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 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) [2023-08-30 12:34:32,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:32,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:32,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:33,669 INFO L130 PetriNetUnfolder]: 3697/6100 cut-off events. [2023-08-30 12:34:33,669 INFO L131 PetriNetUnfolder]: For 1866/1896 co-relation queries the response was YES. [2023-08-30 12:34:33,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15145 conditions, 6100 events. 3697/6100 cut-off events. For 1866/1896 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 37242 event pairs, 626 based on Foata normal form. 94/5216 useless extension candidates. Maximal degree in co-relation 11952. Up to 4451 conditions per place. [2023-08-30 12:34:33,700 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 141 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2023-08-30 12:34:33,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 168 transitions, 969 flow [2023-08-30 12:34:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1393 transitions. [2023-08-30 12:34:33,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170749814402376 [2023-08-30 12:34:33,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1393 transitions. [2023-08-30 12:34:33,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1393 transitions. [2023-08-30 12:34:33,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:33,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1393 transitions. [2023-08-30 12:34:33,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.16666666666666) internal successors, (1393), 6 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:33,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:33,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:33,709 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 404 flow. Second operand 6 states and 1393 transitions. [2023-08-30 12:34:33,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 168 transitions, 969 flow [2023-08-30 12:34:33,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 953 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 12:34:33,728 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 456 flow [2023-08-30 12:34:33,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-08-30 12:34:33,732 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-08-30 12:34:33,732 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 456 flow [2023-08-30 12:34:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 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) [2023-08-30 12:34:33,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:33,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:33,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 12:34:33,733 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:33,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1523080992, now seen corresponding path program 1 times [2023-08-30 12:34:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:33,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955643103] [2023-08-30 12:34:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955643103] [2023-08-30 12:34:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955643103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973870490] [2023-08-30 12:34:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:34,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 12:34:34,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:34,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 12:34:34,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:34,708 INFO L130 PetriNetUnfolder]: 3933/6511 cut-off events. [2023-08-30 12:34:34,708 INFO L131 PetriNetUnfolder]: For 3371/3393 co-relation queries the response was YES. [2023-08-30 12:34:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16861 conditions, 6511 events. 3933/6511 cut-off events. For 3371/3393 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 39424 event pairs, 722 based on Foata normal form. 94/5591 useless extension candidates. Maximal degree in co-relation 12673. Up to 4119 conditions per place. [2023-08-30 12:34:34,733 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 126 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2023-08-30 12:34:34,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 939 flow [2023-08-30 12:34:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 12:34:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 12:34:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1170 transitions. [2023-08-30 12:34:34,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211581291759465 [2023-08-30 12:34:34,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1170 transitions. [2023-08-30 12:34:34,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1170 transitions. [2023-08-30 12:34:34,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:34,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1170 transitions. [2023-08-30 12:34:34,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,741 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 456 flow. Second operand 5 states and 1170 transitions. [2023-08-30 12:34:34,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 939 flow [2023-08-30 12:34:34,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 907 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 12:34:34,762 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 497 flow [2023-08-30 12:34:34,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=497, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-30 12:34:34,762 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-08-30 12:34:34,762 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 497 flow [2023-08-30 12:34:34,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:34,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:34,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 12:34:34,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:34,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-08-30 12:34:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:34,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618838355] [2023-08-30 12:34:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618838355] [2023-08-30 12:34:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618838355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:34,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:34,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:34:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558938690] [2023-08-30 12:34:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:34:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:34:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:34:34,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:34:34,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:34,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:34:34,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:34,929 INFO L130 PetriNetUnfolder]: 716/1428 cut-off events. [2023-08-30 12:34:34,929 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-08-30 12:34:34,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1428 events. 716/1428 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8101 event pairs, 457 based on Foata normal form. 64/1344 useless extension candidates. Maximal degree in co-relation 2930. Up to 761 conditions per place. [2023-08-30 12:34:34,934 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 73 selfloop transitions, 2 changer transitions 6/90 dead transitions. [2023-08-30 12:34:34,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 595 flow [2023-08-30 12:34:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:34:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:34:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-08-30 12:34:34,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-08-30 12:34:34,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-08-30 12:34:34,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-08-30 12:34:34,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:34,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-08-30 12:34:34,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,940 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 497 flow. Second operand 3 states and 725 transitions. [2023-08-30 12:34:34,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 595 flow [2023-08-30 12:34:34,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 573 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 12:34:34,943 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:34,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-08-30 12:34:34,945 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-08-30 12:34:34,945 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:34,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:34,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:34,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 12:34:34,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:34,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -240537722, now seen corresponding path program 1 times [2023-08-30 12:34:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159588522] [2023-08-30 12:34:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:34,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159588522] [2023-08-30 12:34:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159588522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:34,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:34,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:34:34,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280224538] [2023-08-30 12:34:34,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:34,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:34:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:34,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:34:34,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:34:34,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 12:34:34,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:34,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:34,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 12:34:34,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:35,086 INFO L130 PetriNetUnfolder]: 528/1058 cut-off events. [2023-08-30 12:34:35,087 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-08-30 12:34:35,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1058 events. 528/1058 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5246 event pairs, 390 based on Foata normal form. 8/948 useless extension candidates. Maximal degree in co-relation 2085. Up to 780 conditions per place. [2023-08-30 12:34:35,091 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 75 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 12:34:35,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 560 flow [2023-08-30 12:34:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:34:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:34:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-08-30 12:34:35,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-08-30 12:34:35,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-08-30 12:34:35,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-08-30 12:34:35,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:35,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-08-30 12:34:35,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:35,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:35,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:35,097 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 3 states and 732 transitions. [2023-08-30 12:34:35,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 560 flow [2023-08-30 12:34:35,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 552 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 12:34:35,101 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:35,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-08-30 12:34:35,102 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2023-08-30 12:34:35,102 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 387 flow [2023-08-30 12:34:35,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:35,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:35,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:35,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 12:34:35,104 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:35,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-08-30 12:34:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:35,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965043265] [2023-08-30 12:34:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:35,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965043265] [2023-08-30 12:34:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965043265] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:34:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423408445] [2023-08-30 12:34:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:34:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:35,363 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) [2023-08-30 12:34:35,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 12:34:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:35,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 12:34:35,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:34:35,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:35,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:35,561 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:34:35,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:34:35,570 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 12:34:35,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 12:34:35,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 12:34:35,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-30 12:34:35,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-30 12:34:35,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:35,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:34:36,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 12:34:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:36,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:34:36,176 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_373) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2023-08-30 12:34:36,202 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2023-08-30 12:34:36,289 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (+ v_ArrVal_372 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) (+ 88 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373))))) is different from false [2023-08-30 12:34:38,401 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_369)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_372) .cse3 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_376) .cse1) 2147483650)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_373) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ v_ArrVal_372 2147483648) 0)))))) is different from false [2023-08-30 12:34:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:34:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423408445] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:34:38,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:34:38,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-30 12:34:38,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314486405] [2023-08-30 12:34:38,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:34:38,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 12:34:38,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 12:34:38,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=487, Unknown=14, NotChecked=204, Total=870 [2023-08-30 12:34:38,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-08-30 12:34:38,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 387 flow. Second operand has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:38,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:38,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-08-30 12:34:38,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:50,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:34:52,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:34:53,366 INFO L130 PetriNetUnfolder]: 1225/2416 cut-off events. [2023-08-30 12:34:53,366 INFO L131 PetriNetUnfolder]: For 770/770 co-relation queries the response was YES. [2023-08-30 12:34:53,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2416 events. 1225/2416 cut-off events. For 770/770 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14582 event pairs, 542 based on Foata normal form. 1/2130 useless extension candidates. Maximal degree in co-relation 4415. Up to 808 conditions per place. [2023-08-30 12:34:53,376 INFO L137 encePairwiseOnDemand]: 424/449 looper letters, 145 selfloop transitions, 74 changer transitions 4/229 dead transitions. [2023-08-30 12:34:53,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 229 transitions, 1355 flow [2023-08-30 12:34:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 12:34:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 12:34:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4798 transitions. [2023-08-30 12:34:53,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39577662294811516 [2023-08-30 12:34:53,385 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4798 transitions. [2023-08-30 12:34:53,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4798 transitions. [2023-08-30 12:34:53,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:53,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4798 transitions. [2023-08-30 12:34:53,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 177.7037037037037) internal successors, (4798), 27 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:53,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:53,403 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:53,403 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 387 flow. Second operand 27 states and 4798 transitions. [2023-08-30 12:34:53,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 229 transitions, 1355 flow [2023-08-30 12:34:53,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 229 transitions, 1350 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:34:53,409 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 877 flow [2023-08-30 12:34:53,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=877, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2023-08-30 12:34:53,409 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places. [2023-08-30 12:34:53,409 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 877 flow [2023-08-30 12:34:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:34:53,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:53,411 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:53,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 12:34:53,617 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,SelfDestructingSolverStorable9 [2023-08-30 12:34:53,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:53,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:53,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 1 times [2023-08-30 12:34:53,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:53,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172775393] [2023-08-30 12:34:53,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:53,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:54,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172775393] [2023-08-30 12:34:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172775393] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:34:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72116634] [2023-08-30 12:34:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:34:54,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:54,308 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) [2023-08-30 12:34:54,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 12:34:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 12:34:54,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:34:54,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:54,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:54,432 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:34:54,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:34:54,447 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:34:54,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:34:54,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 12:34:54,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-30 12:34:54,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-30 12:34:54,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:54,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:34:54,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:34:55,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 12:34:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:55,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:34:55,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-08-30 12:34:55,221 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-08-30 12:35:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72116634] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:35:12,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:35:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 12:35:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405584758] [2023-08-30 12:35:12,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:35:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 12:35:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:35:12,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 12:35:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=788, Unknown=29, NotChecked=126, Total=1190 [2023-08-30 12:35:12,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:35:12,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 877 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:35:12,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:35:12,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:35:12,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:35:24,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:35:29,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:35:31,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:35:33,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:35:35,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:35:38,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:35:40,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:35:40,133 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_476 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_476)))) (forall ((v_ArrVal_476 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_476)) |c_~#stored_elements~0.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_478) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_476) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_479) .cse2) 2147483647)))))) is different from false [2023-08-30 12:35:42,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:35:44,931 INFO L130 PetriNetUnfolder]: 2425/4790 cut-off events. [2023-08-30 12:35:44,931 INFO L131 PetriNetUnfolder]: For 3214/3254 co-relation queries the response was YES. [2023-08-30 12:35:44,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13916 conditions, 4790 events. 2425/4790 cut-off events. For 3214/3254 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 34107 event pairs, 815 based on Foata normal form. 0/4323 useless extension candidates. Maximal degree in co-relation 12734. Up to 1976 conditions per place. [2023-08-30 12:35:44,952 INFO L137 encePairwiseOnDemand]: 427/449 looper letters, 253 selfloop transitions, 101 changer transitions 3/363 dead transitions. [2023-08-30 12:35:44,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 363 transitions, 2663 flow [2023-08-30 12:35:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-30 12:35:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-30 12:35:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5296 transitions. [2023-08-30 12:35:44,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39317000742390495 [2023-08-30 12:35:44,962 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5296 transitions. [2023-08-30 12:35:44,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5296 transitions. [2023-08-30 12:35:44,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:35:44,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5296 transitions. [2023-08-30 12:35:44,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 176.53333333333333) internal successors, (5296), 30 states have internal predecessors, (5296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:35:44,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 449.0) internal successors, (13919), 31 states have internal predecessors, (13919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:35:44,982 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 449.0) internal successors, (13919), 31 states have internal predecessors, (13919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:35:44,982 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 877 flow. Second operand 30 states and 5296 transitions. [2023-08-30 12:35:44,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 363 transitions, 2663 flow [2023-08-30 12:35:44,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 363 transitions, 2488 flow, removed 69 selfloop flow, removed 11 redundant places. [2023-08-30 12:35:44,999 INFO L231 Difference]: Finished difference. Result has 156 places, 195 transitions, 1485 flow [2023-08-30 12:35:44,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1485, PETRI_PLACES=156, PETRI_TRANSITIONS=195} [2023-08-30 12:35:45,000 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 99 predicate places. [2023-08-30 12:35:45,000 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 195 transitions, 1485 flow [2023-08-30 12:35:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:35:45,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:35:45,001 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:35:45,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 12:35:45,213 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,SelfDestructingSolverStorable10 [2023-08-30 12:35:45,213 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:35:45,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:35:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 444195113, now seen corresponding path program 1 times [2023-08-30 12:35:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:35:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974150820] [2023-08-30 12:35:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:35:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:35:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974150820] [2023-08-30 12:35:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974150820] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:35:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766051297] [2023-08-30 12:35:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:45,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:35:45,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:35:45,517 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) [2023-08-30 12:35:45,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 12:35:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:45,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-30 12:35:45,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:35:45,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:45,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:45,642 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:35:45,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:35:45,658 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:35:45,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:35:45,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 12:35:45,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-30 12:35:45,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-30 12:35:46,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-30 12:35:46,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:46,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:35:46,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 12:35:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:46,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:35:46,424 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_579)))))) is different from false [2023-08-30 12:35:46,457 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< v_ArrVal_576 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2023-08-30 12:35:46,479 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ v_ArrVal_576 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 12:35:46,504 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_575 Int) (v_ArrVal_583 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_575) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_579)) |c_~#stored_elements~0.base| v_ArrVal_581) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_576 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_579) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_583) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))) is different from false [2023-08-30 12:35:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:35:46,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766051297] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:35:46,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:35:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2023-08-30 12:35:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043663180] [2023-08-30 12:35:46,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:35:46,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 12:35:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:35:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 12:35:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=602, Unknown=29, NotChecked=228, Total=1056 [2023-08-30 12:35:46,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 449 [2023-08-30 12:35:46,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 195 transitions, 1485 flow. Second operand has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:35:46,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:35:46,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 449 [2023-08-30 12:35:46,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:06,102 INFO L130 PetriNetUnfolder]: 3402/6720 cut-off events. [2023-08-30 12:36:06,102 INFO L131 PetriNetUnfolder]: For 27055/27113 co-relation queries the response was YES. [2023-08-30 12:36:06,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27891 conditions, 6720 events. 3402/6720 cut-off events. For 27055/27113 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 48796 event pairs, 1055 based on Foata normal form. 102/6229 useless extension candidates. Maximal degree in co-relation 27573. Up to 2144 conditions per place. [2023-08-30 12:36:06,143 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 293 selfloop transitions, 137 changer transitions 3/439 dead transitions. [2023-08-30 12:36:06,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 439 transitions, 4401 flow [2023-08-30 12:36:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-30 12:36:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-30 12:36:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5451 transitions. [2023-08-30 12:36:06,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3916229614196422 [2023-08-30 12:36:06,151 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5451 transitions. [2023-08-30 12:36:06,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5451 transitions. [2023-08-30 12:36:06,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:06,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5451 transitions. [2023-08-30 12:36:06,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 175.83870967741936) internal successors, (5451), 31 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:06,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:06,227 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:06,227 INFO L175 Difference]: Start difference. First operand has 156 places, 195 transitions, 1485 flow. Second operand 31 states and 5451 transitions. [2023-08-30 12:36:06,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 439 transitions, 4401 flow [2023-08-30 12:36:06,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 439 transitions, 4182 flow, removed 81 selfloop flow, removed 9 redundant places. [2023-08-30 12:36:06,276 INFO L231 Difference]: Finished difference. Result has 185 places, 253 transitions, 2263 flow [2023-08-30 12:36:06,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2263, PETRI_PLACES=185, PETRI_TRANSITIONS=253} [2023-08-30 12:36:06,276 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 128 predicate places. [2023-08-30 12:36:06,277 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 253 transitions, 2263 flow [2023-08-30 12:36:06,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:06,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:06,278 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:06,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 12:36:06,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:06,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:06,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 2 times [2023-08-30 12:36:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:06,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342363936] [2023-08-30 12:36:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342363936] [2023-08-30 12:36:07,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342363936] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895164368] [2023-08-30 12:36:07,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 12:36:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:07,089 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) [2023-08-30 12:36:07,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 12:36:07,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 12:36:07,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:36:07,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-30 12:36:07,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:07,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:07,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:07,246 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:36:07,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:36:07,260 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:36:07,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:36:07,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-08-30 12:36:07,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-08-30 12:36:07,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2023-08-30 12:36:07,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:07,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-30 12:36:07,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-08-30 12:36:07,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2023-08-30 12:36:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:07,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:07,804 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-30 12:36:07,877 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|))))) is different from false [2023-08-30 12:36:07,890 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_681))))) is different from false [2023-08-30 12:36:07,976 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse3 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_681) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_679)))))) is different from false [2023-08-30 12:36:08,077 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_686 (Array Int 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_677)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_679) .cse1 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_681) (< (+ (select .cse0 .cse2) 1) v_ArrVal_679) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-30 12:36:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 12:36:15,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895164368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:15,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:15,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 12:36:15,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567998562] [2023-08-30 12:36:15,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:15,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 12:36:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 12:36:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=622, Unknown=27, NotChecked=300, Total=1190 [2023-08-30 12:36:16,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:36:16,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 253 transitions, 2263 flow. Second operand has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:16,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:16,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:36:16,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:27,653 WARN L222 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:36:29,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:36:31,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:36:34,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:35,972 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_681))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_681 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_681)) |c_~#stored_elements~0.base| v_ArrVal_683))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_681))))))) is different from false [2023-08-30 12:36:37,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:39,674 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_685 Int) (v_ArrVal_686 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 2147483647)) (< (select .cse0 .cse1) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_685 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_685)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))))) is different from false [2023-08-30 12:36:40,817 INFO L130 PetriNetUnfolder]: 4108/8125 cut-off events. [2023-08-30 12:36:40,817 INFO L131 PetriNetUnfolder]: For 100891/101017 co-relation queries the response was YES. [2023-08-30 12:36:40,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44689 conditions, 8125 events. 4108/8125 cut-off events. For 100891/101017 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 61101 event pairs, 1717 based on Foata normal form. 22/7437 useless extension candidates. Maximal degree in co-relation 44309. Up to 4907 conditions per place. [2023-08-30 12:36:40,931 INFO L137 encePairwiseOnDemand]: 431/449 looper letters, 305 selfloop transitions, 121 changer transitions 3/435 dead transitions. [2023-08-30 12:36:40,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 435 transitions, 5583 flow [2023-08-30 12:36:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 12:36:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 12:36:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4056 transitions. [2023-08-30 12:36:40,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3927568509731771 [2023-08-30 12:36:40,935 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4056 transitions. [2023-08-30 12:36:40,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4056 transitions. [2023-08-30 12:36:40,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:40,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4056 transitions. [2023-08-30 12:36:40,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 176.34782608695653) internal successors, (4056), 23 states have internal predecessors, (4056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:40,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 449.0) internal successors, (10776), 24 states have internal predecessors, (10776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:40,946 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 449.0) internal successors, (10776), 24 states have internal predecessors, (10776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:40,946 INFO L175 Difference]: Start difference. First operand has 185 places, 253 transitions, 2263 flow. Second operand 23 states and 4056 transitions. [2023-08-30 12:36:40,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 435 transitions, 5583 flow [2023-08-30 12:36:40,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 435 transitions, 4967 flow, removed 241 selfloop flow, removed 15 redundant places. [2023-08-30 12:36:40,998 INFO L231 Difference]: Finished difference. Result has 207 places, 312 transitions, 3032 flow [2023-08-30 12:36:40,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3032, PETRI_PLACES=207, PETRI_TRANSITIONS=312} [2023-08-30 12:36:40,999 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 150 predicate places. [2023-08-30 12:36:40,999 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 312 transitions, 3032 flow [2023-08-30 12:36:41,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 168.37142857142857) internal successors, (5893), 35 states have internal predecessors, (5893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:41,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:41,000 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:41,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 12:36:41,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:41,205 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:41,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 321344069, now seen corresponding path program 1 times [2023-08-30 12:36:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300604474] [2023-08-30 12:36:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300604474] [2023-08-30 12:36:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300604474] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801540264] [2023-08-30 12:36:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:41,774 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) [2023-08-30 12:36:41,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 12:36:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:41,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-30 12:36:41,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:41,900 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:36:41,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:36:42,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 12:36:42,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:42,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 12:36:42,094 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 12:36:42,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-30 12:36:42,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 12:36:42,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 12:36:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:42,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:42,217 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_777 Int)) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_778) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-08-30 12:36:42,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:36:42,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2023-08-30 12:36:42,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:36:42,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 97 [2023-08-30 12:36:42,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-08-30 12:36:42,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2023-08-30 12:36:42,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-08-30 12:36:42,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:36:42,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2023-08-30 12:36:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:36:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801540264] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:42,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 24 [2023-08-30 12:36:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381495919] [2023-08-30 12:36:42,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:42,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 12:36:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 12:36:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=494, Unknown=5, NotChecked=46, Total=650 [2023-08-30 12:36:42,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 449 [2023-08-30 12:36:42,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 312 transitions, 3032 flow. Second operand has 26 states, 26 states have (on average 174.19230769230768) internal successors, (4529), 26 states have internal predecessors, (4529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:42,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:42,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 449 [2023-08-30 12:36:42,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:44,140 INFO L130 PetriNetUnfolder]: 4072/8098 cut-off events. [2023-08-30 12:36:44,141 INFO L131 PetriNetUnfolder]: For 166284/166450 co-relation queries the response was YES. [2023-08-30 12:36:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50526 conditions, 8098 events. 4072/8098 cut-off events. For 166284/166450 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 61258 event pairs, 1484 based on Foata normal form. 110/7495 useless extension candidates. Maximal degree in co-relation 50166. Up to 3426 conditions per place. [2023-08-30 12:36:44,194 INFO L137 encePairwiseOnDemand]: 437/449 looper letters, 319 selfloop transitions, 62 changer transitions 3/390 dead transitions. [2023-08-30 12:36:44,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 390 transitions, 4811 flow [2023-08-30 12:36:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 12:36:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 12:36:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2038 transitions. [2023-08-30 12:36:44,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126341364648714 [2023-08-30 12:36:44,196 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2038 transitions. [2023-08-30 12:36:44,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2038 transitions. [2023-08-30 12:36:44,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:44,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2038 transitions. [2023-08-30 12:36:44,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 185.27272727272728) internal successors, (2038), 11 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:44,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 449.0) internal successors, (5388), 12 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:44,201 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 449.0) internal successors, (5388), 12 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:44,201 INFO L175 Difference]: Start difference. First operand has 207 places, 312 transitions, 3032 flow. Second operand 11 states and 2038 transitions. [2023-08-30 12:36:44,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 390 transitions, 4811 flow [2023-08-30 12:36:44,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 390 transitions, 4536 flow, removed 128 selfloop flow, removed 3 redundant places. [2023-08-30 12:36:44,263 INFO L231 Difference]: Finished difference. Result has 215 places, 304 transitions, 2881 flow [2023-08-30 12:36:44,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2651, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2881, PETRI_PLACES=215, PETRI_TRANSITIONS=304} [2023-08-30 12:36:44,264 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 158 predicate places. [2023-08-30 12:36:44,264 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 304 transitions, 2881 flow [2023-08-30 12:36:44,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 174.19230769230768) internal successors, (4529), 26 states have internal predecessors, (4529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:44,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:44,265 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:44,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 12:36:44,469 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,SelfDestructingSolverStorable13 [2023-08-30 12:36:44,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:44,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash -660856952, now seen corresponding path program 1 times [2023-08-30 12:36:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612505046] [2023-08-30 12:36:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612505046] [2023-08-30 12:36:44,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612505046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:36:44,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:36:44,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:36:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737801532] [2023-08-30 12:36:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:36:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:36:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:36:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:36:44,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 12:36:44,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 304 transitions, 2881 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:44,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:44,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 12:36:44,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:45,571 INFO L130 PetriNetUnfolder]: 3952/7918 cut-off events. [2023-08-30 12:36:45,572 INFO L131 PetriNetUnfolder]: For 162953/163047 co-relation queries the response was YES. [2023-08-30 12:36:45,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48987 conditions, 7918 events. 3952/7918 cut-off events. For 162953/163047 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 60228 event pairs, 2216 based on Foata normal form. 12/7284 useless extension candidates. Maximal degree in co-relation 48732. Up to 7199 conditions per place. [2023-08-30 12:36:45,627 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 275 selfloop transitions, 1 changer transitions 3/306 dead transitions. [2023-08-30 12:36:45,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 306 transitions, 3505 flow [2023-08-30 12:36:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:36:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:36:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-08-30 12:36:45,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-08-30 12:36:45,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-08-30 12:36:45,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-08-30 12:36:45,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:45,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-08-30 12:36:45,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:45,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:45,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:45,631 INFO L175 Difference]: Start difference. First operand has 215 places, 304 transitions, 2881 flow. Second operand 3 states and 723 transitions. [2023-08-30 12:36:45,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 306 transitions, 3505 flow [2023-08-30 12:36:45,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 306 transitions, 3452 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-30 12:36:45,739 INFO L231 Difference]: Finished difference. Result has 209 places, 298 transitions, 2771 flow [2023-08-30 12:36:45,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2769, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2771, PETRI_PLACES=209, PETRI_TRANSITIONS=298} [2023-08-30 12:36:45,740 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 152 predicate places. [2023-08-30 12:36:45,740 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 298 transitions, 2771 flow [2023-08-30 12:36:45,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:45,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:45,740 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:45,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 12:36:45,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:45,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash -660856951, now seen corresponding path program 1 times [2023-08-30 12:36:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137367750] [2023-08-30 12:36:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 12:36:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137367750] [2023-08-30 12:36:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137367750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:36:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:36:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:36:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452841057] [2023-08-30 12:36:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:36:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:36:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:36:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:36:45,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:36:45,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 298 transitions, 2771 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:45,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:45,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:36:45,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:46,798 INFO L130 PetriNetUnfolder]: 3884/7831 cut-off events. [2023-08-30 12:36:46,798 INFO L131 PetriNetUnfolder]: For 157903/158116 co-relation queries the response was YES. [2023-08-30 12:36:46,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47705 conditions, 7831 events. 3884/7831 cut-off events. For 157903/158116 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 59588 event pairs, 2511 based on Foata normal form. 45/7280 useless extension candidates. Maximal degree in co-relation 47524. Up to 5230 conditions per place. [2023-08-30 12:36:46,857 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 245 selfloop transitions, 30 changer transitions 0/302 dead transitions. [2023-08-30 12:36:46,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 302 transitions, 3414 flow [2023-08-30 12:36:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:36:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:36:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-08-30 12:36:46,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532293986636971 [2023-08-30 12:36:46,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-08-30 12:36:46,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-08-30 12:36:46,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:46,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-08-30 12:36:46,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:46,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:46,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:46,861 INFO L175 Difference]: Start difference. First operand has 209 places, 298 transitions, 2771 flow. Second operand 3 states and 717 transitions. [2023-08-30 12:36:46,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 302 transitions, 3414 flow [2023-08-30 12:36:46,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 302 transitions, 3413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:36:46,919 INFO L231 Difference]: Finished difference. Result has 209 places, 292 transitions, 2771 flow [2023-08-30 12:36:46,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2771, PETRI_PLACES=209, PETRI_TRANSITIONS=292} [2023-08-30 12:36:46,920 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 152 predicate places. [2023-08-30 12:36:46,920 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 292 transitions, 2771 flow [2023-08-30 12:36:46,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:46,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:46,920 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] [2023-08-30 12:36:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 12:36:46,921 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:46,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash 855812906, now seen corresponding path program 1 times [2023-08-30 12:36:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:46,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649911301] [2023-08-30 12:36:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649911301] [2023-08-30 12:36:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649911301] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147726553] [2023-08-30 12:36:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:46,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:46,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:46,957 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) [2023-08-30 12:36:46,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 12:36:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:47,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 12:36:47,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:47,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:47,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147726553] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:47,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:47,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 12:36:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340772521] [2023-08-30 12:36:47,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:47,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 12:36:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 12:36:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 12:36:47,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:36:47,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 292 transitions, 2771 flow. Second operand has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:47,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:47,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:36:47,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:47,972 INFO L130 PetriNetUnfolder]: 2791/5606 cut-off events. [2023-08-30 12:36:47,972 INFO L131 PetriNetUnfolder]: For 132179/132276 co-relation queries the response was YES. [2023-08-30 12:36:47,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39969 conditions, 5606 events. 2791/5606 cut-off events. For 132179/132276 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 35905 event pairs, 1359 based on Foata normal form. 137/5422 useless extension candidates. Maximal degree in co-relation 39754. Up to 2499 conditions per place. [2023-08-30 12:36:48,014 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 292 selfloop transitions, 21 changer transitions 0/340 dead transitions. [2023-08-30 12:36:48,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 340 transitions, 4146 flow [2023-08-30 12:36:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:36:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:36:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2023-08-30 12:36:48,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289532293986637 [2023-08-30 12:36:48,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2023-08-30 12:36:48,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2023-08-30 12:36:48,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:48,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2023-08-30 12:36:48,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:48,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:48,018 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:48,018 INFO L175 Difference]: Start difference. First operand has 209 places, 292 transitions, 2771 flow. Second operand 6 states and 1425 transitions. [2023-08-30 12:36:48,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 340 transitions, 4146 flow [2023-08-30 12:36:48,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 340 transitions, 4093 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 12:36:48,062 INFO L231 Difference]: Finished difference. Result has 217 places, 293 transitions, 2854 flow [2023-08-30 12:36:48,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2854, PETRI_PLACES=217, PETRI_TRANSITIONS=293} [2023-08-30 12:36:48,062 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 160 predicate places. [2023-08-30 12:36:48,062 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 293 transitions, 2854 flow [2023-08-30 12:36:48,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:36:48,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:48,063 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:48,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 12:36:48,267 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 [2023-08-30 12:36:48,267 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:48,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 541558942, now seen corresponding path program 3 times [2023-08-30 12:36:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298505477] [2023-08-30 12:36:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:49,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298505477] [2023-08-30 12:36:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298505477] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825419830] [2023-08-30 12:36:49,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 12:36:49,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:49,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:49,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:36:49,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 12:36:49,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 12:36:49,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:36:49,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-30 12:36:49,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:49,585 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:36:49,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:36:49,598 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:36:49,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:36:49,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 12:36:49,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-30 12:36:49,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-30 12:36:49,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:49,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:36:50,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 12:36:50,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-08-30 12:36:50,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-08-30 12:36:50,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-08-30 12:36:51,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:51,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-08-30 12:36:51,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-08-30 12:36:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:56,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:56,605 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1071 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)))) is different from false [2023-08-30 12:36:56,618 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1071 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1068) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)))) is different from false [2023-08-30 12:36:56,720 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1071 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse1 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1068) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1066) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-30 12:36:56,738 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1066) .cse2 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1068) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1066) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-30 12:36:56,759 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1066) .cse2 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1068) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3) 1) v_ArrVal_1066)))))) is different from false [2023-08-30 12:36:56,782 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse3 (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_1063))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse4 v_ArrVal_1066) .cse1 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1068) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1066))))))) is different from false [2023-08-30 12:36:56,808 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1066) .cse1 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1068) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1066) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse4) 2147483647)))))))) is different from false [2023-08-30 12:36:56,831 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1062))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1066) .cse4 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1066) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1068))))))))) is different from false [2023-08-30 12:36:56,876 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1062))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1066) .cse3 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1066) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1061) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1068) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|))))))))) is different from false [2023-08-30 12:36:56,909 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1062))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1066) .cse5 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1066) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1061) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse1) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1068) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|)))))))))) is different from false [2023-08-30 12:36:56,997 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1058 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1058) .cse1 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1062))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1066) .cse5 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1061) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1066) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1058) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse3) 2147483647) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1068)))))))))) is different from false [2023-08-30 12:36:57,047 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1058 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1071 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1058) .cse1 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1062))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1066) .cse6 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1061) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1058) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1066) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse4) 2147483647) (< (+ (select .cse8 .cse6) 1) v_ArrVal_1068)))))))))) is different from false [2023-08-30 12:36:57,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1071 Int) (v_ArrVal_1061 Int) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (v_ArrVal_1068 Int) (v_ArrVal_1056 Int) (v_ArrVal_1058 Int)) (let ((.cse2 (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_1056)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse8 v_ArrVal_1058) .cse3 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1062))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_1063))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1065))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1066) .cse1 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1068) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1061) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse6) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (< (+ (select .cse7 .cse6) 1) v_ArrVal_1066) (< (+ (select .cse2 .cse8) 1) v_ArrVal_1058)))))))))) is different from false [2023-08-30 12:37:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-30 12:37:01,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825419830] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:01,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:01,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-30 12:37:01,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538980238] [2023-08-30 12:37:01,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:01,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-30 12:37:01,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:01,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-30 12:37:01,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1251, Unknown=17, NotChecked=1170, Total=2862 [2023-08-30 12:37:01,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:37:01,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 293 transitions, 2854 flow. Second operand has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:37:01,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:01,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:37:01,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:09,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:37:14,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:37:30,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:32,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:34,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:36,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:38,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:40,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:42,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:44,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:46,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:48,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:50,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:37:52,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:05,811 WARN L222 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 156 DAG size of output: 144 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:38:14,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:32,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:34,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:36,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:38,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:40,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:42,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:44,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:46,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:48,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:50,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:52,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:54,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:56,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:38:59,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:39:24,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:39:26,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:39:31,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:39:38,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:39:46,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:39:55,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:39:57,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:39:59,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:01,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:15,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:40:17,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:40:19,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:21,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:40:21,875 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1071 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1068) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse3) 2147483647) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)))) (forall ((v_ArrVal_1070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_1068 Int) (v_ArrVal_1071 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1068)) |c_~#stored_elements~0.base| v_ArrVal_1070) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_1071) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1068) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)))))) is different from false [2023-08-30 12:40:22,774 INFO L130 PetriNetUnfolder]: 3144/6299 cut-off events. [2023-08-30 12:40:22,775 INFO L131 PetriNetUnfolder]: For 149467/149561 co-relation queries the response was YES. [2023-08-30 12:40:22,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46888 conditions, 6299 events. 3144/6299 cut-off events. For 149467/149561 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 40945 event pairs, 1203 based on Foata normal form. 84/6066 useless extension candidates. Maximal degree in co-relation 46403. Up to 3785 conditions per place. [2023-08-30 12:40:22,817 INFO L137 encePairwiseOnDemand]: 433/449 looper letters, 264 selfloop transitions, 236 changer transitions 3/509 dead transitions. [2023-08-30 12:40:22,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 509 transitions, 8451 flow [2023-08-30 12:40:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-30 12:40:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-30 12:40:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7632 transitions. [2023-08-30 12:40:22,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38631301882972263 [2023-08-30 12:40:22,823 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7632 transitions. [2023-08-30 12:40:22,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7632 transitions. [2023-08-30 12:40:22,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:40:22,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7632 transitions. [2023-08-30 12:40:22,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 173.45454545454547) internal successors, (7632), 44 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:40:22,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 449.0) internal successors, (20205), 45 states have internal predecessors, (20205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:40:22,841 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 449.0) internal successors, (20205), 45 states have internal predecessors, (20205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:40:22,841 INFO L175 Difference]: Start difference. First operand has 217 places, 293 transitions, 2854 flow. Second operand 44 states and 7632 transitions. [2023-08-30 12:40:22,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 509 transitions, 8451 flow [2023-08-30 12:40:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 509 transitions, 8417 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-30 12:40:22,907 INFO L231 Difference]: Finished difference. Result has 280 places, 401 transitions, 5316 flow [2023-08-30 12:40:22,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=5316, PETRI_PLACES=280, PETRI_TRANSITIONS=401} [2023-08-30 12:40:22,908 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 223 predicate places. [2023-08-30 12:40:22,908 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 401 transitions, 5316 flow [2023-08-30 12:40:22,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:40:22,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:40:22,909 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 12:40:22,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 12:40:23,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:40:23,110 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:40:23,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:40:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1828832700, now seen corresponding path program 4 times [2023-08-30 12:40:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:40:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828697576] [2023-08-30 12:40:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:40:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:40:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:40:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:40:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:40:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828697576] [2023-08-30 12:40:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828697576] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:40:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211454919] [2023-08-30 12:40:24,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 12:40:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:40:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:40:24,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:40:24,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 12:40:24,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 12:40:24,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:40:24,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-30 12:40:24,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:40:24,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:40:24,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:40:24,869 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:40:24,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:40:24,885 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:40:24,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:40:24,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-30 12:40:25,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-30 12:40:25,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-30 12:40:25,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:40:25,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-30 12:40:25,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-30 12:40:25,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-08-30 12:40:25,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-08-30 12:40:26,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-08-30 12:40:28,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:40:28,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-08-30 12:40:28,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-08-30 12:40:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:40:37,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:40:37,346 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1197 Int) (v_ArrVal_1196 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 12:40:37,416 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1197 Int) (v_ArrVal_1196 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1194) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|))))) is different from false [2023-08-30 12:40:37,567 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1197 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1192) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1194)))))) is different from false [2023-08-30 12:40:37,603 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1197 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1192) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1194))))))) is different from false [2023-08-30 12:40:37,625 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse2 (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_1189)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1194) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1192) (< (select .cse4 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-30 12:40:37,647 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1192) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1194)))))))) is different from false [2023-08-30 12:40:37,672 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 .cse1 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1194) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1192))))))))) is different from false [2023-08-30 12:40:37,705 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1186) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1192) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse3) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1194) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|))))))))) is different from false [2023-08-30 12:40:37,740 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1186) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1192) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse5) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1194) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))))))))) is different from false [2023-08-30 12:40:37,812 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (v_ArrVal_1184 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1184) .cse6 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1192) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1194) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1184) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1186) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse1) 2147483647)))))))))) is different from false [2023-08-30 12:40:37,866 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (v_ArrVal_1184 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1184) .cse7 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1184) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1192) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1194) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse0 .cse7) 1) v_ArrVal_1186) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse3) 2147483647)))))))))) is different from false [2023-08-30 12:40:37,918 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int)) (v_ArrVal_1183 Int) (v_ArrVal_1194 Int) (v_ArrVal_1184 Int) (v_ArrVal_1186 Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 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_1183)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse4 v_ArrVal_1184) .cse1 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse8 .cse3 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse5 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1186) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse3) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1184) (< (select .cse2 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1194) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1192)))))))))) is different from false [2023-08-30 12:40:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-30 12:40:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211454919] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:40:42,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:40:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-30 12:40:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226973357] [2023-08-30 12:40:42,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:40:42,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-30 12:40:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:40:42,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-30 12:40:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1299, Unknown=30, NotChecked=1092, Total=2862 [2023-08-30 12:40:44,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:46,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:48,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:48,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:40:48,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 401 transitions, 5316 flow. Second operand has 54 states, 54 states have (on average 168.33333333333334) internal successors, (9090), 54 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 12:40:48,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:40:48,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:40:48,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:40:56,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:00,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:03,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:14,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:18,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:22,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:29,256 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 121 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:41:39,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:41,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:46,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:50,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:41:52,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:42:03,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:08,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:10,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:12,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:14,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:16,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:18,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:20,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:22,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:24,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:26,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:28,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:30,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:32,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:34,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:35,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:37,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:42:54,635 WARN L222 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 197 DAG size of output: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:42:56,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:05,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:43:09,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:43:11,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:43:13,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:43:15,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:43:17,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:43:19,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:43:19,526 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int)) (v_ArrVal_1183 Int) (v_ArrVal_1194 Int) (v_ArrVal_1184 Int) (v_ArrVal_1186 Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) |c_~#queue~0.offset|) v_ArrVal_1183))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1184) .cse3 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1184) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_77|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1194) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1192) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1186) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse1) 2147483647))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int)) (v_ArrVal_1183 Int) (v_ArrVal_1194 Int) (v_ArrVal_1184 Int) (v_ArrVal_1186 Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int)) (let ((.cse10 (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_1183)) (.cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse13 v_ArrVal_1184) .cse11 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse15 (select .cse18 |c_~#queue~0.base|))) (let ((.cse16 (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store .cse16 .cse1 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse12 (select (store (store .cse17 |c_~#queue~0.base| (store .cse14 .cse3 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse10 .cse11) 1) v_ArrVal_1186) (< (select (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse1) 2147483647) (< (+ (select .cse10 .cse13) 1) v_ArrVal_1184) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse14 .cse3) 1) v_ArrVal_1194) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse16 .cse1) 1) v_ArrVal_1192)))))))))))) is different from false [2023-08-30 12:43:21,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:23,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:25,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:27,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:29,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:31,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:33,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:35,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:37,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:39,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:41,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:43,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:45,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:47,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:49,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:51,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:53,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:55,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:57,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:59,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:01,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:03,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:12,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:14,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:16,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:18,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:40,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:42,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:44,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:44:46,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:09,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:45:17,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:45:19,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:45:21,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:45:23,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:45:25,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:45:35,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:37,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:38,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:40,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:42,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:45,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:45:47,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:45:49,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:46:06,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:08,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:10,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:12,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:14,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:16,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:18,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:20,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:22,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:38,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:46:40,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:11,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:13,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:25,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:25,165 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1186 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1192 Int) (v_ArrVal_1193 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1186)) |c_~#stored_elements~0.base| v_ArrVal_1188))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1189))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1192)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1186) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1192) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse5) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1194) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))))))))) (forall ((v_ArrVal_1194 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1197 Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1193))) (let ((.cse10 (select .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse11 (select (store (store .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse3 v_ArrVal_1194)) |c_~#stored_elements~0.base| v_ArrVal_1196) |c_~#queue~0.base|))) (or (< (+ (select .cse10 .cse3) 1) v_ArrVal_1194) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1197) .cse5) 2147483647)))))))) is different from false [2023-08-30 12:47:27,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:28,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:30,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:32,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:47:34,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:36,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:38,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:47:40,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:08,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:10,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:12,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:14,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:16,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:18,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:33,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:35,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:48:37,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15