./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/weaver/popl20-send-receive.wvr.c -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 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 03:48:34,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 03:48:34,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 03:48:34,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 03:48:34,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 03:48:34,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 03:48:34,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 03:48:34,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 03:48:34,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 03:48:34,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 03:48:34,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 03:48:34,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 03:48:34,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 03:48:34,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 03:48:34,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 03:48:34,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 03:48:34,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 03:48:34,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 03:48:34,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 03:48:34,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 03:48:34,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 03:48:34,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 03:48:34,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 03:48:34,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 03:48:34,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 03:48:34,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 03:48:34,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 03:48:34,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 03:48:34,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 03:48:34,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 03:48:34,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 03:48:34,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 03:48:34,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 03:48:34,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 03:48:34,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 03:48:34,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 03:48:34,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 03:48:34,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 03:48:34,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 03:48:34,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 03:48:34,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 03:48:34,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 03:48:34,255 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 03:48:34,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 03:48:34,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 03:48:34,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 03:48:34,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 03:48:34,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 03:48:34,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 03:48:34,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 03:48:34,258 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 03:48:34,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 03:48:34,259 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 03:48:34,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 03:48:34,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 03:48:34,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 03:48:34,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 03:48:34,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 03:48:34,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 03:48:34,261 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 03:48:34,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 03:48:34,261 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 03:48:34,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 03:48:34,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 03:48:34,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 03:48:34,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 03:48:34,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:48:34,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 03:48:34,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 03:48:34,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 03:48:34,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 03:48:34,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 03:48:34,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 03:48:34,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 03:48:34,264 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 03:48:34,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 03:48:34,264 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 03:48:34,264 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 -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 03:48:34,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 03:48:34,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 03:48:34,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 03:48:34,577 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 03:48:34,577 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 03:48:34,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-31 03:48:35,650 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 03:48:35,890 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 03:48:35,891 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-31 03:48:35,896 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6002790/1f58039138fe4a88a8a492d7f00263e7/FLAGcabff6df6 [2023-08-31 03:48:35,910 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6002790/1f58039138fe4a88a8a492d7f00263e7 [2023-08-31 03:48:35,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 03:48:35,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 03:48:35,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 03:48:35,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 03:48:35,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 03:48:35,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:48:35" (1/1) ... [2023-08-31 03:48:35,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44127c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:35, skipping insertion in model container [2023-08-31 03:48:35,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:48:35" (1/1) ... [2023-08-31 03:48:35,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 03:48:35,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 03:48:36,128 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2023-08-31 03:48:36,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:48:36,151 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 03:48:36,186 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2023-08-31 03:48:36,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:48:36,198 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 03:48:36,198 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 03:48:36,204 INFO L208 MainTranslator]: Completed translation [2023-08-31 03:48:36,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36 WrapperNode [2023-08-31 03:48:36,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 03:48:36,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 03:48:36,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 03:48:36,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 03:48:36,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,251 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-08-31 03:48:36,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 03:48:36,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 03:48:36,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 03:48:36,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 03:48:36,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,296 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 03:48:36,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 03:48:36,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 03:48:36,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 03:48:36,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (1/1) ... [2023-08-31 03:48:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:48:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:48:36,334 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-31 03:48:36,348 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-31 03:48:36,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 03:48:36,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 03:48:36,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 03:48:36,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 03:48:36,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 03:48:36,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 03:48:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 03:48:36,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 03:48:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 03:48:36,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 03:48:36,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 03:48:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 03:48:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 03:48:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 03:48:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 03:48:36,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 03:48:36,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 03:48:36,380 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 03:48:36,456 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 03:48:36,458 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 03:48:36,683 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 03:48:36,843 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 03:48:36,844 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-31 03:48:36,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:48:36 BoogieIcfgContainer [2023-08-31 03:48:36,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 03:48:36,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 03:48:36,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 03:48:36,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 03:48:36,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 03:48:35" (1/3) ... [2023-08-31 03:48:36,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62297e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:48:36, skipping insertion in model container [2023-08-31 03:48:36,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:48:36" (2/3) ... [2023-08-31 03:48:36,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62297e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:48:36, skipping insertion in model container [2023-08-31 03:48:36,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:48:36" (3/3) ... [2023-08-31 03:48:36,853 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-31 03:48:36,860 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 03:48:36,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 03:48:36,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 03:48:36,868 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 03:48:36,933 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 03:48:36,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 294 flow [2023-08-31 03:48:37,021 INFO L130 PetriNetUnfolder]: 10/132 cut-off events. [2023-08-31 03:48:37,022 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:48:37,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 10/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-31 03:48:37,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 294 flow [2023-08-31 03:48:37,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 262 flow [2023-08-31 03:48:37,036 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 03:48:37,046 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 262 flow [2023-08-31 03:48:37,055 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 122 transitions, 262 flow [2023-08-31 03:48:37,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 262 flow [2023-08-31 03:48:37,109 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2023-08-31 03:48:37,111 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:48:37,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 10/122 cut-off events. For 3/3 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/112 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-31 03:48:37,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-08-31 03:48:41,431 INFO L134 LiptonReduction]: Checked pairs total: 2055 [2023-08-31 03:48:41,432 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-31 03:48:41,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 03:48:41,450 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;@4f3c1d0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 03:48:41,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 03:48:41,456 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-08-31 03:48:41,456 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:48:41,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:41,457 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-31 03:48:41,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:41,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash 839295690, now seen corresponding path program 1 times [2023-08-31 03:48:41,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224281339] [2023-08-31 03:48:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:41,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:41,836 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-31 03:48:41,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224281339] [2023-08-31 03:48:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224281339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:48:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:48:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 03:48:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220875574] [2023-08-31 03:48:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:48:41,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 03:48:41,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 03:48:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 03:48:41,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-31 03:48:41,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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-31 03:48:41,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:41,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-31 03:48:41,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:42,055 INFO L130 PetriNetUnfolder]: 142/245 cut-off events. [2023-08-31 03:48:42,055 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 03:48:42,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 245 events. 142/245 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 933 event pairs, 10 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 412. Up to 89 conditions per place. [2023-08-31 03:48:42,063 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 40 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-31 03:48:42,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 214 flow [2023-08-31 03:48:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 03:48:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 03:48:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-31 03:48:42,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2023-08-31 03:48:42,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-31 03:48:42,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-31 03:48:42,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:48:42,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-31 03:48:42,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 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-31 03:48:42,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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-31 03:48:42,105 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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-31 03:48:42,106 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 612 transitions. [2023-08-31 03:48:42,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 214 flow [2023-08-31 03:48:42,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 191 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-31 03:48:42,111 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-08-31 03:48:42,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-08-31 03:48:42,116 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-31 03:48:42,117 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-08-31 03:48:42,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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-31 03:48:42,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:42,120 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-31 03:48:42,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 03:48:42,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:42,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 919484616, now seen corresponding path program 2 times [2023-08-31 03:48:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124255237] [2023-08-31 03:48:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:42,274 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-31 03:48:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:42,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124255237] [2023-08-31 03:48:42,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124255237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:48:42,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:48:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 03:48:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496675758] [2023-08-31 03:48:42,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:48:42,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 03:48:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 03:48:42,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 03:48:42,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-31 03:48:42,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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-31 03:48:42,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:42,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-31 03:48:42,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:42,395 INFO L130 PetriNetUnfolder]: 186/318 cut-off events. [2023-08-31 03:48:42,395 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2023-08-31 03:48:42,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 318 events. 186/318 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1057 event pairs, 30 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 452. Up to 147 conditions per place. [2023-08-31 03:48:42,398 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 38 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-31 03:48:42,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 229 flow [2023-08-31 03:48:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 03:48:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 03:48:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-31 03:48:42,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2023-08-31 03:48:42,400 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-31 03:48:42,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-31 03:48:42,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:48:42,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-31 03:48:42,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 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-31 03:48:42,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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-31 03:48:42,405 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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-31 03:48:42,406 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 610 transitions. [2023-08-31 03:48:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 229 flow [2023-08-31 03:48:42,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:48:42,408 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-08-31 03:48:42,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-31 03:48:42,409 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-31 03:48:42,409 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-08-31 03:48:42,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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-31 03:48:42,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:42,410 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-31 03:48:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 03:48:42,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:42,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 109437294, now seen corresponding path program 3 times [2023-08-31 03:48:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477233843] [2023-08-31 03:48:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:42,588 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-31 03:48:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477233843] [2023-08-31 03:48:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477233843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:48:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:48:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 03:48:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846962628] [2023-08-31 03:48:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:48:42,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 03:48:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 03:48:42,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 03:48:42,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246 [2023-08-31 03:48:42,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 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-31 03:48:42,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:42,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246 [2023-08-31 03:48:42,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:42,787 INFO L130 PetriNetUnfolder]: 256/454 cut-off events. [2023-08-31 03:48:42,787 INFO L131 PetriNetUnfolder]: For 336/349 co-relation queries the response was YES. [2023-08-31 03:48:42,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 454 events. 256/454 cut-off events. For 336/349 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1907 event pairs, 29 based on Foata normal form. 29/476 useless extension candidates. Maximal degree in co-relation 904. Up to 126 conditions per place. [2023-08-31 03:48:42,790 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 44 selfloop transitions, 8 changer transitions 21/76 dead transitions. [2023-08-31 03:48:42,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 414 flow [2023-08-31 03:48:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 03:48:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 03:48:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-08-31 03:48:42,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2023-08-31 03:48:42,793 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-08-31 03:48:42,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-08-31 03:48:42,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:48:42,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-08-31 03:48:42,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 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-31 03:48:42,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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-31 03:48:42,800 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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-31 03:48:42,800 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 852 transitions. [2023-08-31 03:48:42,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 414 flow [2023-08-31 03:48:42,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:48:42,803 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-08-31 03:48:42,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-31 03:48:42,804 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-31 03:48:42,804 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-08-31 03:48:42,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 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-31 03:48:42,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:42,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:48:42,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 03:48:42,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:42,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1817089691, now seen corresponding path program 1 times [2023-08-31 03:48:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376365114] [2023-08-31 03:48:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:48:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376365114] [2023-08-31 03:48:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376365114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:48:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:48:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:48:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997280952] [2023-08-31 03:48:42,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:48:42,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:48:42,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:48:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:48:42,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-31 03:48:42,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-31 03:48:42,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:42,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-31 03:48:42,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:42,997 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2023-08-31 03:48:42,997 INFO L131 PetriNetUnfolder]: For 323/336 co-relation queries the response was YES. [2023-08-31 03:48:42,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 163 events. 80/163 cut-off events. For 323/336 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 457 event pairs, 15 based on Foata normal form. 23/181 useless extension candidates. Maximal degree in co-relation 508. Up to 121 conditions per place. [2023-08-31 03:48:43,011 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-31 03:48:43,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 179 flow [2023-08-31 03:48:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:48:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:48:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-31 03:48:43,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494579945799458 [2023-08-31 03:48:43,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-31 03:48:43,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-31 03:48:43,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:48:43,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-31 03:48:43,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-31 03:48:43,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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-31 03:48:43,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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-31 03:48:43,018 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 365 transitions. [2023-08-31 03:48:43,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 179 flow [2023-08-31 03:48:43,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 157 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-31 03:48:43,023 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-08-31 03:48:43,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-31 03:48:43,024 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-31 03:48:43,025 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-08-31 03:48:43,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-31 03:48:43,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:43,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:48:43,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 03:48:43,026 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:43,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1140643143, now seen corresponding path program 1 times [2023-08-31 03:48:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351656106] [2023-08-31 03:48:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:43,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:48:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351656106] [2023-08-31 03:48:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351656106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:48:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:48:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 03:48:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084208473] [2023-08-31 03:48:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:48:43,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 03:48:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 03:48:43,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 03:48:43,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-31 03:48:43,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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-31 03:48:43,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:43,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-31 03:48:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:43,272 INFO L130 PetriNetUnfolder]: 83/178 cut-off events. [2023-08-31 03:48:43,272 INFO L131 PetriNetUnfolder]: For 228/250 co-relation queries the response was YES. [2023-08-31 03:48:43,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 178 events. 83/178 cut-off events. For 228/250 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 40 based on Foata normal form. 26/197 useless extension candidates. Maximal degree in co-relation 547. Up to 137 conditions per place. [2023-08-31 03:48:43,274 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-08-31 03:48:43,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 197 flow [2023-08-31 03:48:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 03:48:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 03:48:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-31 03:48:43,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49085365853658536 [2023-08-31 03:48:43,276 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-31 03:48:43,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-31 03:48:43,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:48:43,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-31 03:48:43,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 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-31 03:48:43,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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-31 03:48:43,280 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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-31 03:48:43,280 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 483 transitions. [2023-08-31 03:48:43,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 197 flow [2023-08-31 03:48:43,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:48:43,283 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-08-31 03:48:43,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 03:48:43,285 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-31 03:48:43,285 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-08-31 03:48:43,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 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-31 03:48:43,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:43,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:48:43,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 03:48:43,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:43,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash 438039640, now seen corresponding path program 1 times [2023-08-31 03:48:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506568801] [2023-08-31 03:48:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:48:43,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:43,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506568801] [2023-08-31 03:48:43,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506568801] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:48:43,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393930368] [2023-08-31 03:48:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:43,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:48:43,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:48:43,993 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-31 03:48:44,021 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-31 03:48:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:44,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-31 03:48:44,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:48:44,256 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-31 03:48:44,339 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-31 03:48:44,419 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-31 03:48:44,484 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-31 03:48:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:48:44,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:48:45,227 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1)))))))) is different from false [2023-08-31 03:48:45,327 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse2)) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~back~0 0)) is different from false [2023-08-31 03:48:45,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:45,370 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 68 treesize of output 56 [2023-08-31 03:48:45,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:45,385 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 644 treesize of output 620 [2023-08-31 03:48:45,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:45,428 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 296 treesize of output 280 [2023-08-31 03:48:45,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:45,466 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 205 treesize of output 201 [2023-08-31 03:48:45,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:45,485 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 260 treesize of output 220 [2023-08-31 03:48:46,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:46,233 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 68 treesize of output 56 [2023-08-31 03:48:46,247 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:48:46,247 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 644 treesize of output 616 [2023-08-31 03:48:46,286 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:48:46,286 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 296 treesize of output 252 [2023-08-31 03:48:46,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:48:46,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2023-08-31 03:48:46,323 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:48:46,324 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 181 treesize of output 161 [2023-08-31 03:48:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 03:48:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393930368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:48:46,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:48:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2023-08-31 03:48:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504529353] [2023-08-31 03:48:46,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:48:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-31 03:48:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-31 03:48:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=616, Unknown=5, NotChecked=106, Total=870 [2023-08-31 03:48:46,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-31 03:48:46,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 120 flow. Second operand has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 0 states have call successors, (0), 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-31 03:48:46,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:46,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-31 03:48:46,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:54,199 INFO L130 PetriNetUnfolder]: 1286/2153 cut-off events. [2023-08-31 03:48:54,199 INFO L131 PetriNetUnfolder]: For 2109/2109 co-relation queries the response was YES. [2023-08-31 03:48:54,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6714 conditions, 2153 events. 1286/2153 cut-off events. For 2109/2109 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10640 event pairs, 25 based on Foata normal form. 126/2275 useless extension candidates. Maximal degree in co-relation 6701. Up to 423 conditions per place. [2023-08-31 03:48:54,212 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 294 selfloop transitions, 173 changer transitions 25/492 dead transitions. [2023-08-31 03:48:54,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 492 transitions, 2839 flow [2023-08-31 03:48:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-08-31 03:48:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-08-31 03:48:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 6068 transitions. [2023-08-31 03:48:54,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2740740740740741 [2023-08-31 03:48:54,236 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 6068 transitions. [2023-08-31 03:48:54,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 6068 transitions. [2023-08-31 03:48:54,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:48:54,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 6068 transitions. [2023-08-31 03:48:54,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 91 states, 90 states have (on average 67.42222222222222) internal successors, (6068), 90 states have internal predecessors, (6068), 0 states have call successors, (0), 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-31 03:48:54,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 0 states have call successors, (0), 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-31 03:48:54,296 INFO L81 ComplementDD]: Finished complementDD. Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 0 states have call successors, (0), 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-31 03:48:54,297 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 90 states and 6068 transitions. [2023-08-31 03:48:54,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 492 transitions, 2839 flow [2023-08-31 03:48:54,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 492 transitions, 2801 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-31 03:48:54,308 INFO L231 Difference]: Finished difference. Result has 162 places, 215 transitions, 1574 flow [2023-08-31 03:48:54,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=1574, PETRI_PLACES=162, PETRI_TRANSITIONS=215} [2023-08-31 03:48:54,311 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2023-08-31 03:48:54,311 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 215 transitions, 1574 flow [2023-08-31 03:48:54,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 0 states have call successors, (0), 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-31 03:48:54,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:48:54,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:48:54,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 03:48:54,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-31 03:48:54,519 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:48:54,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:48:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -657298170, now seen corresponding path program 2 times [2023-08-31 03:48:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:48:54,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150367865] [2023-08-31 03:48:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:48:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:48:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:48:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:48:55,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:48:55,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150367865] [2023-08-31 03:48:55,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150367865] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:48:55,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186161389] [2023-08-31 03:48:55,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:48:55,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:48:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:48:55,217 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-31 03:48:55,220 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-31 03:48:55,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:48:55,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:48:55,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-31 03:48:55,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:48:55,389 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-31 03:48:55,451 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-31 03:48:55,511 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-31 03:48:55,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:48:55,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 03:48:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:48:55,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:48:55,910 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0))))))) is different from false [2023-08-31 03:48:55,965 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2))))))) is different from false [2023-08-31 03:48:55,989 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-08-31 03:48:56,011 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-08-31 03:48:56,072 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) is different from false [2023-08-31 03:48:56,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:56,261 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 65 treesize of output 53 [2023-08-31 03:48:56,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:56,278 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 484 treesize of output 460 [2023-08-31 03:48:56,295 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 152 treesize of output 128 [2023-08-31 03:48:56,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:56,312 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 126 treesize of output 122 [2023-08-31 03:48:56,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:56,327 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 125 treesize of output 109 [2023-08-31 03:48:56,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:48:56,620 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-08-31 03:48:56,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 03:48:56,629 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:48:56,629 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 1 case distinctions, treesize of input 148 treesize of output 136 [2023-08-31 03:48:56,642 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:48:56,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 112 [2023-08-31 03:48:56,655 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 03:48:56,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2023-08-31 03:48:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 03:48:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186161389] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:48:56,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:48:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-08-31 03:48:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954294082] [2023-08-31 03:48:56,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:48:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-31 03:48:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:48:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-31 03:48:56,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2023-08-31 03:48:56,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-31 03:48:56,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 215 transitions, 1574 flow. Second operand has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 0 states have call successors, (0), 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-31 03:48:56,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:48:56,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-31 03:48:56,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:48:57,828 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-08-31 03:48:58,195 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) .cse2 .cse3 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4))))))) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-08-31 03:49:00,015 INFO L130 PetriNetUnfolder]: 1467/2438 cut-off events. [2023-08-31 03:49:00,016 INFO L131 PetriNetUnfolder]: For 71043/71043 co-relation queries the response was YES. [2023-08-31 03:49:00,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16181 conditions, 2438 events. 1467/2438 cut-off events. For 71043/71043 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11984 event pairs, 96 based on Foata normal form. 124/2560 useless extension candidates. Maximal degree in co-relation 16135. Up to 538 conditions per place. [2023-08-31 03:49:00,046 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 234 selfloop transitions, 168 changer transitions 111/513 dead transitions. [2023-08-31 03:49:00,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 513 transitions, 5566 flow [2023-08-31 03:49:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-31 03:49:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-31 03:49:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3986 transitions. [2023-08-31 03:49:00,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2746313903817004 [2023-08-31 03:49:00,056 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3986 transitions. [2023-08-31 03:49:00,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3986 transitions. [2023-08-31 03:49:00,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:00,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3986 transitions. [2023-08-31 03:49:00,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 67.55932203389831) internal successors, (3986), 59 states have internal predecessors, (3986), 0 states have call successors, (0), 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-31 03:49:00,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 246.0) internal successors, (14760), 60 states have internal predecessors, (14760), 0 states have call successors, (0), 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-31 03:49:00,123 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 246.0) internal successors, (14760), 60 states have internal predecessors, (14760), 0 states have call successors, (0), 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-31 03:49:00,123 INFO L175 Difference]: Start difference. First operand has 162 places, 215 transitions, 1574 flow. Second operand 59 states and 3986 transitions. [2023-08-31 03:49:00,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 513 transitions, 5566 flow [2023-08-31 03:49:00,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 513 transitions, 4843 flow, removed 251 selfloop flow, removed 13 redundant places. [2023-08-31 03:49:00,290 INFO L231 Difference]: Finished difference. Result has 234 places, 256 transitions, 2455 flow [2023-08-31 03:49:00,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=2455, PETRI_PLACES=234, PETRI_TRANSITIONS=256} [2023-08-31 03:49:00,291 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2023-08-31 03:49:00,292 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 256 transitions, 2455 flow [2023-08-31 03:49:00,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 0 states have call successors, (0), 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-31 03:49:00,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:00,293 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, 1, 1] [2023-08-31 03:49:00,303 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-31 03:49:00,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-31 03:49:00,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:00,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:00,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1053388881, now seen corresponding path program 3 times [2023-08-31 03:49:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:00,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387925393] [2023-08-31 03:49:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387925393] [2023-08-31 03:49:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387925393] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976087833] [2023-08-31 03:49:01,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:49:01,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:01,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:01,389 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-31 03:49:01,392 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-31 03:49:01,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:49:01,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:49:01,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-31 03:49:01,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:49:01,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:01,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:01,853 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 68 treesize of output 44 [2023-08-31 03:49:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:49:02,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976087833] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:02,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:02,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2023-08-31 03:49:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750135415] [2023-08-31 03:49:02,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:02,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-31 03:49:02,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-31 03:49:02,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-08-31 03:49:02,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 246 [2023-08-31 03:49:02,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 256 transitions, 2455 flow. Second operand has 25 states, 25 states have (on average 88.36) internal successors, (2209), 25 states have internal predecessors, (2209), 0 states have call successors, (0), 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-31 03:49:02,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:02,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 246 [2023-08-31 03:49:02,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:04,552 INFO L130 PetriNetUnfolder]: 1574/2651 cut-off events. [2023-08-31 03:49:04,552 INFO L131 PetriNetUnfolder]: For 147856/147856 co-relation queries the response was YES. [2023-08-31 03:49:04,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21894 conditions, 2651 events. 1574/2651 cut-off events. For 147856/147856 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13619 event pairs, 80 based on Foata normal form. 32/2682 useless extension candidates. Maximal degree in co-relation 21827. Up to 688 conditions per place. [2023-08-31 03:49:04,587 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 236 selfloop transitions, 153 changer transitions 60/449 dead transitions. [2023-08-31 03:49:04,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 449 transitions, 5322 flow [2023-08-31 03:49:04,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-31 03:49:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-31 03:49:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3212 transitions. [2023-08-31 03:49:04,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.373054587688734 [2023-08-31 03:49:04,592 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3212 transitions. [2023-08-31 03:49:04,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3212 transitions. [2023-08-31 03:49:04,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:04,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3212 transitions. [2023-08-31 03:49:04,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 91.77142857142857) internal successors, (3212), 35 states have internal predecessors, (3212), 0 states have call successors, (0), 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-31 03:49:04,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 0 states have call successors, (0), 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-31 03:49:04,650 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 0 states have call successors, (0), 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-31 03:49:04,650 INFO L175 Difference]: Start difference. First operand has 234 places, 256 transitions, 2455 flow. Second operand 35 states and 3212 transitions. [2023-08-31 03:49:04,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 449 transitions, 5322 flow [2023-08-31 03:49:05,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 449 transitions, 4630 flow, removed 303 selfloop flow, removed 29 redundant places. [2023-08-31 03:49:05,097 INFO L231 Difference]: Finished difference. Result has 235 places, 287 transitions, 2888 flow [2023-08-31 03:49:05,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2888, PETRI_PLACES=235, PETRI_TRANSITIONS=287} [2023-08-31 03:49:05,098 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2023-08-31 03:49:05,098 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 287 transitions, 2888 flow [2023-08-31 03:49:05,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 88.36) internal successors, (2209), 25 states have internal predecessors, (2209), 0 states have call successors, (0), 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-31 03:49:05,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:05,100 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, 1, 1] [2023-08-31 03:49:05,105 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-31 03:49:05,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:05,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:05,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 238639103, now seen corresponding path program 4 times [2023-08-31 03:49:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:05,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591233744] [2023-08-31 03:49:05,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591233744] [2023-08-31 03:49:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591233744] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804216967] [2023-08-31 03:49:06,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 03:49:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:06,141 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-31 03:49:06,160 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-31 03:49:06,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 03:49:06,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:49:06,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-31 03:49:06,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:49:06,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-31 03:49:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:49:06,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:06,663 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-08-31 03:49:06,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:06,694 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 110 treesize of output 86 [2023-08-31 03:49:06,699 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 53 treesize of output 47 [2023-08-31 03:49:06,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-08-31 03:49:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:49:06,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804216967] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:06,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:06,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2023-08-31 03:49:06,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132021345] [2023-08-31 03:49:06,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:06,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-31 03:49:06,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:06,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-31 03:49:06,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2023-08-31 03:49:07,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-08-31 03:49:07,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 287 transitions, 2888 flow. Second operand has 29 states, 29 states have (on average 70.10344827586206) internal successors, (2033), 29 states have internal predecessors, (2033), 0 states have call successors, (0), 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-31 03:49:07,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:07,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-08-31 03:49:07,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:11,431 INFO L130 PetriNetUnfolder]: 1666/2784 cut-off events. [2023-08-31 03:49:11,431 INFO L131 PetriNetUnfolder]: For 155899/155899 co-relation queries the response was YES. [2023-08-31 03:49:11,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23896 conditions, 2784 events. 1666/2784 cut-off events. For 155899/155899 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14330 event pairs, 103 based on Foata normal form. 42/2826 useless extension candidates. Maximal degree in co-relation 23826. Up to 750 conditions per place. [2023-08-31 03:49:11,508 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 223 selfloop transitions, 202 changer transitions 37/462 dead transitions. [2023-08-31 03:49:11,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 462 transitions, 5830 flow [2023-08-31 03:49:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-31 03:49:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-31 03:49:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2798 transitions. [2023-08-31 03:49:11,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29931536157466837 [2023-08-31 03:49:11,518 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2798 transitions. [2023-08-31 03:49:11,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2798 transitions. [2023-08-31 03:49:11,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:11,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2798 transitions. [2023-08-31 03:49:11,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 73.63157894736842) internal successors, (2798), 38 states have internal predecessors, (2798), 0 states have call successors, (0), 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-31 03:49:11,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 246.0) internal successors, (9594), 39 states have internal predecessors, (9594), 0 states have call successors, (0), 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-31 03:49:11,547 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 246.0) internal successors, (9594), 39 states have internal predecessors, (9594), 0 states have call successors, (0), 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-31 03:49:11,547 INFO L175 Difference]: Start difference. First operand has 235 places, 287 transitions, 2888 flow. Second operand 38 states and 2798 transitions. [2023-08-31 03:49:11,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 462 transitions, 5830 flow [2023-08-31 03:49:11,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 462 transitions, 5107 flow, removed 264 selfloop flow, removed 17 redundant places. [2023-08-31 03:49:11,959 INFO L231 Difference]: Finished difference. Result has 257 places, 316 transitions, 3239 flow [2023-08-31 03:49:11,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=3239, PETRI_PLACES=257, PETRI_TRANSITIONS=316} [2023-08-31 03:49:11,960 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 226 predicate places. [2023-08-31 03:49:11,961 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 316 transitions, 3239 flow [2023-08-31 03:49:11,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 70.10344827586206) internal successors, (2033), 29 states have internal predecessors, (2033), 0 states have call successors, (0), 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-31 03:49:11,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:11,962 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:49:11,968 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-31 03:49:12,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:12,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:12,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2047561495, now seen corresponding path program 5 times [2023-08-31 03:49:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222008229] [2023-08-31 03:49:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222008229] [2023-08-31 03:49:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222008229] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664482604] [2023-08-31 03:49:12,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:49:12,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:12,338 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-31 03:49:12,362 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-31 03:49:12,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-31 03:49:12,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:49:12,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 03:49:12,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:12,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664482604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:12,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-08-31 03:49:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717849380] [2023-08-31 03:49:12,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:12,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 03:49:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 03:49:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-08-31 03:49:12,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-08-31 03:49:12,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 316 transitions, 3239 flow. Second operand has 14 states, 14 states have (on average 109.85714285714286) internal successors, (1538), 14 states have internal predecessors, (1538), 0 states have call successors, (0), 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-31 03:49:12,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:12,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-08-31 03:49:12,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:13,325 INFO L130 PetriNetUnfolder]: 778/1476 cut-off events. [2023-08-31 03:49:13,325 INFO L131 PetriNetUnfolder]: For 104590/104647 co-relation queries the response was YES. [2023-08-31 03:49:13,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14444 conditions, 1476 events. 778/1476 cut-off events. For 104590/104647 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8123 event pairs, 93 based on Foata normal form. 65/1473 useless extension candidates. Maximal degree in co-relation 14373. Up to 823 conditions per place. [2023-08-31 03:49:13,349 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 127 selfloop transitions, 25 changer transitions 45/257 dead transitions. [2023-08-31 03:49:13,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 257 transitions, 2979 flow [2023-08-31 03:49:13,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:49:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:49:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2023-08-31 03:49:13,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-31 03:49:13,352 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 902 transitions. [2023-08-31 03:49:13,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions. [2023-08-31 03:49:13,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:13,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions. [2023-08-31 03:49:13,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 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-31 03:49:13,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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-31 03:49:13,356 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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-31 03:49:13,356 INFO L175 Difference]: Start difference. First operand has 257 places, 316 transitions, 3239 flow. Second operand 8 states and 902 transitions. [2023-08-31 03:49:13,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 257 transitions, 2979 flow [2023-08-31 03:49:13,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 257 transitions, 2643 flow, removed 68 selfloop flow, removed 41 redundant places. [2023-08-31 03:49:13,593 INFO L231 Difference]: Finished difference. Result has 202 places, 209 transitions, 1911 flow [2023-08-31 03:49:13,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1911, PETRI_PLACES=202, PETRI_TRANSITIONS=209} [2023-08-31 03:49:13,594 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2023-08-31 03:49:13,594 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 209 transitions, 1911 flow [2023-08-31 03:49:13,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 109.85714285714286) internal successors, (1538), 14 states have internal predecessors, (1538), 0 states have call successors, (0), 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-31 03:49:13,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:13,595 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-31 03:49:13,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-31 03:49:13,795 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,SelfDestructingSolverStorable9 [2023-08-31 03:49:13,796 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:13,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1748716820, now seen corresponding path program 6 times [2023-08-31 03:49:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479895417] [2023-08-31 03:49:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479895417] [2023-08-31 03:49:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479895417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036902867] [2023-08-31 03:49:15,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 03:49:15,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:15,411 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-31 03:49:15,413 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-31 03:49:15,526 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-31 03:49:15,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:49:15,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-31 03:49:15,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:49:15,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:15,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:15,875 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 68 treesize of output 44 [2023-08-31 03:49:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:49:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036902867] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:16,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 25 [2023-08-31 03:49:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362805236] [2023-08-31 03:49:16,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:16,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-31 03:49:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-31 03:49:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-08-31 03:49:17,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 246 [2023-08-31 03:49:17,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 209 transitions, 1911 flow. Second operand has 26 states, 26 states have (on average 82.46153846153847) internal successors, (2144), 26 states have internal predecessors, (2144), 0 states have call successors, (0), 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-31 03:49:17,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:17,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 246 [2023-08-31 03:49:17,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:19,198 INFO L130 PetriNetUnfolder]: 1111/1858 cut-off events. [2023-08-31 03:49:19,198 INFO L131 PetriNetUnfolder]: For 39985/39985 co-relation queries the response was YES. [2023-08-31 03:49:19,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13951 conditions, 1858 events. 1111/1858 cut-off events. For 39985/39985 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8979 event pairs, 15 based on Foata normal form. 42/1900 useless extension candidates. Maximal degree in co-relation 13894. Up to 586 conditions per place. [2023-08-31 03:49:19,213 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 166 selfloop transitions, 148 changer transitions 37/351 dead transitions. [2023-08-31 03:49:19,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 351 transitions, 4056 flow [2023-08-31 03:49:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-31 03:49:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-31 03:49:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2821 transitions. [2023-08-31 03:49:19,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34749938408474995 [2023-08-31 03:49:19,229 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2821 transitions. [2023-08-31 03:49:19,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2821 transitions. [2023-08-31 03:49:19,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:19,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2821 transitions. [2023-08-31 03:49:19,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 85.48484848484848) internal successors, (2821), 33 states have internal predecessors, (2821), 0 states have call successors, (0), 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-31 03:49:19,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 246.0) internal successors, (8364), 34 states have internal predecessors, (8364), 0 states have call successors, (0), 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-31 03:49:19,248 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 246.0) internal successors, (8364), 34 states have internal predecessors, (8364), 0 states have call successors, (0), 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-31 03:49:19,248 INFO L175 Difference]: Start difference. First operand has 202 places, 209 transitions, 1911 flow. Second operand 33 states and 2821 transitions. [2023-08-31 03:49:19,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 351 transitions, 4056 flow [2023-08-31 03:49:19,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 351 transitions, 3820 flow, removed 92 selfloop flow, removed 12 redundant places. [2023-08-31 03:49:19,323 INFO L231 Difference]: Finished difference. Result has 203 places, 225 transitions, 2418 flow [2023-08-31 03:49:19,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2418, PETRI_PLACES=203, PETRI_TRANSITIONS=225} [2023-08-31 03:49:19,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2023-08-31 03:49:19,324 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 225 transitions, 2418 flow [2023-08-31 03:49:19,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 82.46153846153847) internal successors, (2144), 26 states have internal predecessors, (2144), 0 states have call successors, (0), 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-31 03:49:19,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:19,325 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-31 03:49:19,333 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-31 03:49:19,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:19,531 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:19,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash -274856926, now seen corresponding path program 7 times [2023-08-31 03:49:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477373099] [2023-08-31 03:49:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477373099] [2023-08-31 03:49:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477373099] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601941853] [2023-08-31 03:49:20,530 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 03:49:20,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:20,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:20,533 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-31 03:49:20,536 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-31 03:49:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:20,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-31 03:49:20,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:20,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:49:20,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-31 03:49:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:49:20,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:21,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:21,187 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 110 treesize of output 86 [2023-08-31 03:49:21,192 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 53 treesize of output 47 [2023-08-31 03:49:21,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-08-31 03:49:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:49:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601941853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:21,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2023-08-31 03:49:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938970905] [2023-08-31 03:49:21,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:21,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-31 03:49:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-31 03:49:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=745, Unknown=7, NotChecked=0, Total=870 [2023-08-31 03:49:21,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-08-31 03:49:21,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 225 transitions, 2418 flow. Second operand has 30 states, 30 states have (on average 70.23333333333333) internal successors, (2107), 30 states have internal predecessors, (2107), 0 states have call successors, (0), 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-31 03:49:21,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:21,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-08-31 03:49:21,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:23,459 INFO L130 PetriNetUnfolder]: 1161/1938 cut-off events. [2023-08-31 03:49:23,459 INFO L131 PetriNetUnfolder]: For 22842/22842 co-relation queries the response was YES. [2023-08-31 03:49:23,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13553 conditions, 1938 events. 1161/1938 cut-off events. For 22842/22842 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9309 event pairs, 67 based on Foata normal form. 42/1980 useless extension candidates. Maximal degree in co-relation 13500. Up to 622 conditions per place. [2023-08-31 03:49:23,474 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 170 selfloop transitions, 143 changer transitions 37/350 dead transitions. [2023-08-31 03:49:23,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 350 transitions, 4297 flow [2023-08-31 03:49:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-31 03:49:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-31 03:49:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2212 transitions. [2023-08-31 03:49:23,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2997289972899729 [2023-08-31 03:49:23,478 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2212 transitions. [2023-08-31 03:49:23,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2212 transitions. [2023-08-31 03:49:23,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:23,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2212 transitions. [2023-08-31 03:49:23,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 73.73333333333333) internal successors, (2212), 30 states have internal predecessors, (2212), 0 states have call successors, (0), 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-31 03:49:23,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 246.0) internal successors, (7626), 31 states have internal predecessors, (7626), 0 states have call successors, (0), 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-31 03:49:23,487 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 246.0) internal successors, (7626), 31 states have internal predecessors, (7626), 0 states have call successors, (0), 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-31 03:49:23,488 INFO L175 Difference]: Start difference. First operand has 203 places, 225 transitions, 2418 flow. Second operand 30 states and 2212 transitions. [2023-08-31 03:49:23,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 350 transitions, 4297 flow [2023-08-31 03:49:23,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 350 transitions, 4007 flow, removed 29 selfloop flow, removed 17 redundant places. [2023-08-31 03:49:23,589 INFO L231 Difference]: Finished difference. Result has 217 places, 232 transitions, 2628 flow [2023-08-31 03:49:23,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2628, PETRI_PLACES=217, PETRI_TRANSITIONS=232} [2023-08-31 03:49:23,590 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2023-08-31 03:49:23,590 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 232 transitions, 2628 flow [2023-08-31 03:49:23,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 70.23333333333333) internal successors, (2107), 30 states have internal predecessors, (2107), 0 states have call successors, (0), 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-31 03:49:23,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:23,591 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:49:23,597 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-31 03:49:23,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:23,797 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:23,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 988250302, now seen corresponding path program 8 times [2023-08-31 03:49:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646557632] [2023-08-31 03:49:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:49:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646557632] [2023-08-31 03:49:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646557632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:49:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:49:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 03:49:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901490814] [2023-08-31 03:49:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:49:23,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 03:49:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 03:49:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 03:49:23,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-08-31 03:49:23,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 232 transitions, 2628 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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-31 03:49:23,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:23,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-08-31 03:49:23,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:24,404 INFO L130 PetriNetUnfolder]: 1570/2906 cut-off events. [2023-08-31 03:49:24,404 INFO L131 PetriNetUnfolder]: For 47060/47105 co-relation queries the response was YES. [2023-08-31 03:49:24,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20655 conditions, 2906 events. 1570/2906 cut-off events. For 47060/47105 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17769 event pairs, 219 based on Foata normal form. 110/2878 useless extension candidates. Maximal degree in co-relation 20602. Up to 1092 conditions per place. [2023-08-31 03:49:24,433 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 190 selfloop transitions, 83 changer transitions 0/339 dead transitions. [2023-08-31 03:49:24,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 339 transitions, 4482 flow [2023-08-31 03:49:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 03:49:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 03:49:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-31 03:49:24,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172764227642277 [2023-08-31 03:49:24,435 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-31 03:49:24,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-31 03:49:24,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:24,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-31 03:49:24,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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-31 03:49:24,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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-31 03:49:24,438 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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-31 03:49:24,438 INFO L175 Difference]: Start difference. First operand has 217 places, 232 transitions, 2628 flow. Second operand 4 states and 509 transitions. [2023-08-31 03:49:24,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 339 transitions, 4482 flow [2023-08-31 03:49:24,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 339 transitions, 4104 flow, removed 68 selfloop flow, removed 23 redundant places. [2023-08-31 03:49:24,519 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 3681 flow [2023-08-31 03:49:24,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3681, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2023-08-31 03:49:24,520 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2023-08-31 03:49:24,520 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 3681 flow [2023-08-31 03:49:24,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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-31 03:49:24,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:24,520 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:49:24,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 03:49:24,521 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:24,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash 279360084, now seen corresponding path program 9 times [2023-08-31 03:49:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145103242] [2023-08-31 03:49:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:24,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145103242] [2023-08-31 03:49:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145103242] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650929318] [2023-08-31 03:49:25,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:49:25,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:25,589 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-31 03:49:25,591 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-31 03:49:25,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 03:49:25,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:49:25,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-31 03:49:25,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:26,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:26,650 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-31 03:49:26,650 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 224 treesize of output 178 [2023-08-31 03:49:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650929318] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:27,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2023-08-31 03:49:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947271076] [2023-08-31 03:49:27,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:27,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-31 03:49:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:27,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-31 03:49:27,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2023-08-31 03:49:28,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 246 [2023-08-31 03:49:28,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 289 transitions, 3681 flow. Second operand has 34 states, 34 states have (on average 87.17647058823529) internal successors, (2964), 34 states have internal predecessors, (2964), 0 states have call successors, (0), 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-31 03:49:28,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:28,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 246 [2023-08-31 03:49:28,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:49:39,785 INFO L130 PetriNetUnfolder]: 9271/15383 cut-off events. [2023-08-31 03:49:39,785 INFO L131 PetriNetUnfolder]: For 211621/211621 co-relation queries the response was YES. [2023-08-31 03:49:39,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110014 conditions, 15383 events. 9271/15383 cut-off events. For 211621/211621 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 104717 event pairs, 387 based on Foata normal form. 572/15955 useless extension candidates. Maximal degree in co-relation 109959. Up to 4507 conditions per place. [2023-08-31 03:49:39,905 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 794 selfloop transitions, 846 changer transitions 548/2188 dead transitions. [2023-08-31 03:49:39,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 2188 transitions, 29162 flow [2023-08-31 03:49:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2023-08-31 03:49:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2023-08-31 03:49:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 13348 transitions. [2023-08-31 03:49:39,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37164494932620556 [2023-08-31 03:49:39,924 INFO L72 ComplementDD]: Start complementDD. Operand 146 states and 13348 transitions. [2023-08-31 03:49:39,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 13348 transitions. [2023-08-31 03:49:39,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:49:39,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 146 states and 13348 transitions. [2023-08-31 03:49:39,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 147 states, 146 states have (on average 91.42465753424658) internal successors, (13348), 146 states have internal predecessors, (13348), 0 states have call successors, (0), 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-31 03:49:39,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 147 states, 147 states have (on average 246.0) internal successors, (36162), 147 states have internal predecessors, (36162), 0 states have call successors, (0), 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-31 03:49:39,973 INFO L81 ComplementDD]: Finished complementDD. Result has 147 states, 147 states have (on average 246.0) internal successors, (36162), 147 states have internal predecessors, (36162), 0 states have call successors, (0), 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-31 03:49:39,974 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 3681 flow. Second operand 146 states and 13348 transitions. [2023-08-31 03:49:39,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 2188 transitions, 29162 flow [2023-08-31 03:49:40,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 2188 transitions, 29070 flow, removed 46 selfloop flow, removed 0 redundant places. [2023-08-31 03:49:40,388 INFO L231 Difference]: Finished difference. Result has 396 places, 1034 transitions, 16521 flow [2023-08-31 03:49:40,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=3633, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=146, PETRI_FLOW=16521, PETRI_PLACES=396, PETRI_TRANSITIONS=1034} [2023-08-31 03:49:40,389 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 365 predicate places. [2023-08-31 03:49:40,389 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1034 transitions, 16521 flow [2023-08-31 03:49:40,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 87.17647058823529) internal successors, (2964), 34 states have internal predecessors, (2964), 0 states have call successors, (0), 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-31 03:49:40,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:49:40,390 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:49:40,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-31 03:49:40,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-31 03:49:40,591 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:49:40,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:49:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash -761636766, now seen corresponding path program 10 times [2023-08-31 03:49:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:49:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126872358] [2023-08-31 03:49:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:49:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:49:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:49:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:41,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:49:41,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126872358] [2023-08-31 03:49:41,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126872358] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:49:41,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357839830] [2023-08-31 03:49:41,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 03:49:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:49:41,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:49:41,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:49:41,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-31 03:49:41,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 03:49:41,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:49:41,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-31 03:49:41,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:49:41,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-31 03:49:41,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-31 03:49:41,861 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-31 03:49:42,007 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-31 03:49:42,050 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-31 03:49:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:42,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:49:43,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:43,443 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 135 treesize of output 99 [2023-08-31 03:49:43,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:43,474 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 2306 treesize of output 2206 [2023-08-31 03:49:43,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:43,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 410 treesize of output 420 [2023-08-31 03:49:43,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:43,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 426 [2023-08-31 03:49:43,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:43,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 315 [2023-08-31 03:49:46,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:49:46,497 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 135 treesize of output 99 [2023-08-31 03:49:46,513 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:49:46,514 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 554 treesize of output 528 [2023-08-31 03:49:46,540 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:49:46,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 520 treesize of output 424 [2023-08-31 03:49:46,569 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:49:46,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 416 treesize of output 372 [2023-08-31 03:49:46,604 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:49:46,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 287 [2023-08-31 03:49:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:49:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357839830] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:49:47,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:49:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2023-08-31 03:49:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902756881] [2023-08-31 03:49:47,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:49:47,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-31 03:49:47,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:49:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-31 03:49:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1288, Unknown=10, NotChecked=0, Total=1560 [2023-08-31 03:49:47,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-08-31 03:49:47,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1034 transitions, 16521 flow. Second operand has 40 states, 40 states have (on average 65.75) internal successors, (2630), 40 states have internal predecessors, (2630), 0 states have call successors, (0), 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-31 03:49:47,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:49:47,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-08-31 03:49:47,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:50:13,273 INFO L130 PetriNetUnfolder]: 17388/29212 cut-off events. [2023-08-31 03:50:13,274 INFO L131 PetriNetUnfolder]: For 844539/844539 co-relation queries the response was YES. [2023-08-31 03:50:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258978 conditions, 29212 events. 17388/29212 cut-off events. For 844539/844539 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 224408 event pairs, 1462 based on Foata normal form. 672/29884 useless extension candidates. Maximal degree in co-relation 258870. Up to 8454 conditions per place. [2023-08-31 03:50:13,783 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 1225 selfloop transitions, 1285 changer transitions 1176/3686 dead transitions. [2023-08-31 03:50:13,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 3686 transitions, 65350 flow [2023-08-31 03:50:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-08-31 03:50:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2023-08-31 03:50:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 8013 transitions. [2023-08-31 03:50:13,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.285729567821994 [2023-08-31 03:50:13,796 INFO L72 ComplementDD]: Start complementDD. Operand 114 states and 8013 transitions. [2023-08-31 03:50:13,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 8013 transitions. [2023-08-31 03:50:13,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:50:13,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 114 states and 8013 transitions. [2023-08-31 03:50:13,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 115 states, 114 states have (on average 70.28947368421052) internal successors, (8013), 114 states have internal predecessors, (8013), 0 states have call successors, (0), 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-31 03:50:13,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 115 states, 115 states have (on average 246.0) internal successors, (28290), 115 states have internal predecessors, (28290), 0 states have call successors, (0), 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-31 03:50:13,838 INFO L81 ComplementDD]: Finished complementDD. Result has 115 states, 115 states have (on average 246.0) internal successors, (28290), 115 states have internal predecessors, (28290), 0 states have call successors, (0), 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-31 03:50:13,838 INFO L175 Difference]: Start difference. First operand has 396 places, 1034 transitions, 16521 flow. Second operand 114 states and 8013 transitions. [2023-08-31 03:50:13,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 3686 transitions, 65350 flow [2023-08-31 03:50:23,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 3686 transitions, 52506 flow, removed 5837 selfloop flow, removed 35 redundant places. [2023-08-31 03:50:23,996 INFO L231 Difference]: Finished difference. Result has 521 places, 1821 transitions, 27435 flow [2023-08-31 03:50:23,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=13125, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=570, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=114, PETRI_FLOW=27435, PETRI_PLACES=521, PETRI_TRANSITIONS=1821} [2023-08-31 03:50:23,998 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 490 predicate places. [2023-08-31 03:50:23,998 INFO L495 AbstractCegarLoop]: Abstraction has has 521 places, 1821 transitions, 27435 flow [2023-08-31 03:50:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 65.75) internal successors, (2630), 40 states have internal predecessors, (2630), 0 states have call successors, (0), 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-31 03:50:23,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:50:23,998 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:50:24,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 03:50:24,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-31 03:50:24,199 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:50:24,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:50:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1759649258, now seen corresponding path program 11 times [2023-08-31 03:50:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:50:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749777591] [2023-08-31 03:50:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:50:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:50:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:50:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:50:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:50:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749777591] [2023-08-31 03:50:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749777591] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:50:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131298839] [2023-08-31 03:50:25,215 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:50:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:50:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:50:25,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:50:25,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 03:50:25,343 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-08-31 03:50:25,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:50:25,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-31 03:50:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:50:25,455 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-31 03:50:25,506 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-31 03:50:25,569 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-31 03:50:25,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:50:25,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-31 03:50:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:50:25,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:50:26,310 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse8)) (.cse2 (+ c_~queue~0.offset .cse8 4))) (and (or (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (select .cse4 .cse3) 1)) (<= (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2)) 1))))) .cse5) (or (not .cse5) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse1) (select .cse6 .cse2))) (not (= (+ (select .cse6 .cse3) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))))))) (< c_~back~0 0)) is different from false [2023-08-31 03:50:26,628 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (<= c_~n~0 (+ c_~back~0 1))) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10))) (.cse2 (+ c_~queue~0.offset .cse11)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse4 (+ c_~queue~0.offset .cse10 4))) (and (or .cse0 (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 (not (= .cse7 1))) (or (not .cse0) .cse6 (not (= (+ .cse7 1) 0)) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1) (not (= (select .cse8 .cse4) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3))) (not (= (select .cse9 .cse4) 1)))))))))) (< c_~back~0 0)) is different from false [2023-08-31 03:50:27,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:50:27,201 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 132 treesize of output 96 [2023-08-31 03:50:27,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:50:27,231 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 3510 treesize of output 3322 [2023-08-31 03:50:27,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:50:27,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 330 treesize of output 340 [2023-08-31 03:50:27,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:50:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 356 treesize of output 294 [2023-08-31 03:50:27,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:50:27,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 259 [2023-08-31 03:50:29,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:50:29,686 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 132 treesize of output 96 [2023-08-31 03:50:29,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 03:50:29,704 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:50:29,705 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 266 treesize of output 240 [2023-08-31 03:50:29,724 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:50:29,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2023-08-31 03:50:29,743 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:50:29,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2023-08-31 03:50:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 03:50:30,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131298839] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:50:30,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:50:30,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2023-08-31 03:50:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153487689] [2023-08-31 03:50:30,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:50:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 03:50:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:50:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 03:50:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1000, Unknown=10, NotChecked=134, Total=1332 [2023-08-31 03:50:30,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-31 03:50:30,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 1821 transitions, 27435 flow. Second operand has 37 states, 37 states have (on average 63.891891891891895) internal successors, (2364), 37 states have internal predecessors, (2364), 0 states have call successors, (0), 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-31 03:50:30,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:50:30,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-31 03:50:30,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:50:31,335 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset .cse9)) (.cse5 (+ c_~queue~0.offset .cse9 4)) (.cse1 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_625))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse2 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse2 .cse3) 1) 0)) (<= 0 (+ (select .cse2 .cse4) c_~sum~0 (select .cse2 .cse5))))))))) (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_625))) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse3) 1) 0)) (<= (+ (select .cse6 .cse4) c_~sum~0 (select .cse6 .cse5)) 1)))) (not (= (select (select .cse7 c_~queue~0.base) .cse1) 1)))))))) (< c_~back~0 0)) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-08-31 03:50:32,429 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (<= c_~n~0 c_~back~0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse8)) (.cse2 (+ c_~queue~0.offset .cse8 4))) (and (or (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (select .cse4 .cse3) 1)) (<= (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2)) 1))))) .cse5) (or (not .cse5) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse1) (select .cse6 .cse2))) (not (= (+ (select .cse6 .cse3) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))))))) (< c_~back~0 0))) is different from false [2023-08-31 03:50:32,918 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front~0 4)) (.cse13 (* c_~back~0 4))) (let ((.cse4 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse13))) (.cse6 (+ c_~queue~0.offset .cse14)) (.cse7 (+ c_~queue~0.offset .cse14 4)) (.cse8 (+ c_~queue~0.offset .cse13 4))) (let ((.cse1 (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse11 .cse6) (select .cse11 .cse7))) (not (= (+ (select .cse11 .cse8) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse12 .cse6) (select .cse12 .cse7)) 1) (not (= (+ (select .cse12 .cse8) 1) 0))))))) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse10 (< c_~back~0 0)) (.cse3 (not (= .cse4 1)))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or (not .cse0) .cse2 (not (= (+ .cse4 1) 0)) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse6) (select .cse5 .cse7)) 1) (not (= (select .cse5 .cse8) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse9 .cse6) (select .cse9 .cse7))) (not (= (select .cse9 .cse8) 1))))))))) .cse10) (or (= (mod c_~v_assert~0 256) 0) .cse1 .cse2 .cse10 .cse3))))) is different from false [2023-08-31 03:50:53,830 INFO L130 PetriNetUnfolder]: 23036/38662 cut-off events. [2023-08-31 03:50:53,830 INFO L131 PetriNetUnfolder]: For 915335/915335 co-relation queries the response was YES. [2023-08-31 03:50:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355318 conditions, 38662 events. 23036/38662 cut-off events. For 915335/915335 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 304676 event pairs, 2149 based on Foata normal form. 1168/39830 useless extension candidates. Maximal degree in co-relation 355184. Up to 12715 conditions per place. [2023-08-31 03:50:54,878 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 1354 selfloop transitions, 1597 changer transitions 1296/4247 dead transitions. [2023-08-31 03:50:54,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 4247 transitions, 73121 flow [2023-08-31 03:50:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-08-31 03:50:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-08-31 03:50:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 6179 transitions. [2023-08-31 03:50:54,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27908762420957545 [2023-08-31 03:50:54,888 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 6179 transitions. [2023-08-31 03:50:54,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 6179 transitions. [2023-08-31 03:50:54,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:50:54,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 6179 transitions. [2023-08-31 03:50:54,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 91 states, 90 states have (on average 68.65555555555555) internal successors, (6179), 90 states have internal predecessors, (6179), 0 states have call successors, (0), 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-31 03:50:54,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 0 states have call successors, (0), 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-31 03:50:54,916 INFO L81 ComplementDD]: Finished complementDD. Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 0 states have call successors, (0), 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-31 03:50:54,916 INFO L175 Difference]: Start difference. First operand has 521 places, 1821 transitions, 27435 flow. Second operand 90 states and 6179 transitions. [2023-08-31 03:50:54,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 4247 transitions, 73121 flow [2023-08-31 03:51:03,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 4247 transitions, 70516 flow, removed 1222 selfloop flow, removed 20 redundant places. [2023-08-31 03:51:03,235 INFO L231 Difference]: Finished difference. Result has 619 places, 2252 transitions, 39663 flow [2023-08-31 03:51:03,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=21716, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=878, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=39663, PETRI_PLACES=619, PETRI_TRANSITIONS=2252} [2023-08-31 03:51:03,236 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 588 predicate places. [2023-08-31 03:51:03,237 INFO L495 AbstractCegarLoop]: Abstraction has has 619 places, 2252 transitions, 39663 flow [2023-08-31 03:51:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 63.891891891891895) internal successors, (2364), 37 states have internal predecessors, (2364), 0 states have call successors, (0), 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-31 03:51:03,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:51:03,237 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:51:03,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 03:51:03,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-31 03:51:03,438 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:51:03,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:51:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash 512154052, now seen corresponding path program 12 times [2023-08-31 03:51:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:51:03,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667281068] [2023-08-31 03:51:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:51:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:51:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:51:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:51:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:51:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667281068] [2023-08-31 03:51:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667281068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:51:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765834512] [2023-08-31 03:51:04,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 03:51:04,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:51:04,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:51:04,364 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:51:04,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 03:51:04,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-31 03:51:04,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:51:04,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-31 03:51:04,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:51:04,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:51:04,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 03:51:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:51:05,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:51:05,722 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9)) (.cse2 (+ c_~queue~0.offset .cse9 4)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse5 (<= (+ c_~back~0 1) c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse4 .cse3) 1)) (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))))))) .cse5 .cse6) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2)) 1) (not (= (+ (select .cse8 .cse3) 1) 0)))))) .cse5 (not .cse6))))) (< c_~front~0 0)) is different from false [2023-08-31 03:51:05,889 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-31 03:51:05,890 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 507 treesize of output 411 [2023-08-31 03:51:05,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:51:05,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 270 treesize of output 270 [2023-08-31 03:51:05,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:51:05,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 251 [2023-08-31 03:51:05,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:51:05,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 232 [2023-08-31 03:51:06,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:51:06,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 213 [2023-08-31 03:51:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:51:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765834512] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:51:09,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:51:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2023-08-31 03:51:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252813518] [2023-08-31 03:51:09,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:51:09,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 03:51:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:51:09,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 03:51:09,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1053, Unknown=1, NotChecked=68, Total=1332 [2023-08-31 03:51:09,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 246 [2023-08-31 03:51:09,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 2252 transitions, 39663 flow. Second operand has 37 states, 37 states have (on average 71.91891891891892) internal successors, (2661), 37 states have internal predecessors, (2661), 0 states have call successors, (0), 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-31 03:51:09,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:51:09,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 246 [2023-08-31 03:51:09,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:51:10,867 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~front~0 4)) (.cse11 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse14 (not .cse11)) (.cse10 (<= (+ c_~back~0 1) c_~front~0)) (.cse8 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse6 (+ c_~queue~0.offset .cse18)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~queue~0.offset .cse18 4))) (let ((.cse0 (let ((.cse17 (+ c_~sum~0 (select .cse16 .cse6) (select .cse16 .cse7)))) (and (<= .cse17 1) (<= 0 .cse17)))) (.cse3 (let ((.cse15 (select .cse16 .cse8))) (and (or .cse10 .cse14 (not (= (+ .cse15 1) 0))) (or .cse10 .cse11 (not (= .cse15 1)))))) (.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (or .cse0 .cse1 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse2 .cse3) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse4 .cse1 .cse2 .cse3) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or .cse4 .cse1 (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse6) (select .cse5 .cse7)) 1) (not (= (select .cse5 .cse8) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse9 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse9 .cse6) (select .cse9 .cse7))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse8) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse6) (select .cse12 .cse7)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse13 .cse6) (select .cse13 .cse7)) 1) (not (= (+ (select .cse13 .cse8) 1) 0)))))) .cse10 .cse14)) .cse2))))) is different from false [2023-08-31 03:51:11,911 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~front~0 4)) (.cse11 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse14 (not .cse11)) (.cse10 (<= (+ c_~back~0 1) c_~front~0)) (.cse8 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse6 (+ c_~queue~0.offset .cse18)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~queue~0.offset .cse18 4))) (let ((.cse0 (let ((.cse17 (+ c_~sum~0 (select .cse16 .cse6) (select .cse16 .cse7)))) (and (<= .cse17 1) (<= 0 .cse17)))) (.cse3 (let ((.cse15 (select .cse16 .cse8))) (and (or .cse10 .cse14 (not (= (+ .cse15 1) 0))) (or .cse10 .cse11 (not (= .cse15 1)))))) (.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse2 .cse3) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse4 .cse1 .cse2 .cse3) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse4 .cse1 (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse6) (select .cse5 .cse7)) 1) (not (= (select .cse5 .cse8) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse9 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse9 .cse6) (select .cse9 .cse7))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse8) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse6) (select .cse12 .cse7)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse13 .cse6) (select .cse13 .cse7)) 1) (not (= (+ (select .cse13 .cse8) 1) 0)))))) .cse10 .cse14)) .cse2))))) is different from false [2023-08-31 03:51:12,613 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse18 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse18)) (.cse7 (+ c_~queue~0.offset .cse18 4)) (.cse14 (not .cse11)) (.cse10 (<= (+ c_~back~0 1) c_~front~0)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ c_~queue~0.offset (* c_~back~0 4)))) (let ((.cse3 (let ((.cse17 (select .cse16 .cse8))) (and (or .cse10 .cse14 (not (= (+ .cse17 1) 0))) (or .cse10 .cse11 (not (= .cse17 1)))))) (.cse0 (let ((.cse15 (+ c_~sum~0 (select .cse16 .cse6) (select .cse16 .cse7)))) (and (<= .cse15 1) (<= 0 .cse15)))) (.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (or .cse0 .cse1 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse2 .cse3) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse4 .cse1 .cse2 .cse3) (<= 1 c_~v_assert~0) (or .cse0 (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) .cse2) (<= 0 c_~sum~0) (or .cse4 .cse1 (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse6) (select .cse5 .cse7)) 1) (not (= (select .cse5 .cse8) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse9 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse9 .cse6) (select .cse9 .cse7))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse8) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse6) (select .cse12 .cse7)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse13 .cse6) (select .cse13 .cse7)) 1) (not (= (+ (select .cse13 .cse8) 1) 0)))))) .cse10 .cse14)) .cse2))))) is different from false [2023-08-31 03:51:19,279 WARN L222 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 96 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:51:20,045 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~front~0 4)) (.cse11 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse14 (not .cse11)) (.cse10 (<= (+ c_~back~0 1) c_~front~0)) (.cse8 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse6 (+ c_~queue~0.offset .cse18)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~queue~0.offset .cse18 4))) (let ((.cse0 (let ((.cse17 (+ c_~sum~0 (select .cse16 .cse6) (select .cse16 .cse7)))) (and (<= .cse17 1) (<= 0 .cse17)))) (.cse3 (let ((.cse15 (select .cse16 .cse8))) (and (or .cse10 .cse14 (not (= (+ .cse15 1) 0))) (or .cse10 .cse11 (not (= .cse15 1)))))) (.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse2 .cse3) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse4 .cse1 .cse2 .cse3) (<= 1 c_~v_assert~0) (or .cse4 .cse1 (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse6) (select .cse5 .cse7)) 1) (not (= (select .cse5 .cse8) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse9 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse9 .cse6) (select .cse9 .cse7))))))) .cse10 .cse11) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse8) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse6) (select .cse12 .cse7)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse13 .cse6) (select .cse13 .cse7)) 1) (not (= (+ (select .cse13 .cse8) 1) 0)))))) .cse10 .cse14)) .cse2))))) is different from false [2023-08-31 03:51:25,545 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse16 (* c_~front~0 4))) (let ((.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse5 (<= c_~n~0 c_~back~0)) (.cse2 (+ c_~queue~0.offset .cse16)) (.cse3 (+ c_~queue~0.offset .cse16 4)) (.cse11 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse7 (<= (+ c_~back~0 1) c_~front~0)) (.cse8 (not .cse10)) (.cse6 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (let ((.cse1 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)))) (and (<= .cse0 1) (<= 0 .cse0))) .cse4 .cse5 .cse6 (let ((.cse9 (select .cse1 .cse11))) (and (or .cse7 .cse8 (not (= (+ .cse9 1) 0))) (or .cse7 .cse10 (not (= .cse9 1))))))) (or .cse4 .cse5 (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse12 .cse2) (select .cse12 .cse3)) 1) (not (= (select .cse12 .cse11) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse13 .cse11) 1)) (<= 0 (+ c_~sum~0 (select .cse13 .cse2) (select .cse13 .cse3))))))) .cse7 .cse10) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse14 .cse11) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse14 .cse2) (select .cse14 .cse3)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse15 .cse2) (select .cse15 .cse3)) 1) (not (= (+ (select .cse15 .cse11) 1) 0)))))) .cse7 .cse8)) .cse6)))) is different from false [2023-08-31 03:51:25,709 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse16 (* c_~front~0 4))) (let ((.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse5 (<= c_~n~0 c_~back~0)) (.cse2 (+ c_~queue~0.offset .cse16)) (.cse3 (+ c_~queue~0.offset .cse16 4)) (.cse11 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse7 (<= (+ c_~back~0 1) c_~front~0)) (.cse8 (not .cse10)) (.cse6 (< c_~front~0 0))) (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (let ((.cse1 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)))) (and (<= .cse0 1) (<= 0 .cse0))) .cse4 .cse5 .cse6 (let ((.cse9 (select .cse1 .cse11))) (and (or .cse7 .cse8 (not (= (+ .cse9 1) 0))) (or .cse7 .cse10 (not (= .cse9 1))))))) (or .cse4 .cse5 (and (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse12 .cse2) (select .cse12 .cse3)) 1) (not (= (select .cse12 .cse11) 1))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (select .cse13 .cse11) 1)) (<= 0 (+ c_~sum~0 (select .cse13 .cse2) (select .cse13 .cse3))))))) .cse7 .cse10) (or (and (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (not (= (+ (select .cse14 .cse11) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse14 .cse2) (select .cse14 .cse3)))))) (forall ((v_ArrVal_675 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_675) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse15 .cse2) (select .cse15 .cse3)) 1) (not (= (+ (select .cse15 .cse11) 1) 0)))))) .cse7 .cse8)) .cse6)))) is different from false [2023-08-31 03:51:49,298 INFO L130 PetriNetUnfolder]: 34702/58301 cut-off events. [2023-08-31 03:51:49,298 INFO L131 PetriNetUnfolder]: For 1896380/1896380 co-relation queries the response was YES. [2023-08-31 03:51:51,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599230 conditions, 58301 events. 34702/58301 cut-off events. For 1896380/1896380 co-relation queries the response was YES. Maximal size of possible extension queue 1605. Compared 491770 event pairs, 3359 based on Foata normal form. 515/58816 useless extension candidates. Maximal degree in co-relation 599061. Up to 19414 conditions per place. [2023-08-31 03:51:51,798 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 3669 selfloop transitions, 2061 changer transitions 865/6595 dead transitions. [2023-08-31 03:51:51,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 6595 transitions, 128782 flow [2023-08-31 03:51:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-08-31 03:51:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-08-31 03:51:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 5001 transitions. [2023-08-31 03:51:51,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3176448170731707 [2023-08-31 03:51:51,803 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 5001 transitions. [2023-08-31 03:51:51,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 5001 transitions. [2023-08-31 03:51:51,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:51:51,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 5001 transitions. [2023-08-31 03:51:51,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 78.140625) internal successors, (5001), 64 states have internal predecessors, (5001), 0 states have call successors, (0), 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-31 03:51:51,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 246.0) internal successors, (15990), 65 states have internal predecessors, (15990), 0 states have call successors, (0), 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-31 03:51:51,820 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 246.0) internal successors, (15990), 65 states have internal predecessors, (15990), 0 states have call successors, (0), 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-31 03:51:51,820 INFO L175 Difference]: Start difference. First operand has 619 places, 2252 transitions, 39663 flow. Second operand 64 states and 5001 transitions. [2023-08-31 03:51:51,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 6595 transitions, 128782 flow [2023-08-31 03:52:21,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 6595 transitions, 118049 flow, removed 4301 selfloop flow, removed 35 redundant places. [2023-08-31 03:52:21,634 INFO L231 Difference]: Finished difference. Result has 672 places, 3723 transitions, 69801 flow [2023-08-31 03:52:21,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=32730, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=663, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=69801, PETRI_PLACES=672, PETRI_TRANSITIONS=3723} [2023-08-31 03:52:21,636 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 641 predicate places. [2023-08-31 03:52:21,637 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 3723 transitions, 69801 flow [2023-08-31 03:52:21,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 71.91891891891892) internal successors, (2661), 37 states have internal predecessors, (2661), 0 states have call successors, (0), 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-31 03:52:21,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:52:21,637 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:52:21,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-31 03:52:21,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-31 03:52:21,846 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:52:21,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:52:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash 973488750, now seen corresponding path program 13 times [2023-08-31 03:52:21,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:52:21,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972488464] [2023-08-31 03:52:21,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:52:21,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:52:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:52:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:52:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:52:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972488464] [2023-08-31 03:52:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972488464] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:52:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172618916] [2023-08-31 03:52:22,901 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 03:52:22,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:52:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:52:22,903 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:52:22,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-31 03:52:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:52:23,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-31 03:52:23,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:52:23,125 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-31 03:52:23,171 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-31 03:52:23,228 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-31 03:52:23,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:52:23,512 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 29 treesize of output 29 [2023-08-31 03:52:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:52:23,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:52:24,453 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse8)) (.cse1 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse5 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse3)))) (not (= (select .cse0 .cse4) 1)) (not (= (+ (select .cse0 .cse5) 1) 0)))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse6 (select .cse7 c_~queue~0.base))) (or (not (= (select .cse6 .cse4) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 (select .cse6 .cse1) (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse3)) 1)) (not (= (+ (select .cse6 .cse5) 1) 0))))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0)) is different from false [2023-08-31 03:52:24,518 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse8 (* c_~back~0 4)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select .cse2 .cse3)) 1)) (not (= (select .cse2 .cse4) 1)) (not (= (+ (select .cse2 .cse5) 1) 0)))))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select .cse7 .cse3)))) (not (= (select .cse7 .cse4) 1)) (not (= (+ (select .cse7 .cse5) 1) 0))))))))) (< c_~back~0 0)) is different from false [2023-08-31 03:52:24,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:52:24,547 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 126 treesize of output 90 [2023-08-31 03:52:24,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:52:24,570 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 4130 treesize of output 3732 [2023-08-31 03:52:24,597 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 203 treesize of output 175 [2023-08-31 03:52:24,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:52:24,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 218 treesize of output 222 [2023-08-31 03:52:24,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:52:24,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 195 [2023-08-31 03:52:26,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:52:26,239 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-08-31 03:52:26,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 03:52:26,277 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:52:26,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2242 treesize of output 1944 [2023-08-31 03:52:26,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:52:26,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 03:52:26,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:52:26,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-08-31 03:52:26,395 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 03:52:26,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 135 [2023-08-31 03:52:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-31 03:52:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172618916] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:52:26,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:52:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2023-08-31 03:52:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898432975] [2023-08-31 03:52:26,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:52:26,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-31 03:52:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:52:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-31 03:52:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1317, Unknown=20, NotChecked=154, Total=1722 [2023-08-31 03:52:26,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-31 03:52:26,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 3723 transitions, 69801 flow. Second operand has 42 states, 42 states have (on average 63.88095238095238) internal successors, (2683), 42 states have internal predecessors, (2683), 0 states have call successors, (0), 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-31 03:52:26,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:52:26,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-31 03:52:26,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:52:27,412 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~back~0 4))) (let ((.cse20 (* c_~front~0 4)) (.cse11 (+ c_~queue~0.offset .cse21 4)) (.cse19 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~queue~0.offset .cse21))) (let ((.cse17 (select .cse19 .cse10)) (.cse15 (select .cse19 .cse11)) (.cse9 (+ c_~queue~0.offset .cse20 4)) (.cse7 (+ c_~queue~0.offset .cse20))) (let ((.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse0 (let ((.cse18 (select .cse19 .cse7))) (and (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 .cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse9)) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse9))))))) (.cse2 (not (= (+ .cse15 1) 0))) (.cse3 (<= c_~n~0 (+ c_~back~0 1))) (.cse5 (not (= .cse17 1))) (.cse4 (< c_~back~0 0)) (.cse14 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse6 (select .cse8 c_~queue~0.base))) (or (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 (select .cse6 .cse7) (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse9)))) (not (= (select .cse6 .cse10) 1)) (not (= (+ (select .cse6 .cse11) 1) 0)))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse12 (select .cse13 c_~queue~0.base))) (or (not (= (select .cse12 .cse10) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 (select .cse12 .cse7) (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse9)) 1)) (not (= (+ (select .cse12 .cse11) 1) 0))))))) .cse1 .cse3 .cse4) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) .cse1 .cse3 .cse4 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse2 .cse3 .cse4 .cse14 .cse5) (or .cse0 (let ((.cse16 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (not (= .cse15 1)) (not .cse16) .cse3 (not (= (+ .cse17 1) 0))) (or .cse2 .cse16 .cse3 .cse5))) .cse4 .cse14) (<= 1 c_~v_assert~0) (= c_~sum~0 0)))))) is different from false [2023-08-31 03:52:27,652 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse8)) (.cse1 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse5 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse3)))) (not (= (select .cse0 .cse4) 1)) (not (= (+ (select .cse0 .cse5) 1) 0)))))) (forall ((v_ArrVal_727 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_727))) (let ((.cse6 (select .cse7 c_~queue~0.base))) (or (not (= (select .cse6 .cse4) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 (select .cse6 .cse1) (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse3)) 1)) (not (= (+ (select .cse6 .cse5) 1) 0))))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0)) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-31 03:52:27,688 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~back~0 4)) (.cse5 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse9 (* c_~front~0 4))) (let ((.cse7 (select .cse5 (+ c_~queue~0.offset .cse9))) (.cse8 (+ c_~queue~0.offset .cse9 4))) (and (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse8)) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse8)))))))) (.cse1 (not (= (+ (select .cse5 (+ c_~queue~0.offset .cse6 4)) 1) 0))) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse3 (< c_~back~0 0)) (.cse4 (not (= (select .cse5 (+ c_~queue~0.offset .cse6)) 1)))) (and (or .cse0 (= (mod c_~v_assert~0 256) 0) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse3 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse4)))) is different from false [2023-08-31 03:52:30,156 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4))))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-31 03:52:30,738 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-08-31 03:52:30,919 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_728 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_728 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4))))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (<= 1 c_~v_assert~0) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-31 03:53:23,567 INFO L130 PetriNetUnfolder]: 43567/72298 cut-off events. [2023-08-31 03:53:23,567 INFO L131 PetriNetUnfolder]: For 4414807/4414807 co-relation queries the response was YES. [2023-08-31 03:53:26,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961005 conditions, 72298 events. 43567/72298 cut-off events. For 4414807/4414807 co-relation queries the response was YES. Maximal size of possible extension queue 2064. Compared 619397 event pairs, 5997 based on Foata normal form. 982/73280 useless extension candidates. Maximal degree in co-relation 960814. Up to 26217 conditions per place. [2023-08-31 03:53:27,089 INFO L137 encePairwiseOnDemand]: 228/246 looper letters, 3713 selfloop transitions, 1966 changer transitions 1086/6765 dead transitions. [2023-08-31 03:53:27,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 6765 transitions, 142682 flow [2023-08-31 03:53:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-08-31 03:53:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2023-08-31 03:53:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 5474 transitions. [2023-08-31 03:53:27,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2747164508682124 [2023-08-31 03:53:27,095 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 5474 transitions. [2023-08-31 03:53:27,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 5474 transitions. [2023-08-31 03:53:27,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:53:27,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 5474 transitions. [2023-08-31 03:53:27,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 82 states, 81 states have (on average 67.58024691358025) internal successors, (5474), 81 states have internal predecessors, (5474), 0 states have call successors, (0), 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-31 03:53:27,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 82 states, 82 states have (on average 246.0) internal successors, (20172), 82 states have internal predecessors, (20172), 0 states have call successors, (0), 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-31 03:53:27,115 INFO L81 ComplementDD]: Finished complementDD. Result has 82 states, 82 states have (on average 246.0) internal successors, (20172), 82 states have internal predecessors, (20172), 0 states have call successors, (0), 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-31 03:53:27,115 INFO L175 Difference]: Start difference. First operand has 672 places, 3723 transitions, 69801 flow. Second operand 81 states and 5474 transitions. [2023-08-31 03:53:27,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 6765 transitions, 142682 flow [2023-08-31 03:54:21,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 6765 transitions, 138551 flow, removed 1997 selfloop flow, removed 22 redundant places. [2023-08-31 03:54:21,685 INFO L231 Difference]: Finished difference. Result has 760 places, 4169 transitions, 85954 flow [2023-08-31 03:54:21,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=64458, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=85954, PETRI_PLACES=760, PETRI_TRANSITIONS=4169} [2023-08-31 03:54:21,688 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 729 predicate places. [2023-08-31 03:54:21,688 INFO L495 AbstractCegarLoop]: Abstraction has has 760 places, 4169 transitions, 85954 flow [2023-08-31 03:54:21,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 63.88095238095238) internal successors, (2683), 42 states have internal predecessors, (2683), 0 states have call successors, (0), 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-31 03:54:21,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:54:21,689 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:54:21,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-31 03:54:21,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-31 03:54:21,897 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:54:21,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:54:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash -987133649, now seen corresponding path program 14 times [2023-08-31 03:54:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:54:21,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178227862] [2023-08-31 03:54:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:54:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:54:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:54:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:54:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:54:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178227862] [2023-08-31 03:54:23,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178227862] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:54:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081462111] [2023-08-31 03:54:23,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:54:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:54:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:54:23,461 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:54:23,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-31 03:54:23,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:54:23,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:54:23,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-31 03:54:23,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:54:23,709 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 12 treesize of output 3 [2023-08-31 03:54:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:54:23,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:54:23,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:23,958 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 68 treesize of output 44 [2023-08-31 03:54:24,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:54:24,281 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 216 treesize of output 160 [2023-08-31 03:54:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:54:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081462111] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:54:24,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:54:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 32 [2023-08-31 03:54:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454088970] [2023-08-31 03:54:24,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:54:24,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-31 03:54:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:54:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-31 03:54:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2023-08-31 03:54:25,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 246 [2023-08-31 03:54:25,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 760 places, 4169 transitions, 85954 flow. Second operand has 33 states, 33 states have (on average 88.15151515151516) internal successors, (2909), 33 states have internal predecessors, (2909), 0 states have call successors, (0), 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-31 03:54:25,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:54:25,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 246 [2023-08-31 03:54:25,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:55:38,684 INFO L130 PetriNetUnfolder]: 48267/80008 cut-off events. [2023-08-31 03:55:38,684 INFO L131 PetriNetUnfolder]: For 6767139/6767139 co-relation queries the response was YES. [2023-08-31 03:55:42,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219281 conditions, 80008 events. 48267/80008 cut-off events. For 6767139/6767139 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 688755 event pairs, 7327 based on Foata normal form. 536/80544 useless extension candidates. Maximal degree in co-relation 1219062. Up to 32604 conditions per place. [2023-08-31 03:55:43,320 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 2866 selfloop transitions, 1853 changer transitions 1055/5774 dead transitions. [2023-08-31 03:55:43,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 5774 transitions, 136777 flow [2023-08-31 03:55:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-31 03:55:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-08-31 03:55:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4503 transitions. [2023-08-31 03:55:43,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37356893977103034 [2023-08-31 03:55:43,325 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4503 transitions. [2023-08-31 03:55:43,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4503 transitions. [2023-08-31 03:55:43,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:55:43,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4503 transitions. [2023-08-31 03:55:43,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 91.89795918367346) internal successors, (4503), 49 states have internal predecessors, (4503), 0 states have call successors, (0), 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-31 03:55:43,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 246.0) internal successors, (12300), 50 states have internal predecessors, (12300), 0 states have call successors, (0), 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-31 03:55:43,339 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 246.0) internal successors, (12300), 50 states have internal predecessors, (12300), 0 states have call successors, (0), 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-31 03:55:43,339 INFO L175 Difference]: Start difference. First operand has 760 places, 4169 transitions, 85954 flow. Second operand 49 states and 4503 transitions. [2023-08-31 03:55:43,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 763 places, 5774 transitions, 136777 flow [2023-08-31 03:56:56,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 5774 transitions, 132087 flow, removed 2220 selfloop flow, removed 46 redundant places. [2023-08-31 03:56:56,242 INFO L231 Difference]: Finished difference. Result has 737 places, 4327 transitions, 93722 flow [2023-08-31 03:56:56,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=83778, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1712, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=93722, PETRI_PLACES=737, PETRI_TRANSITIONS=4327} [2023-08-31 03:56:56,245 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 706 predicate places. [2023-08-31 03:56:56,246 INFO L495 AbstractCegarLoop]: Abstraction has has 737 places, 4327 transitions, 93722 flow [2023-08-31 03:56:56,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 88.15151515151516) internal successors, (2909), 33 states have internal predecessors, (2909), 0 states have call successors, (0), 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-31 03:56:56,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:56:56,246 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:56:56,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-31 03:56:56,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:56:56,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:56:56,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:56:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1531749725, now seen corresponding path program 15 times [2023-08-31 03:56:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:56:56,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60215052] [2023-08-31 03:56:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:56:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:56:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:56:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:56:57,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:56:57,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60215052] [2023-08-31 03:56:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60215052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:56:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167140159] [2023-08-31 03:56:57,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:56:57,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:56:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:56:57,833 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:56:57,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-31 03:56:58,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 03:56:58,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:56:58,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-31 03:56:58,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:56:58,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:56:58,339 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 19 treesize of output 21 [2023-08-31 03:56:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:56:58,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:56:59,202 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-31 03:56:59,202 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 497 treesize of output 401 [2023-08-31 03:56:59,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:56:59,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 260 [2023-08-31 03:56:59,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:56:59,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 241 [2023-08-31 03:56:59,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:56:59,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 222 [2023-08-31 03:56:59,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:56:59,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 203 [2023-08-31 03:57:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-31 03:57:01,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167140159] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:57:01,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:57:01,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2023-08-31 03:57:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498156183] [2023-08-31 03:57:01,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:57:01,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 03:57:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:57:01,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 03:57:01,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1148, Unknown=3, NotChecked=0, Total=1332 [2023-08-31 03:57:02,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-08-31 03:57:02,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 4327 transitions, 93722 flow. Second operand has 37 states, 37 states have (on average 70.0) internal successors, (2590), 37 states have internal predecessors, (2590), 0 states have call successors, (0), 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-31 03:57:02,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:57:02,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-08-31 03:57:02,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:57:11,921 WARN L222 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 73 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:57:22,524 WARN L222 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 77 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:57:34,048 WARN L222 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 63 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:57:41,117 WARN L222 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 68 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:57:51,420 WARN L222 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 67 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:59:17,730 INFO L130 PetriNetUnfolder]: 52936/87608 cut-off events. [2023-08-31 03:59:17,730 INFO L131 PetriNetUnfolder]: For 7748517/7748517 co-relation queries the response was YES. [2023-08-31 03:59:22,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359122 conditions, 87608 events. 52936/87608 cut-off events. For 7748517/7748517 co-relation queries the response was YES. Maximal size of possible extension queue 2635. Compared 766620 event pairs, 6285 based on Foata normal form. 593/88201 useless extension candidates. Maximal degree in co-relation 1358904. Up to 33613 conditions per place. [2023-08-31 03:59:22,994 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 2271 selfloop transitions, 3637 changer transitions 742/6650 dead transitions. [2023-08-31 03:59:22,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 6650 transitions, 163026 flow [2023-08-31 03:59:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-31 03:59:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-31 03:59:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 6412 transitions. [2023-08-31 03:59:23,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29959816839547704 [2023-08-31 03:59:23,000 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 6412 transitions. [2023-08-31 03:59:23,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 6412 transitions. [2023-08-31 03:59:23,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:59:23,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 6412 transitions. [2023-08-31 03:59:23,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 73.70114942528735) internal successors, (6412), 87 states have internal predecessors, (6412), 0 states have call successors, (0), 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-31 03:59:23,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 246.0) internal successors, (21648), 88 states have internal predecessors, (21648), 0 states have call successors, (0), 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-31 03:59:23,023 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 246.0) internal successors, (21648), 88 states have internal predecessors, (21648), 0 states have call successors, (0), 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-31 03:59:23,023 INFO L175 Difference]: Start difference. First operand has 737 places, 4327 transitions, 93722 flow. Second operand 87 states and 6412 transitions. [2023-08-31 03:59:23,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 6650 transitions, 163026 flow [2023-08-31 04:01:09,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 6650 transitions, 158395 flow, removed 1396 selfloop flow, removed 28 redundant places. [2023-08-31 04:01:09,687 INFO L231 Difference]: Finished difference. Result has 821 places, 5173 transitions, 122807 flow [2023-08-31 04:01:09,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=89930, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2716, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=122807, PETRI_PLACES=821, PETRI_TRANSITIONS=5173} [2023-08-31 04:01:09,690 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 790 predicate places. [2023-08-31 04:01:09,690 INFO L495 AbstractCegarLoop]: Abstraction has has 821 places, 5173 transitions, 122807 flow [2023-08-31 04:01:09,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 70.0) internal successors, (2590), 37 states have internal predecessors, (2590), 0 states have call successors, (0), 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-31 04:01:09,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 04:01:09,691 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 04:01:09,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-31 04:01:09,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:01:09,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 04:01:09,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 04:01:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash -509311565, now seen corresponding path program 16 times [2023-08-31 04:01:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 04:01:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192124958] [2023-08-31 04:01:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 04:01:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 04:01:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 04:01:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 04:01:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 04:01:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192124958] [2023-08-31 04:01:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192124958] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 04:01:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310054326] [2023-08-31 04:01:11,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 04:01:11,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 04:01:11,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 04:01:11,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 04:01:11,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-31 04:01:11,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 04:01:11,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 04:01:11,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 04:01:11,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 04:01:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 04:01:12,083 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 32 treesize of output 32 [2023-08-31 04:01:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 04:01:12,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 04:01:12,341 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_886 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_886) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_886 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_886) c_~queue~0.base) .cse0)))))) is different from false [2023-08-31 04:01:12,459 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_886 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_886) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1)) (forall ((v_ArrVal_886 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_886) c_~queue~0.base) .cse3) c_~sum~0 .cse4)))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) is different from false [2023-08-31 04:01:12,562 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-31 04:01:12,563 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 286 treesize of output 224 [2023-08-31 04:01:12,572 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 59 treesize of output 52 [2023-08-31 04:01:12,580 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 52 treesize of output 45 [2023-08-31 04:01:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2023-08-31 04:01:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310054326] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 04:01:13,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 04:01:13,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2023-08-31 04:01:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840445661] [2023-08-31 04:01:13,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 04:01:13,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-31 04:01:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 04:01:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-31 04:01:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1110, Unknown=2, NotChecked=138, Total=1406 [2023-08-31 04:01:13,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-31 04:01:13,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 5173 transitions, 122807 flow. Second operand has 38 states, 38 states have (on average 63.973684210526315) internal successors, (2431), 38 states have internal predecessors, (2431), 0 states have call successors, (0), 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-31 04:01:13,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 04:01:13,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-31 04:01:13,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 04:01:25,068 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_886 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_886) c_~queue~0.base) .cse4)) 1))) (.cse3 (forall ((v_ArrVal_886 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_886) c_~queue~0.base) .cse4)))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) .cse0 (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (and .cse0 .cse3)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) .cse3))) is different from false Killed by 15