./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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-ext/37_stack_lock_p0_vs_concur.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:35:35,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:35:35,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:35:35,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:35:35,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:35:35,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:35:35,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:35:35,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:35:35,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:35:35,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:35:35,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:35:35,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:35:35,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:35:35,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:35:35,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:35:35,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:35:35,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:35:35,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:35:35,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:35:35,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:35:35,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:35:35,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:35:35,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:35:35,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:35:35,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:35:35,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:35:35,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:35:35,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:35:35,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:35:35,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:35:35,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:35:35,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:35:35,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:35:35,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:35:35,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:35:35,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:35:35,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:35:35,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:35:35,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:35:35,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:35:35,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:35:35,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:35:35,241 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:35:35,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:35:35,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:35:35,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:35:35,243 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:35:35,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:35:35,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:35:35,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:35:35,244 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:35:35,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:35:35,244 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:35:35,245 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:35:35,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:35:35,246 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:35:35,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:35:35,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:35:35,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:35:35,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:35:35,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:35:35,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:35:35,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:35:35,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:35:35,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:35:35,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:35:35,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:35:35,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:35:35,248 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:35:35,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:35:35,248 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:35:35,248 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 ! call(reach_error())) ) 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 -> a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 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 -> AFTER [2023-08-30 16:35:35,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:35:35,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:35:35,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:35:35,477 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:35:35,477 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:35:35,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-30 16:35:36,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:35:36,634 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:35:36,634 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-30 16:35:36,641 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6400cd88d/ffc51ea1feaf498292bca3dc0fbcfc0d/FLAGabeb76b68 [2023-08-30 16:35:36,650 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6400cd88d/ffc51ea1feaf498292bca3dc0fbcfc0d [2023-08-30 16:35:36,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:35:36,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:35:36,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:35:36,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:35:36,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:35:36,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:36,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f403a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36, skipping insertion in model container [2023-08-30 16:35:36,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:36,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:35:36,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:35:36,839 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-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2023-08-30 16:35:36,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:35:36,855 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:35:36,900 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-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2023-08-30 16:35:36,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:35:36,937 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:35:36,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36 WrapperNode [2023-08-30 16:35:36,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:35:36,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:35:36,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:35:36,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:35:36,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:36,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,007 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 83 [2023-08-30 16:35:37,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:35:37,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:35:37,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:35:37,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:35:37,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,041 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:35:37,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:35:37,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:35:37,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:35:37,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (1/1) ... [2023-08-30 16:35:37,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:35:37,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:35:37,074 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 16:35:37,082 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 16:35:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 16:35:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:35:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:35:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:35:37,106 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 16:35:37,228 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:35:37,229 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:35:37,328 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:35:37,358 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:35:37,363 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 16:35:37,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:35:37 BoogieIcfgContainer [2023-08-30 16:35:37,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:35:37,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:35:37,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:35:37,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:35:37,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:35:36" (1/3) ... [2023-08-30 16:35:37,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1ed6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:35:37, skipping insertion in model container [2023-08-30 16:35:37,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:35:36" (2/3) ... [2023-08-30 16:35:37,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1ed6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:35:37, skipping insertion in model container [2023-08-30 16:35:37,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:35:37" (3/3) ... [2023-08-30 16:35:37,372 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-08-30 16:35:37,377 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:35:37,383 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:35:37,383 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 16:35:37,383 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:35:37,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:35:37,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-08-30 16:35:37,475 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-08-30 16:35:37,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:35:37,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-30 16:35:37,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 73 transitions, 151 flow [2023-08-30 16:35:37,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 73 transitions, 151 flow [2023-08-30 16:35:37,484 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:35:37,489 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 73 transitions, 151 flow [2023-08-30 16:35:37,491 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 151 flow [2023-08-30 16:35:37,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-08-30 16:35:37,506 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-08-30 16:35:37,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:35:37,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-30 16:35:37,507 INFO L119 LiptonReduction]: Number of co-enabled transitions 1170 [2023-08-30 16:35:38,494 INFO L134 LiptonReduction]: Checked pairs total: 1376 [2023-08-30 16:35:38,494 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-08-30 16:35:38,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:35:38,510 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;@522cfb30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:35:38,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-30 16:35:38,514 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2023-08-30 16:35:38,514 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:35:38,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:38,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:35:38,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:35:38,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1742846655, now seen corresponding path program 1 times [2023-08-30 16:35:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392353264] [2023-08-30 16:35:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:38,625 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 16:35:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392353264] [2023-08-30 16:35:38,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392353264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:35:38,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:35:38,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:35:38,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988001934] [2023-08-30 16:35:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:35:38,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:35:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:38,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:35:38,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:35:38,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 136 [2023-08-30 16:35:38,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 22 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 16:35:38,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:38,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 136 [2023-08-30 16:35:38,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:38,674 INFO L130 PetriNetUnfolder]: 25/64 cut-off events. [2023-08-30 16:35:38,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:35:38,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 64 events. 25/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 157 event pairs, 19 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 114. Up to 60 conditions per place. [2023-08-30 16:35:38,676 INFO L137 encePairwiseOnDemand]: 133/136 looper letters, 15 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-08-30 16:35:38,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 71 flow [2023-08-30 16:35:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:35:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:35:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2023-08-30 16:35:38,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2023-08-30 16:35:38,684 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 142 transitions. [2023-08-30 16:35:38,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 142 transitions. [2023-08-30 16:35:38,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:35:38,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 142 transitions. [2023-08-30 16:35:38,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 16:35:38,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 16:35:38,691 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 16:35:38,692 INFO L175 Difference]: Start difference. First operand has 22 places, 22 transitions, 49 flow. Second operand 2 states and 142 transitions. [2023-08-30 16:35:38,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 71 flow [2023-08-30 16:35:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 71 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:35:38,694 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 41 flow [2023-08-30 16:35:38,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=41, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2023-08-30 16:35:38,697 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -2 predicate places. [2023-08-30 16:35:38,698 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 41 flow [2023-08-30 16:35:38,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 16:35:38,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:38,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:35:38,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:35:38,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:35:38,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1803478341, now seen corresponding path program 1 times [2023-08-30 16:35:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312245692] [2023-08-30 16:35:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:38,805 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 16:35:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:38,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312245692] [2023-08-30 16:35:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312245692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:35:38,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:35:38,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:35:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041312412] [2023-08-30 16:35:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:35:38,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:35:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:38,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:35:38,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:35:38,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 136 [2023-08-30 16:35:38,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 41 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 16:35:38,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:38,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 136 [2023-08-30 16:35:38,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:38,834 INFO L130 PetriNetUnfolder]: 22/61 cut-off events. [2023-08-30 16:35:38,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:35:38,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 61 events. 22/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 17 based on Foata normal form. 3/57 useless extension candidates. Maximal degree in co-relation 122. Up to 52 conditions per place. [2023-08-30 16:35:38,835 INFO L137 encePairwiseOnDemand]: 134/136 looper letters, 13 selfloop transitions, 0 changer transitions 3/19 dead transitions. [2023-08-30 16:35:38,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 19 transitions, 75 flow [2023-08-30 16:35:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:35:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:35:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2023-08-30 16:35:38,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-30 16:35:38,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 200 transitions. [2023-08-30 16:35:38,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 200 transitions. [2023-08-30 16:35:38,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:35:38,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 200 transitions. [2023-08-30 16:35:38,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 16:35:38,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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 16:35:38,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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 16:35:38,840 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 41 flow. Second operand 3 states and 200 transitions. [2023-08-30 16:35:38,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 19 transitions, 75 flow [2023-08-30 16:35:38,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 75 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:35:38,841 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 37 flow [2023-08-30 16:35:38,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2023-08-30 16:35:38,841 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 0 predicate places. [2023-08-30 16:35:38,842 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 37 flow [2023-08-30 16:35:38,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 16:35:38,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:38,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:35:38,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:35:38,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:35:38,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash 961529819, now seen corresponding path program 1 times [2023-08-30 16:35:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:38,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482419806] [2023-08-30 16:35:38,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:38,903 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 16:35:38,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:38,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482419806] [2023-08-30 16:35:38,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482419806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:35:38,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:35:38,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:35:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526085368] [2023-08-30 16:35:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:35:38,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:35:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:35:38,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:35:38,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 136 [2023-08-30 16:35:38,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 37 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 16:35:38,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:38,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 136 [2023-08-30 16:35:38,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:38,995 INFO L130 PetriNetUnfolder]: 33/109 cut-off events. [2023-08-30 16:35:38,995 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:35:38,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 109 events. 33/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 219. Up to 27 conditions per place. [2023-08-30 16:35:38,997 INFO L137 encePairwiseOnDemand]: 129/136 looper letters, 22 selfloop transitions, 11 changer transitions 6/41 dead transitions. [2023-08-30 16:35:38,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 41 transitions, 165 flow [2023-08-30 16:35:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:35:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:35:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2023-08-30 16:35:39,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-08-30 16:35:39,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 306 transitions. [2023-08-30 16:35:39,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 306 transitions. [2023-08-30 16:35:39,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:35:39,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 306 transitions. [2023-08-30 16:35:39,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 0 states have call successors, (0), 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 16:35:39,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 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 16:35:39,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 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 16:35:39,007 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 37 flow. Second operand 5 states and 306 transitions. [2023-08-30 16:35:39,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 41 transitions, 165 flow [2023-08-30 16:35:39,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:35:39,008 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 100 flow [2023-08-30 16:35:39,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-30 16:35:39,009 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-08-30 16:35:39,009 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 100 flow [2023-08-30 16:35:39,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 16:35:39,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:39,010 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:35:39,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:35:39,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:35:39,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2069525911, now seen corresponding path program 1 times [2023-08-30 16:35:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381778633] [2023-08-30 16:35:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:39,285 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 16:35:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381778633] [2023-08-30 16:35:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381778633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:35:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237799619] [2023-08-30 16:35:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:35:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:35:39,289 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 16:35:39,290 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 16:35:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:39,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 16:35:39,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:35:39,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:35:39,455 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:35:39,455 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 16:35:39,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:35:39,548 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 14 treesize of output 16 [2023-08-30 16:35:39,569 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 16:35:39,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:35:39,579 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-30 16:35:39,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:39,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-30 16:35:39,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:39,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 16:35:39,682 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 54 treesize of output 42 [2023-08-30 16:35:39,686 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 6 treesize of output 4 [2023-08-30 16:35:39,691 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 6 treesize of output 4 [2023-08-30 16:35:39,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-08-30 16:35:39,720 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 6 treesize of output 4 [2023-08-30 16:35:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 16:35:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237799619] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:35:39,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:35:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-08-30 16:35:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524575265] [2023-08-30 16:35:39,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:35:39,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 16:35:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 16:35:39,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2023-08-30 16:35:39,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 136 [2023-08-30 16:35:39,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 100 flow. Second operand has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 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 16:35:39,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:39,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 136 [2023-08-30 16:35:39,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:40,135 INFO L130 PetriNetUnfolder]: 40/166 cut-off events. [2023-08-30 16:35:40,135 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-30 16:35:40,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 166 events. 40/166 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 420 event pairs, 6 based on Foata normal form. 2/168 useless extension candidates. Maximal degree in co-relation 465. Up to 31 conditions per place. [2023-08-30 16:35:40,137 INFO L137 encePairwiseOnDemand]: 127/136 looper letters, 31 selfloop transitions, 17 changer transitions 11/61 dead transitions. [2023-08-30 16:35:40,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 348 flow [2023-08-30 16:35:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 16:35:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 16:35:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 576 transitions. [2023-08-30 16:35:40,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3025210084033613 [2023-08-30 16:35:40,139 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 576 transitions. [2023-08-30 16:35:40,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 576 transitions. [2023-08-30 16:35:40,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:35:40,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 576 transitions. [2023-08-30 16:35:40,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 41.142857142857146) internal successors, (576), 14 states have internal predecessors, (576), 0 states have call successors, (0), 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 16:35:40,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 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 16:35:40,151 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 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 16:35:40,151 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 100 flow. Second operand 14 states and 576 transitions. [2023-08-30 16:35:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 348 flow [2023-08-30 16:35:40,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:35:40,154 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 196 flow [2023-08-30 16:35:40,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=196, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-30 16:35:40,155 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 23 predicate places. [2023-08-30 16:35:40,156 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 196 flow [2023-08-30 16:35:40,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 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 16:35:40,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:40,156 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-30 16:35:40,164 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 16:35:40,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:35:40,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:35:40,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash 116172245, now seen corresponding path program 1 times [2023-08-30 16:35:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:40,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230943236] [2023-08-30 16:35:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:40,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:35:41,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:41,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230943236] [2023-08-30 16:35:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230943236] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:35:41,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897908523] [2023-08-30 16:35:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:41,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:35:41,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:35:41,027 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 16:35:41,029 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 16:35:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:41,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-30 16:35:41,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:35:41,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:35:41,147 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:35:41,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:35:41,160 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 6 treesize of output 5 [2023-08-30 16:35:41,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 16:35:41,214 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:41,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-08-30 16:35:41,243 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 16:35:41,298 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:41,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 22 [2023-08-30 16:35:41,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:41,345 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 27 treesize of output 31 [2023-08-30 16:35:41,441 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-08-30 16:35:41,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 27 [2023-08-30 16:35:41,520 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:41,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-08-30 16:35:41,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-08-30 16:35:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:35:41,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:35:41,550 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-30 16:35:41,607 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2023-08-30 16:35:41,926 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-30 16:35:41,994 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (= v_ArrVal_143 0) (not (= (+ (select .cse1 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse2 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse2 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-30 16:35:42,061 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_137 Int) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_137) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_137 Int) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_137) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0) (not (= (+ (select .cse3 0) 1) 0)))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:35:42,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-08-30 16:35:42,329 INFO L321 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2023-08-30 16:35:42,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 295 [2023-08-30 16:35:42,363 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 200 treesize of output 198 [2023-08-30 16:35:42,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:42,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 483 treesize of output 523 [2023-08-30 16:35:42,463 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 267 treesize of output 263 [2023-08-30 16:35:42,475 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 263 treesize of output 255 [2023-08-30 16:35:42,486 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 255 treesize of output 251 [2023-08-30 16:35:42,498 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 251 treesize of output 249 [2023-08-30 16:35:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2023-08-30 16:35:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897908523] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:35:42,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:35:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2023-08-30 16:35:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605087754] [2023-08-30 16:35:42,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:35:42,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-30 16:35:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-30 16:35:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=862, Unknown=9, NotChecked=330, Total=1406 [2023-08-30 16:35:42,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2023-08-30 16:35:42,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 196 flow. Second operand has 38 states, 38 states have (on average 37.23684210526316) internal successors, (1415), 38 states have internal predecessors, (1415), 0 states have call successors, (0), 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 16:35:42,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:42,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2023-08-30 16:35:42,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:44,189 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77|) 0))))) (and (or (<= c_~next_alloc_idx~0 62) .cse0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77| Int)) (or (forall ((v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (or (= v_prenex_18 |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77| v_prenex_15) v_prenex_18 v_prenex_17) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_77|) 0)))) (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse2 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse2 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (= v_ArrVal_143 0) (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (<= c_~next_alloc_idx~0 64)) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse0) (not (= c_~top~0 0)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (< 64 c_~next_alloc_idx~0)))) is different from false [2023-08-30 16:35:44,245 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse0 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (not (= (+ c_~next_alloc_idx~0 3) 0)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) (< 64 c_~next_alloc_idx~0)) (<= c_~next_alloc_idx~0 62) (forall ((v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (or (= v_prenex_18 |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_15) v_prenex_18 v_prenex_17) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) is different from false [2023-08-30 16:35:44,277 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse5 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse1 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (not (= (+ c_~next_alloc_idx~0 3) 0)) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse4 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) .cse6) (<= c_~next_alloc_idx~0 62) (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (forall ((v_prenex_15 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (or (= v_prenex_18 |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_15) v_prenex_18 v_prenex_17) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (or .cse6 (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2023-08-30 16:35:46,162 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_139))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= 0 (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0))) (= v_ArrVal_143 0) (not (= (+ (select .cse1 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0)) (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse2 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0)))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75|) 0 c_~next_alloc_idx~0)))) (let ((.cse3 (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (+ (select .cse3 0) 1) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse3 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (= v_ArrVal_143 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_75| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-30 16:35:46,301 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse5 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse1 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse4 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) .cse6) (or (not (= (+ (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0)) (and (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or .cse6 (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))))))) is different from false [2023-08-30 16:35:46,497 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse5 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_139))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (not (= (+ (select .cse1 0) 1) 0)) (= v_ArrVal_143 0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse1 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0))))))) (or (forall ((v_ArrVal_143 Int) (v_ArrVal_142 Int) (v_ArrVal_146 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|))) (or (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73| (store .cse4 0 v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_142) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_73|) 0)) (= v_ArrVal_143 0))))) .cse6) (or (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (= (select v_ArrVal_145 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (not (= (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse6 (forall ((v_ArrVal_143 Int) (v_ArrVal_146 (Array Int Int))) (or (= v_ArrVal_143 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_143)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_146) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2023-08-30 16:35:47,258 INFO L130 PetriNetUnfolder]: 99/392 cut-off events. [2023-08-30 16:35:47,258 INFO L131 PetriNetUnfolder]: For 680/680 co-relation queries the response was YES. [2023-08-30 16:35:47,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 392 events. 99/392 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1400 event pairs, 0 based on Foata normal form. 3/395 useless extension candidates. Maximal degree in co-relation 1426. Up to 110 conditions per place. [2023-08-30 16:35:47,261 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 30 selfloop transitions, 43 changer transitions 124/199 dead transitions. [2023-08-30 16:35:47,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 199 transitions, 1471 flow [2023-08-30 16:35:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-08-30 16:35:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-08-30 16:35:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 2440 transitions. [2023-08-30 16:35:47,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2803308823529412 [2023-08-30 16:35:47,268 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 2440 transitions. [2023-08-30 16:35:47,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 2440 transitions. [2023-08-30 16:35:47,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:35:47,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 2440 transitions. [2023-08-30 16:35:47,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 38.125) internal successors, (2440), 64 states have internal predecessors, (2440), 0 states have call successors, (0), 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 16:35:47,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 136.0) internal successors, (8840), 65 states have internal predecessors, (8840), 0 states have call successors, (0), 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 16:35:47,290 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 136.0) internal successors, (8840), 65 states have internal predecessors, (8840), 0 states have call successors, (0), 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 16:35:47,290 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 196 flow. Second operand 64 states and 2440 transitions. [2023-08-30 16:35:47,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 199 transitions, 1471 flow [2023-08-30 16:35:47,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 199 transitions, 1383 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-30 16:35:47,297 INFO L231 Difference]: Finished difference. Result has 115 places, 59 transitions, 482 flow [2023-08-30 16:35:47,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=482, PETRI_PLACES=115, PETRI_TRANSITIONS=59} [2023-08-30 16:35:47,299 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 93 predicate places. [2023-08-30 16:35:47,299 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 59 transitions, 482 flow [2023-08-30 16:35:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 37.23684210526316) internal successors, (1415), 38 states have internal predecessors, (1415), 0 states have call successors, (0), 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 16:35:47,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:35:47,302 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1] [2023-08-30 16:35:47,307 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 16:35:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:35:47,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:35:47,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:35:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash -533041936, now seen corresponding path program 2 times [2023-08-30 16:35:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:35:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526583812] [2023-08-30 16:35:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:35:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:35:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:35:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:35:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:35:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526583812] [2023-08-30 16:35:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526583812] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:35:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138446727] [2023-08-30 16:35:48,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:35:48,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:35:48,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:35:48,133 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 16:35:48,160 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 16:35:48,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 16:35:48,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:35:48,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-30 16:35:48,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:35:48,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:35:48,252 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:35:48,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:35:48,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 16:35:48,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 16:35:48,316 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:48,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-08-30 16:35:48,361 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 16:35:48,415 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:48,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 22 [2023-08-30 16:35:48,471 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:48,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 34 [2023-08-30 16:35:48,591 INFO L321 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-08-30 16:35:48,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 85 [2023-08-30 16:35:48,784 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:48,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 [2023-08-30 16:35:48,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:48,849 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 42 treesize of output 46 [2023-08-30 16:35:48,973 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-08-30 16:35:48,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 27 [2023-08-30 16:35:49,061 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:35:49,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-08-30 16:35:49,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-08-30 16:35:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:35:49,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:35:49,183 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_246 Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_246 0))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-30 16:35:49,470 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-30 16:35:49,543 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:35:49,600 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-30 16:35:49,810 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse2 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:35:49,935 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse0 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (or (<= c_~next_alloc_idx~0 64) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))))) is different from false [2023-08-30 16:35:50,057 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse0 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:35:50,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:50,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-08-30 16:35:50,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 597 treesize of output 581 [2023-08-30 16:35:50,412 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 132 treesize of output 130 [2023-08-30 16:35:50,415 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 130 treesize of output 126 [2023-08-30 16:35:50,418 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 126 treesize of output 118 [2023-08-30 16:35:50,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:50,438 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 51 treesize of output 41 [2023-08-30 16:35:50,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:50,450 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 61 treesize of output 61 [2023-08-30 16:35:50,455 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 24 treesize of output 22 [2023-08-30 16:35:50,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:35:50,491 INFO L321 Elim1Store]: treesize reduction 42, result has 49.4 percent of original size [2023-08-30 16:35:50,491 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 109 [2023-08-30 16:35:50,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:35:50,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 130 [2023-08-30 16:35:50,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 153 [2023-08-30 16:35:50,616 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 60 treesize of output 58 [2023-08-30 16:35:50,620 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 58 treesize of output 54 [2023-08-30 16:35:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2023-08-30 16:35:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138446727] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:35:50,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:35:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2023-08-30 16:35:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767752466] [2023-08-30 16:35:50,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:35:50,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-08-30 16:35:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:35:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-08-30 16:35:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1249, Unknown=15, NotChecked=560, Total=2070 [2023-08-30 16:35:52,940 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 16:35:52,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2023-08-30 16:35:52,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 59 transitions, 482 flow. Second operand has 46 states, 46 states have (on average 37.45652173913044) internal successors, (1723), 46 states have internal predecessors, (1723), 0 states have call successors, (0), 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 16:35:52,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:35:52,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2023-08-30 16:35:52,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:35:54,985 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 16:35:57,249 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 16:35:59,369 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 16:36:01,372 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 16:36:03,459 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 16:36:05,461 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 16:36:07,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:36:09,484 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 16:36:11,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:36:13,493 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 16:36:15,635 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 16:36:17,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:36:19,846 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 16:36:21,956 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 16:36:23,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 16:36:25,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 16:36:27,973 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 16:36:29,980 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 16:36:31,983 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 16:36:33,991 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 16:36:35,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 [0, 1] [2023-08-30 16:36:38,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 16:36:40,016 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 16:36:46,235 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 16:36:54,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 16:37:02,618 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 194 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:37:04,676 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 16:37:06,926 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 16:37:08,940 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 16:37:10,946 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 16:37:12,958 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 16:37:19,359 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 16:37:21,361 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 16:37:23,405 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 16:37:25,407 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 16:37:27,723 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 16:37:29,727 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 16:37:29,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse5 (<= c_~next_alloc_idx~0 64)) (.cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86|) 0))))) (and (or .cse0 (and (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse1 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (not (= c_~top~0 0)) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse4) (or .cse5 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))) (or (<= c_~next_alloc_idx~0 60) .cse4) (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86|) 0)) (forall ((v_prenex_79 Int)) (or (= v_prenex_79 |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((v_prenex_81 Int) (v_prenex_83 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_86| v_prenex_81) v_prenex_79 v_prenex_83) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) .cse5) (or (< 0 (+ c_~next_alloc_idx~0 5)) .cse4))) is different from false [2023-08-30 16:37:31,803 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 16:37:33,805 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 16:37:35,822 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 16:37:37,825 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 16:37:38,919 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (let ((.cse1 (not .cse6)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse8 (<= c_~next_alloc_idx~0 64)) (.cse9 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or (and (<= 5 c_~next_alloc_idx~0) .cse0 (<= c_~next_alloc_idx~0 5)) .cse1) (or .cse2 (and (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int)) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84|) 0 c_~next_alloc_idx~0)))) (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244))))) (or (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)))))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) .cse6) .cse1 (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) .cse8) (or .cse1 (and (= |c_thr1Thread1of1ForFork0_push_#t~mem5#1| (select .cse9 0)) (<= 5 |c_thr1Thread1of1ForFork0_push_#t~mem5#1|) .cse0)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_235 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (select (store (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_235) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_84| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) .cse8) (not (= (select .cse9 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse2)))) is different from false [2023-08-30 16:37:41,457 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 (+ c_~next_alloc_idx~0 2)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse2 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))))))) (or (<= 0 (select .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (not (= c_~top~0 0)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_240 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_237) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_240) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64)) (or (<= 5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) is different from false [2023-08-30 16:37:43,529 WARN L839 $PredicateComparison]: unable to prove that (and (not (= c_~top~0 0)) (or (< 64 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82|) 0 v_ArrVal_244)))) (or (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| Int) (v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_243))) (or (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_82| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0))))) is different from false [2023-08-30 16:37:43,692 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (<= c_~next_alloc_idx~0 64)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) (< 64 c_~next_alloc_idx~0)) (or (not (= (+ (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2023-08-30 16:37:43,821 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~next_alloc_idx~0 64)) (.cse3 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse4 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_243))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse1) (or .cse1 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_247 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_ArrVal_249 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| Int) (v_ArrVal_245 Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_244)))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_245) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0)) (= 0 (select v_ArrVal_247 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 1) 0)) (< v_ArrVal_244 c_~next_alloc_idx~0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80| v_ArrVal_247) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_80|) 0) 0))))) .cse4) (not (= (select .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_246 Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse3 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_246 0))) .cse4))) is different from false [2023-08-30 16:37:44,726 INFO L130 PetriNetUnfolder]: 44/260 cut-off events. [2023-08-30 16:37:44,727 INFO L131 PetriNetUnfolder]: For 866/866 co-relation queries the response was YES. [2023-08-30 16:37:44,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 260 events. 44/260 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 746 event pairs, 0 based on Foata normal form. 4/264 useless extension candidates. Maximal degree in co-relation 1242. Up to 93 conditions per place. [2023-08-30 16:37:44,728 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 34 selfloop transitions, 32 changer transitions 120/188 dead transitions. [2023-08-30 16:37:44,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 188 transitions, 1941 flow [2023-08-30 16:37:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-08-30 16:37:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-08-30 16:37:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 2696 transitions. [2023-08-30 16:37:44,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27532679738562094 [2023-08-30 16:37:44,733 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 2696 transitions. [2023-08-30 16:37:44,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 2696 transitions. [2023-08-30 16:37:44,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:44,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 2696 transitions. [2023-08-30 16:37:44,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 37.44444444444444) internal successors, (2696), 72 states have internal predecessors, (2696), 0 states have call successors, (0), 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 16:37:44,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 136.0) internal successors, (9928), 73 states have internal predecessors, (9928), 0 states have call successors, (0), 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 16:37:44,749 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 136.0) internal successors, (9928), 73 states have internal predecessors, (9928), 0 states have call successors, (0), 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 16:37:44,749 INFO L175 Difference]: Start difference. First operand has 115 places, 59 transitions, 482 flow. Second operand 72 states and 2696 transitions. [2023-08-30 16:37:44,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 188 transitions, 1941 flow [2023-08-30 16:37:44,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 188 transitions, 1705 flow, removed 102 selfloop flow, removed 20 redundant places. [2023-08-30 16:37:44,757 INFO L231 Difference]: Finished difference. Result has 155 places, 52 transitions, 480 flow [2023-08-30 16:37:44,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=480, PETRI_PLACES=155, PETRI_TRANSITIONS=52} [2023-08-30 16:37:44,759 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 133 predicate places. [2023-08-30 16:37:44,759 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 52 transitions, 480 flow [2023-08-30 16:37:44,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 37.45652173913044) internal successors, (1723), 46 states have internal predecessors, (1723), 0 states have call successors, (0), 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 16:37:44,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:44,760 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1] [2023-08-30 16:37:44,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 16:37:44,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:44,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:44,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash 846180213, now seen corresponding path program 3 times [2023-08-30 16:37:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963182970] [2023-08-30 16:37:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:44,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:37:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963182970] [2023-08-30 16:37:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963182970] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:37:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645604064] [2023-08-30 16:37:45,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 16:37:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:45,829 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 16:37:45,832 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 16:37:45,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-30 16:37:45,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:37:45,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-30 16:37:45,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:37:45,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:37:45,985 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:37:45,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:37:46,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:37:46,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 16:37:46,115 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:37:46,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:37:46,188 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:37:46,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2023-08-30 16:37:46,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 16:37:46,308 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:37:46,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2023-08-30 16:37:46,366 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 16:37:46,367 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 1 case distinctions, treesize of input 19 treesize of output 22 [2023-08-30 16:37:46,542 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:37:46,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 22 [2023-08-30 16:37:46,643 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:37:46,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 46 [2023-08-30 16:37:46,889 INFO L321 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2023-08-30 16:37:46,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 65 treesize of output 117 [2023-08-30 16:37:47,385 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:37:47,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 69 treesize of output 75 [2023-08-30 16:37:47,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:37:47,573 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 84 treesize of output 88 [2023-08-30 16:37:47,932 INFO L321 Elim1Store]: treesize reduction 200, result has 34.9 percent of original size [2023-08-30 16:37:47,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 98 treesize of output 168 [2023-08-30 16:37:48,753 INFO L321 Elim1Store]: treesize reduction 170, result has 33.6 percent of original size [2023-08-30 16:37:48,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 108 treesize of output 181 [2023-08-30 16:37:51,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 16:37:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:37:51,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:37:53,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:37:53,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-30 16:37:53,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:37:53,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 16:37:53,346 INFO L321 Elim1Store]: treesize reduction 60, result has 49.2 percent of original size [2023-08-30 16:37:53,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 26388 treesize of output 26286 [2023-08-30 16:37:53,895 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 1270 treesize of output 1142 [2023-08-30 16:37:53,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:37:53,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2023-08-30 16:37:54,006 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 1173 treesize of output 1153 [2023-08-30 16:37:58,737 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 77 treesize of output 73 [2023-08-30 16:37:58,748 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 131 treesize of output 125 [2023-08-30 16:37:59,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:37:59,481 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 1768 treesize of output 1722 [2023-08-30 16:38:33,161 WARN L222 SmtUtils]: Spent 30.97s on a formula simplification. DAG size of input: 879 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:38:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 76 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:38:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645604064] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:38:33,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:38:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 57 [2023-08-30 16:38:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95294763] [2023-08-30 16:38:33,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:38:33,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-08-30 16:38:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:38:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-08-30 16:38:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=2876, Unknown=26, NotChecked=0, Total=3422 [2023-08-30 16:38:34,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 136 [2023-08-30 16:38:34,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 52 transitions, 480 flow. Second operand has 59 states, 59 states have (on average 37.40677966101695) internal successors, (2207), 59 states have internal predecessors, (2207), 0 states have call successors, (0), 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 16:38:34,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:38:34,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 136 [2023-08-30 16:38:34,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:38:36,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:38:38,134 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 16:38:40,151 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 16:38:42,154 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 16:38:44,212 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 16:38:46,219 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 16:38:48,233 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 16:38:50,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 16:38:52,266 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 16:38:54,268 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 16:38:56,305 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 16:38:58,313 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 16:39:00,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] [2023-08-30 16:39:02,371 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 16:39:04,438 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 16:39:06,451 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 16:39:08,454 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 16:39:10,502 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 16:39:12,505 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 16:39:14,533 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 16:39:16,554 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 16:39:18,562 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 16:39:20,591 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 16:39:22,598 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 16:39:24,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:39:26,628 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] [2023-08-30 16:39:28,680 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 16:39:30,729 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 16:39:32,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] [2023-08-30 16:39:34,747 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 16:39:36,807 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 16:39:38,819 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 16:39:40,846 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 16:39:42,878 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 16:39:44,893 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 16:39:46,895 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 16:39:48,907 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 16:39:50,923 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 16:39:52,927 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 16:39:55,017 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 16:39:57,149 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 16:39:59,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:40:01,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 16:40:03,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] [2023-08-30 16:40:05,649 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 16:40:07,684 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 16:40:09,696 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 16:40:11,732 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] [2023-08-30 16:40:13,762 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 16:40:16,972 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 16:40:18,985 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 16:40:20,992 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 16:40:22,999 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 16:40:25,015 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 16:40:30,422 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 16:40:34,437 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 16:40:36,457 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 16:40:39,183 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 16:40:41,188 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 16:40:43,286 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 16:40:45,290 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 16:40:48,442 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 16:40:50,449 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 16:40:52,951 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 16:41:06,133 INFO L130 PetriNetUnfolder]: 11/108 cut-off events. [2023-08-30 16:41:06,134 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2023-08-30 16:41:06,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 108 events. 11/108 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 617. Up to 32 conditions per place. [2023-08-30 16:41:06,134 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 0 selfloop transitions, 0 changer transitions 88/88 dead transitions. [2023-08-30 16:41:06,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 88 transitions, 1044 flow [2023-08-30 16:41:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-30 16:41:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-30 16:41:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1627 transitions. [2023-08-30 16:41:06,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27189171122994654 [2023-08-30 16:41:06,137 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1627 transitions. [2023-08-30 16:41:06,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1627 transitions. [2023-08-30 16:41:06,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:06,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1627 transitions. [2023-08-30 16:41:06,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 36.97727272727273) internal successors, (1627), 44 states have internal predecessors, (1627), 0 states have call successors, (0), 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 16:41:06,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 0 states have call successors, (0), 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 16:41:06,145 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 0 states have call successors, (0), 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 16:41:06,145 INFO L175 Difference]: Start difference. First operand has 155 places, 52 transitions, 480 flow. Second operand 44 states and 1627 transitions. [2023-08-30 16:41:06,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 88 transitions, 1044 flow [2023-08-30 16:41:06,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 699 flow, removed 81 selfloop flow, removed 45 redundant places. [2023-08-30 16:41:06,148 INFO L231 Difference]: Finished difference. Result has 103 places, 0 transitions, 0 flow [2023-08-30 16:41:06,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=0, PETRI_PLACES=103, PETRI_TRANSITIONS=0} [2023-08-30 16:41:06,148 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 81 predicate places. [2023-08-30 16:41:06,148 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 0 transitions, 0 flow [2023-08-30 16:41:06,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 37.40677966101695) internal successors, (2207), 59 states have internal predecessors, (2207), 0 states have call successors, (0), 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 16:41:06,151 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-30 16:41:06,151 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-30 16:41:06,158 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 16:41:06,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:41:06,356 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-08-30 16:41:06,358 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-30 16:41:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-08-30 16:41:06,364 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-08-30 16:41:06,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:41:06,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-30 16:41:06,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 73 transitions, 151 flow [2023-08-30 16:41:06,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 73 transitions, 151 flow [2023-08-30 16:41:06,367 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:41:06,368 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 73 transitions, 151 flow [2023-08-30 16:41:06,368 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 151 flow [2023-08-30 16:41:06,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 151 flow [2023-08-30 16:41:06,372 INFO L130 PetriNetUnfolder]: 7/83 cut-off events. [2023-08-30 16:41:06,372 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:41:06,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 7/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2023-08-30 16:41:06,374 INFO L119 LiptonReduction]: Number of co-enabled transitions 1170 [2023-08-30 16:41:07,216 INFO L134 LiptonReduction]: Checked pairs total: 1309 [2023-08-30 16:41:07,217 INFO L136 LiptonReduction]: Total number of compositions: 63 [2023-08-30 16:41:07,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:41:07,218 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;@522cfb30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:41:07,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:41:07,219 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2023-08-30 16:41:07,219 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:41:07,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:07,219 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 16:41:07,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:41:07,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash 54081815, now seen corresponding path program 1 times [2023-08-30 16:41:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:07,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644705353] [2023-08-30 16:41:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:41:07,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:41:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:41:07,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:41:07,242 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:41:07,242 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:41:07,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:41:07,243 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:41:07,243 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:41:07,243 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:41:07,244 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 16:41:07,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:41:07,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 119 transitions, 250 flow [2023-08-30 16:41:07,272 INFO L130 PetriNetUnfolder]: 13/141 cut-off events. [2023-08-30 16:41:07,272 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:41:07,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 141 events. 13/141 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 102. Up to 6 conditions per place. [2023-08-30 16:41:07,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 119 transitions, 250 flow [2023-08-30 16:41:07,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 119 transitions, 250 flow [2023-08-30 16:41:07,273 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:41:07,274 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 119 transitions, 250 flow [2023-08-30 16:41:07,274 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 119 transitions, 250 flow [2023-08-30 16:41:07,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 119 transitions, 250 flow [2023-08-30 16:41:07,280 INFO L130 PetriNetUnfolder]: 13/141 cut-off events. [2023-08-30 16:41:07,280 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:41:07,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 141 events. 13/141 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 102. Up to 6 conditions per place. [2023-08-30 16:41:07,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 6480 [2023-08-30 16:41:08,253 INFO L134 LiptonReduction]: Checked pairs total: 15292 [2023-08-30 16:41:08,254 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-30 16:41:08,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:41:08,255 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;@522cfb30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:41:08,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 16:41:08,262 INFO L130 PetriNetUnfolder]: 1/25 cut-off events. [2023-08-30 16:41:08,262 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:41:08,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:08,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:08,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:41:08,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash -757692546, now seen corresponding path program 1 times [2023-08-30 16:41:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:08,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926249906] [2023-08-30 16:41:08,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:08,291 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 16:41:08,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926249906] [2023-08-30 16:41:08,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926249906] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:08,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:08,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:41:08,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849810698] [2023-08-30 16:41:08,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:08,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:41:08,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:41:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:41:08,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 209 [2023-08-30 16:41:08,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 16:41:08,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:08,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 209 [2023-08-30 16:41:08,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:08,384 INFO L130 PetriNetUnfolder]: 377/829 cut-off events. [2023-08-30 16:41:08,384 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2023-08-30 16:41:08,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 829 events. 377/829 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4668 event pairs, 302 based on Foata normal form. 46/764 useless extension candidates. Maximal degree in co-relation 1126. Up to 587 conditions per place. [2023-08-30 16:41:08,387 INFO L137 encePairwiseOnDemand]: 203/209 looper letters, 33 selfloop transitions, 1 changer transitions 1/54 dead transitions. [2023-08-30 16:41:08,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 195 flow [2023-08-30 16:41:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:41:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:41:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-30 16:41:08,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231259968102073 [2023-08-30 16:41:08,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-30 16:41:08,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-30 16:41:08,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:08,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-30 16:41:08,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 16:41:08,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 16:41:08,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 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 16:41:08,390 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 108 flow. Second operand 3 states and 328 transitions. [2023-08-30 16:41:08,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 195 flow [2023-08-30 16:41:08,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 193 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 16:41:08,391 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 98 flow [2023-08-30 16:41:08,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-30 16:41:08,393 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-30 16:41:08,393 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 98 flow [2023-08-30 16:41:08,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 16:41:08,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:08,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:08,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:41:08,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:41:08,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1900018535, now seen corresponding path program 1 times [2023-08-30 16:41:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:08,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674585820] [2023-08-30 16:41:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:08,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:08,420 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 16:41:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674585820] [2023-08-30 16:41:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674585820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:41:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788306313] [2023-08-30 16:41:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:08,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:41:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:41:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:41:08,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 209 [2023-08-30 16:41:08,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 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 16:41:08,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:08,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 209 [2023-08-30 16:41:08,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:08,753 INFO L130 PetriNetUnfolder]: 1349/2839 cut-off events. [2023-08-30 16:41:08,754 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2023-08-30 16:41:08,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5355 conditions, 2839 events. 1349/2839 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 19055 event pairs, 273 based on Foata normal form. 0/2659 useless extension candidates. Maximal degree in co-relation 5063. Up to 818 conditions per place. [2023-08-30 16:41:08,764 INFO L137 encePairwiseOnDemand]: 197/209 looper letters, 105 selfloop transitions, 33 changer transitions 0/154 dead transitions. [2023-08-30 16:41:08,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 154 transitions, 633 flow [2023-08-30 16:41:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:41:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:41:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 909 transitions. [2023-08-30 16:41:08,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325358851674644 [2023-08-30 16:41:08,766 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 909 transitions. [2023-08-30 16:41:08,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 909 transitions. [2023-08-30 16:41:08,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:08,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 909 transitions. [2023-08-30 16:41:08,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.0) internal successors, (909), 9 states have internal predecessors, (909), 0 states have call successors, (0), 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 16:41:08,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 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 16:41:08,770 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 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 16:41:08,770 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 98 flow. Second operand 9 states and 909 transitions. [2023-08-30 16:41:08,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 154 transitions, 633 flow [2023-08-30 16:41:08,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 154 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:41:08,773 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 349 flow [2023-08-30 16:41:08,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2023-08-30 16:41:08,774 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2023-08-30 16:41:08,774 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 349 flow [2023-08-30 16:41:08,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 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 16:41:08,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:08,774 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:08,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:41:08,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:41:08,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash 480921083, now seen corresponding path program 1 times [2023-08-30 16:41:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890800223] [2023-08-30 16:41:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:08,888 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 16:41:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890800223] [2023-08-30 16:41:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890800223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:41:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967913541] [2023-08-30 16:41:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:08,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:41:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:41:08,890 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 16:41:08,893 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 16:41:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:08,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 16:41:08,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:41:08,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:41:08,981 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:41:08,982 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 16:41:09,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:41:09,057 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 14 treesize of output 16 [2023-08-30 16:41:09,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 16:41:09,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:41:09,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:41:09,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-30 16:41:09,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:41:09,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 16:41:09,162 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 35 treesize of output 23 [2023-08-30 16:41:09,169 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 6 treesize of output 4 [2023-08-30 16:41:09,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-08-30 16:41:09,237 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 16:41:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967913541] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:41:09,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:41:09,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-08-30 16:41:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225076746] [2023-08-30 16:41:09,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:41:09,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 16:41:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 16:41:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-08-30 16:41:09,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 209 [2023-08-30 16:41:09,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 349 flow. Second operand has 16 states, 16 states have (on average 80.25) internal successors, (1284), 16 states have internal predecessors, (1284), 0 states have call successors, (0), 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 16:41:09,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:09,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 209 [2023-08-30 16:41:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:11,171 INFO L130 PetriNetUnfolder]: 4454/9119 cut-off events. [2023-08-30 16:41:11,171 INFO L131 PetriNetUnfolder]: For 18314/18322 co-relation queries the response was YES. [2023-08-30 16:41:11,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28232 conditions, 9119 events. 4454/9119 cut-off events. For 18314/18322 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 74782 event pairs, 408 based on Foata normal form. 154/8960 useless extension candidates. Maximal degree in co-relation 25342. Up to 2362 conditions per place. [2023-08-30 16:41:11,217 INFO L137 encePairwiseOnDemand]: 193/209 looper letters, 397 selfloop transitions, 208 changer transitions 2/621 dead transitions. [2023-08-30 16:41:11,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 621 transitions, 4241 flow [2023-08-30 16:41:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-30 16:41:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-30 16:41:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 4280 transitions. [2023-08-30 16:41:11,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266347687400319 [2023-08-30 16:41:11,224 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 4280 transitions. [2023-08-30 16:41:11,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 4280 transitions. [2023-08-30 16:41:11,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:11,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 4280 transitions. [2023-08-30 16:41:11,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 89.16666666666667) internal successors, (4280), 48 states have internal predecessors, (4280), 0 states have call successors, (0), 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 16:41:11,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 209.0) internal successors, (10241), 49 states have internal predecessors, (10241), 0 states have call successors, (0), 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 16:41:11,243 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 209.0) internal successors, (10241), 49 states have internal predecessors, (10241), 0 states have call successors, (0), 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 16:41:11,243 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 349 flow. Second operand 48 states and 4280 transitions. [2023-08-30 16:41:11,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 621 transitions, 4241 flow [2023-08-30 16:41:11,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 621 transitions, 4241 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:41:11,261 INFO L231 Difference]: Finished difference. Result has 134 places, 273 transitions, 2435 flow [2023-08-30 16:41:11,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=2435, PETRI_PLACES=134, PETRI_TRANSITIONS=273} [2023-08-30 16:41:11,262 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 85 predicate places. [2023-08-30 16:41:11,262 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 273 transitions, 2435 flow [2023-08-30 16:41:11,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 80.25) internal successors, (1284), 16 states have internal predecessors, (1284), 0 states have call successors, (0), 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 16:41:11,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:11,263 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:11,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 16:41:11,467 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,SelfDestructingSolverStorable10 [2023-08-30 16:41:11,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:41:11,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash -416986568, now seen corresponding path program 1 times [2023-08-30 16:41:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:11,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118839756] [2023-08-30 16:41:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:41:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118839756] [2023-08-30 16:41:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118839756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:41:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311313256] [2023-08-30 16:41:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:11,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:41:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:41:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:41:11,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 209 [2023-08-30 16:41:11,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 273 transitions, 2435 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 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 16:41:11,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:11,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 209 [2023-08-30 16:41:11,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:12,986 INFO L130 PetriNetUnfolder]: 6160/13257 cut-off events. [2023-08-30 16:41:12,986 INFO L131 PetriNetUnfolder]: For 77876/78119 co-relation queries the response was YES. [2023-08-30 16:41:13,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53487 conditions, 13257 events. 6160/13257 cut-off events. For 77876/78119 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 119544 event pairs, 900 based on Foata normal form. 383/13291 useless extension candidates. Maximal degree in co-relation 52158. Up to 4079 conditions per place. [2023-08-30 16:41:13,064 INFO L137 encePairwiseOnDemand]: 196/209 looper letters, 441 selfloop transitions, 444 changer transitions 0/925 dead transitions. [2023-08-30 16:41:13,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 925 transitions, 10077 flow [2023-08-30 16:41:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:41:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:41:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 906 transitions. [2023-08-30 16:41:13,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48165869218500795 [2023-08-30 16:41:13,066 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 906 transitions. [2023-08-30 16:41:13,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 906 transitions. [2023-08-30 16:41:13,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:13,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 906 transitions. [2023-08-30 16:41:13,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.66666666666667) internal successors, (906), 9 states have internal predecessors, (906), 0 states have call successors, (0), 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 16:41:13,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 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 16:41:13,069 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 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 16:41:13,069 INFO L175 Difference]: Start difference. First operand has 134 places, 273 transitions, 2435 flow. Second operand 9 states and 906 transitions. [2023-08-30 16:41:13,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 925 transitions, 10077 flow [2023-08-30 16:41:13,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 925 transitions, 9949 flow, removed 64 selfloop flow, removed 0 redundant places. [2023-08-30 16:41:13,359 INFO L231 Difference]: Finished difference. Result has 150 places, 687 transitions, 8583 flow [2023-08-30 16:41:13,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8583, PETRI_PLACES=150, PETRI_TRANSITIONS=687} [2023-08-30 16:41:13,360 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 101 predicate places. [2023-08-30 16:41:13,360 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 687 transitions, 8583 flow [2023-08-30 16:41:13,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 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 16:41:13,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:13,360 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:13,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:41:13,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:41:13,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 250385226, now seen corresponding path program 2 times [2023-08-30 16:41:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782708609] [2023-08-30 16:41:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:41:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782708609] [2023-08-30 16:41:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782708609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:41:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154318555] [2023-08-30 16:41:13,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:41:13,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:41:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:41:13,467 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 16:41:13,483 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 16:41:13,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 16:41:13,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:41:13,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 16:41:13,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:41:13,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:41:13,584 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:41:13,584 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 16:41:13,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:41:13,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 16:41:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:41:13,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:41:13,695 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_495) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-30 16:41:13,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:41:13,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-30 16:41:13,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:41:13,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 16:41:13,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2023-08-30 16:41:13,755 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 6 treesize of output 4 [2023-08-30 16:41:13,757 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 6 treesize of output 4 [2023-08-30 16:41:13,759 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 6 treesize of output 4 [2023-08-30 16:41:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-08-30 16:41:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154318555] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:41:13,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:41:13,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-08-30 16:41:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004191022] [2023-08-30 16:41:13,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:41:13,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 16:41:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:13,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 16:41:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-08-30 16:41:13,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 209 [2023-08-30 16:41:13,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 687 transitions, 8583 flow. Second operand has 17 states, 17 states have (on average 64.82352941176471) internal successors, (1102), 17 states have internal predecessors, (1102), 0 states have call successors, (0), 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 16:41:13,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:13,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 209 [2023-08-30 16:41:13,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:22,579 INFO L130 PetriNetUnfolder]: 24528/46483 cut-off events. [2023-08-30 16:41:22,579 INFO L131 PetriNetUnfolder]: For 414974/414982 co-relation queries the response was YES. [2023-08-30 16:41:22,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231645 conditions, 46483 events. 24528/46483 cut-off events. For 414974/414982 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 449211 event pairs, 4341 based on Foata normal form. 326/46800 useless extension candidates. Maximal degree in co-relation 225686. Up to 9980 conditions per place. [2023-08-30 16:41:22,968 INFO L137 encePairwiseOnDemand]: 192/209 looper letters, 1391 selfloop transitions, 1406 changer transitions 71/2875 dead transitions. [2023-08-30 16:41:22,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 2875 transitions, 39459 flow [2023-08-30 16:41:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-30 16:41:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-30 16:41:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3894 transitions. [2023-08-30 16:41:22,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3653250773993808 [2023-08-30 16:41:22,972 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3894 transitions. [2023-08-30 16:41:22,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3894 transitions. [2023-08-30 16:41:22,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:22,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3894 transitions. [2023-08-30 16:41:22,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 76.3529411764706) internal successors, (3894), 51 states have internal predecessors, (3894), 0 states have call successors, (0), 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 16:41:22,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 209.0) internal successors, (10868), 52 states have internal predecessors, (10868), 0 states have call successors, (0), 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 16:41:22,985 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 209.0) internal successors, (10868), 52 states have internal predecessors, (10868), 0 states have call successors, (0), 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 16:41:22,985 INFO L175 Difference]: Start difference. First operand has 150 places, 687 transitions, 8583 flow. Second operand 51 states and 3894 transitions. [2023-08-30 16:41:22,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 2875 transitions, 39459 flow [2023-08-30 16:41:27,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 2875 transitions, 39275 flow, removed 92 selfloop flow, removed 0 redundant places. [2023-08-30 16:41:27,068 INFO L231 Difference]: Finished difference. Result has 233 places, 1749 transitions, 28003 flow [2023-08-30 16:41:27,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=8511, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=28003, PETRI_PLACES=233, PETRI_TRANSITIONS=1749} [2023-08-30 16:41:27,069 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 184 predicate places. [2023-08-30 16:41:27,069 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 1749 transitions, 28003 flow [2023-08-30 16:41:27,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.82352941176471) internal successors, (1102), 17 states have internal predecessors, (1102), 0 states have call successors, (0), 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 16:41:27,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:27,070 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:27,078 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 16:41:27,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:41:27,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:41:27,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash 716772509, now seen corresponding path program 1 times [2023-08-30 16:41:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574004121] [2023-08-30 16:41:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:41:27,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574004121] [2023-08-30 16:41:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574004121] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:41:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535600577] [2023-08-30 16:41:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:27,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:41:27,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:41:27,378 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 16:41:27,381 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 16:41:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:27,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 16:41:27,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:41:27,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:41:27,507 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:41:27,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:41:27,532 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 6 treesize of output 5 [2023-08-30 16:41:27,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 16:41:27,601 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:41:27,601 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 16:41:27,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:41:27,681 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 14 treesize of output 16 [2023-08-30 16:41:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:41:27,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:41:27,765 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:41:27,842 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))))) is different from false [2023-08-30 16:41:27,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:41:27,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-08-30 16:41:28,023 INFO L321 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2023-08-30 16:41:28,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 129 [2023-08-30 16:41:28,027 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 92 treesize of output 90 [2023-08-30 16:41:28,030 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 90 treesize of output 88 [2023-08-30 16:41:28,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 135 [2023-08-30 16:41:28,043 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 107 treesize of output 105 [2023-08-30 16:41:28,046 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 105 treesize of output 103 [2023-08-30 16:41:28,049 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 103 treesize of output 101 [2023-08-30 16:41:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:41:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535600577] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:41:28,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:41:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2023-08-30 16:41:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090323449] [2023-08-30 16:41:28,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:41:28,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 16:41:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:28,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 16:41:28,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=377, Unknown=11, NotChecked=82, Total=552 [2023-08-30 16:41:28,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 209 [2023-08-30 16:41:28,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1749 transitions, 28003 flow. Second operand has 24 states, 24 states have (on average 63.625) internal successors, (1527), 24 states have internal predecessors, (1527), 0 states have call successors, (0), 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 16:41:28,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:28,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 209 [2023-08-30 16:41:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:29,469 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (<= c_~next_alloc_idx~0 62) (not (= c_~top~0 0)) (forall ((v_prenex_1003 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_prenex_1003) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (+ c_~next_alloc_idx~0 2) 0)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:29,768 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) (<= c_~next_alloc_idx~0 64)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))))) is different from false [2023-08-30 16:41:31,159 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:41:32,931 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:40,199 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:40,494 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-30 16:41:40,532 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (not (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 0)) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:42,183 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= |c_thr1Thread2of2ForFork0_push_#t~mem6#1| 3) (= 3 c_~top~0) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:42,408 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0))) is different from false [2023-08-30 16:41:44,239 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store .cse0 |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= (select .cse0 |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2023-08-30 16:41:44,350 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= 3 c_~top~0) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:44,659 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58| Int)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58|) 0))))) (and (or (forall ((v_ArrVal_554 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (not (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse0 (not (= (+ c_~next_alloc_idx~0 2) 0))) (or (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0)) (or .cse0 (<= c_~next_alloc_idx~0 62)) (forall ((|v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58| Int)) (or (forall ((v_prenex_1003 Int)) (not (= (select (store |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58| v_prenex_1003) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_push_~#newTop~0#1.base_58|) 0)))))) is different from false [2023-08-30 16:41:46,672 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= c_~top~0 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:48,401 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (= 3 c_~top~0) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:41:51,074 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)))) .cse1) (or .cse0 (forall ((v_ArrVal_550 Int) (|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_554 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| (store (select |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base| v_ArrVal_550) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_551) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_554) |v_thr1Thread2of2ForFork0_push_~#newTop~0#1.base_54|) 0) 0)))) .cse1))) is different from false [2023-08-30 16:42:38,731 INFO L130 PetriNetUnfolder]: 95249/182581 cut-off events. [2023-08-30 16:42:38,731 INFO L131 PetriNetUnfolder]: For 2210756/2210764 co-relation queries the response was YES. [2023-08-30 16:42:40,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040376 conditions, 182581 events. 95249/182581 cut-off events. For 2210756/2210764 co-relation queries the response was YES. Maximal size of possible extension queue 4693. Compared 2055601 event pairs, 16001 based on Foata normal form. 685/183260 useless extension candidates. Maximal degree in co-relation 1021228. Up to 35690 conditions per place. [2023-08-30 16:42:41,907 INFO L137 encePairwiseOnDemand]: 175/209 looper letters, 5271 selfloop transitions, 6917 changer transitions 333/12528 dead transitions. [2023-08-30 16:42:41,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 12528 transitions, 208748 flow [2023-08-30 16:42:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2023-08-30 16:42:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2023-08-30 16:42:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 15159 transitions. [2023-08-30 16:42:41,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3453861927546138 [2023-08-30 16:42:41,922 INFO L72 ComplementDD]: Start complementDD. Operand 210 states and 15159 transitions. [2023-08-30 16:42:41,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 15159 transitions. [2023-08-30 16:42:41,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:41,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 210 states and 15159 transitions. [2023-08-30 16:42:41,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 211 states, 210 states have (on average 72.18571428571428) internal successors, (15159), 210 states have internal predecessors, (15159), 0 states have call successors, (0), 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 16:42:41,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 211 states, 211 states have (on average 209.0) internal successors, (44099), 211 states have internal predecessors, (44099), 0 states have call successors, (0), 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 16:42:41,978 INFO L81 ComplementDD]: Finished complementDD. Result has 211 states, 211 states have (on average 209.0) internal successors, (44099), 211 states have internal predecessors, (44099), 0 states have call successors, (0), 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 16:42:41,979 INFO L175 Difference]: Start difference. First operand has 233 places, 1749 transitions, 28003 flow. Second operand 210 states and 15159 transitions. [2023-08-30 16:42:41,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 12528 transitions, 208748 flow [2023-08-30 16:44:06,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 12528 transitions, 206718 flow, removed 1015 selfloop flow, removed 0 redundant places. [2023-08-30 16:44:06,762 INFO L231 Difference]: Finished difference. Result has 561 places, 8772 transitions, 167459 flow [2023-08-30 16:44:06,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=27511, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=210, PETRI_FLOW=167459, PETRI_PLACES=561, PETRI_TRANSITIONS=8772} [2023-08-30 16:44:06,764 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 512 predicate places. [2023-08-30 16:44:06,764 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 8772 transitions, 167459 flow [2023-08-30 16:44:06,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 63.625) internal successors, (1527), 24 states have internal predecessors, (1527), 0 states have call successors, (0), 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 16:44:06,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:06,776 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:06,781 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 16:44:06,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:44:06,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:44:06,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 770367652, now seen corresponding path program 1 times [2023-08-30 16:44:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:06,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461024355] [2023-08-30 16:44:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:44:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461024355] [2023-08-30 16:44:07,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461024355] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:44:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390656040] [2023-08-30 16:44:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:07,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:44:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:44:07,165 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 16:44:07,166 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 16:44:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:07,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 16:44:07,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:44:07,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 16:44:07,284 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:44:07,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:44:07,295 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 6 treesize of output 5 [2023-08-30 16:44:07,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 16:44:07,368 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:44:07,368 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 16:44:07,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:44:07,412 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 14 treesize of output 16 [2023-08-30 16:44:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:44:07,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:44:07,493 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 6 treesize of output 4 [2023-08-30 16:44:07,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:44:07,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2023-08-30 16:44:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:44:07,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390656040] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:44:07,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:44:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2023-08-30 16:44:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524209299] [2023-08-30 16:44:07,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:44:07,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 16:44:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 16:44:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-08-30 16:44:08,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 209 [2023-08-30 16:44:08,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 8772 transitions, 167459 flow. Second operand has 24 states, 24 states have (on average 76.45833333333333) internal successors, (1835), 24 states have internal predecessors, (1835), 0 states have call successors, (0), 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 16:44:08,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:08,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 209 [2023-08-30 16:44:08,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15