./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/clever.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/clever.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 93a2fdd4bcf1d0c2ab8b4e49feeb28ec4b1782148939310f1cb0ffe97948195e --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 01:36:19,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 01:36:19,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 01:36:19,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 01:36:19,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 01:36:19,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 01:36:19,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 01:36:19,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 01:36:19,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 01:36:19,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 01:36:19,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 01:36:19,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 01:36:19,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 01:36:19,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 01:36:19,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 01:36:19,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 01:36:19,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 01:36:19,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 01:36:19,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 01:36:19,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 01:36:19,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 01:36:19,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 01:36:19,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 01:36:19,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 01:36:19,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 01:36:19,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 01:36:19,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 01:36:19,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 01:36:19,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 01:36:19,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 01:36:19,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 01:36:19,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 01:36:19,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 01:36:19,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 01:36:19,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 01:36:19,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 01:36:19,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 01:36:19,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 01:36:19,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 01:36:19,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 01:36:19,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 01:36:19,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 01:36:19,480 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 01:36:19,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 01:36:19,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 01:36:19,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 01:36:19,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 01:36:19,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 01:36:19,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 01:36:19,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 01:36:19,482 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 01:36:19,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 01:36:19,483 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 01:36:19,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 01:36:19,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 01:36:19,484 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 01:36:19,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 01:36:19,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 01:36:19,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 01:36:19,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 01:36:19,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 01:36:19,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 01:36:19,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 01:36:19,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 01:36:19,486 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 01:36:19,487 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 -> 93a2fdd4bcf1d0c2ab8b4e49feeb28ec4b1782148939310f1cb0ffe97948195e 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 01:36:19,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 01:36:19,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 01:36:19,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 01:36:19,740 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 01:36:19,740 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 01:36:19,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2023-08-31 01:36:20,882 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 01:36:21,019 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 01:36:21,019 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2023-08-31 01:36:21,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9dd50df/65a73c94aa2c42e198a30e5430c13732/FLAG2d49c046b [2023-08-31 01:36:21,062 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9dd50df/65a73c94aa2c42e198a30e5430c13732 [2023-08-31 01:36:21,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 01:36:21,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 01:36:21,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 01:36:21,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 01:36:21,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 01:36:21,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d6a6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21, skipping insertion in model container [2023-08-31 01:36:21,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 01:36:21,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 01:36:21,240 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/clever.wvr.c[2133,2146] [2023-08-31 01:36:21,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 01:36:21,252 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 01:36:21,275 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/clever.wvr.c[2133,2146] [2023-08-31 01:36:21,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 01:36:21,289 INFO L208 MainTranslator]: Completed translation [2023-08-31 01:36:21,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21 WrapperNode [2023-08-31 01:36:21,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 01:36:21,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 01:36:21,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 01:36:21,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 01:36:21,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,314 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2023-08-31 01:36:21,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 01:36:21,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 01:36:21,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 01:36:21,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 01:36:21,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,330 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 01:36:21,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 01:36:21,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 01:36:21,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 01:36:21,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (1/1) ... [2023-08-31 01:36:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 01:36:21,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:21,395 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 01:36:21,437 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 01:36:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 01:36:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 01:36:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 01:36:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 01:36:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 01:36:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 01:36:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 01:36:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 01:36:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 01:36:21,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 01:36:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 01:36:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 01:36:21,450 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 01:36:21,509 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 01:36:21,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 01:36:21,685 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 01:36:21,691 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 01:36:21,691 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-31 01:36:21,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:36:21 BoogieIcfgContainer [2023-08-31 01:36:21,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 01:36:21,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 01:36:21,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 01:36:21,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 01:36:21,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 01:36:21" (1/3) ... [2023-08-31 01:36:21,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237e0483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 01:36:21, skipping insertion in model container [2023-08-31 01:36:21,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:36:21" (2/3) ... [2023-08-31 01:36:21,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237e0483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 01:36:21, skipping insertion in model container [2023-08-31 01:36:21,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:36:21" (3/3) ... [2023-08-31 01:36:21,698 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2023-08-31 01:36:21,704 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 01:36:21,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 01:36:21,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 01:36:21,712 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 01:36:21,778 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 01:36:21,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 254 flow [2023-08-31 01:36:21,869 INFO L130 PetriNetUnfolder]: 9/117 cut-off events. [2023-08-31 01:36:21,873 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 01:36:21,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 9/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-31 01:36:21,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 254 flow [2023-08-31 01:36:21,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 109 transitions, 230 flow [2023-08-31 01:36:21,887 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 01:36:21,908 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 109 transitions, 230 flow [2023-08-31 01:36:21,910 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 109 transitions, 230 flow [2023-08-31 01:36:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 230 flow [2023-08-31 01:36:21,950 INFO L130 PetriNetUnfolder]: 9/109 cut-off events. [2023-08-31 01:36:21,953 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 01:36:21,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 9/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-31 01:36:21,956 INFO L119 LiptonReduction]: Number of co-enabled transitions 756 [2023-08-31 01:36:24,559 INFO L134 LiptonReduction]: Checked pairs total: 744 [2023-08-31 01:36:24,559 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-31 01:36:24,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 01:36:24,577 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;@574cad02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 01:36:24,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-31 01:36:24,580 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2023-08-31 01:36:24,580 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 01:36:24,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:24,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:24,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:24,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash -259219510, now seen corresponding path program 1 times [2023-08-31 01:36:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403536863] [2023-08-31 01:36:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:24,962 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 01:36:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403536863] [2023-08-31 01:36:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403536863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:36:24,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:36:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 01:36:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829776800] [2023-08-31 01:36:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:36:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 01:36:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:24,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 01:36:24,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 01:36:25,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 224 [2023-08-31 01:36:25,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 01:36:25,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:25,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 224 [2023-08-31 01:36:25,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:25,119 INFO L130 PetriNetUnfolder]: 69/117 cut-off events. [2023-08-31 01:36:25,120 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-31 01:36:25,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 117 events. 69/117 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 280 event pairs, 15 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 204. Up to 73 conditions per place. [2023-08-31 01:36:25,122 INFO L137 encePairwiseOnDemand]: 220/224 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2023-08-31 01:36:25,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 129 flow [2023-08-31 01:36:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 01:36:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 01:36:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-31 01:36:25,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2023-08-31 01:36:25,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-31 01:36:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-31 01:36:25,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:25,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-31 01:36:25,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 01:36:25,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 01:36:25,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 01:36:25,146 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 334 transitions. [2023-08-31 01:36:25,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 129 flow [2023-08-31 01:36:25,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 01:36:25,150 INFO L231 Difference]: Finished difference. Result has 18 places, 17 transitions, 53 flow [2023-08-31 01:36:25,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=18, PETRI_TRANSITIONS=17} [2023-08-31 01:36:25,154 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2023-08-31 01:36:25,154 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 17 transitions, 53 flow [2023-08-31 01:36:25,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 01:36:25,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:25,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:25,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 01:36:25,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:25,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1272176076, now seen corresponding path program 1 times [2023-08-31 01:36:25,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:25,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682021460] [2023-08-31 01:36:25,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:25,229 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 01:36:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682021460] [2023-08-31 01:36:25,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682021460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:36:25,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:36:25,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 01:36:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966543002] [2023-08-31 01:36:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:36:25,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:36:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:36:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:36:25,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 224 [2023-08-31 01:36:25,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 01:36:25,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:25,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 224 [2023-08-31 01:36:25,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:25,332 INFO L130 PetriNetUnfolder]: 121/217 cut-off events. [2023-08-31 01:36:25,332 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-31 01:36:25,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 217 events. 121/217 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 18 based on Foata normal form. 4/201 useless extension candidates. Maximal degree in co-relation 201. Up to 130 conditions per place. [2023-08-31 01:36:25,336 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 35 selfloop transitions, 6 changer transitions 8/49 dead transitions. [2023-08-31 01:36:25,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 49 transitions, 243 flow [2023-08-31 01:36:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:36:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:36:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-08-31 01:36:25,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-08-31 01:36:25,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-08-31 01:36:25,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-08-31 01:36:25,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:25,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-08-31 01:36:25,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 01:36:25,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:36:25,348 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:36:25,348 INFO L175 Difference]: Start difference. First operand has 18 places, 17 transitions, 53 flow. Second operand 5 states and 535 transitions. [2023-08-31 01:36:25,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 49 transitions, 243 flow [2023-08-31 01:36:25,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 49 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 01:36:25,350 INFO L231 Difference]: Finished difference. Result has 23 places, 22 transitions, 99 flow [2023-08-31 01:36:25,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=23, PETRI_TRANSITIONS=22} [2023-08-31 01:36:25,351 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 4 predicate places. [2023-08-31 01:36:25,351 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 99 flow [2023-08-31 01:36:25,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 01:36:25,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:25,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:25,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 01:36:25,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:25,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1400720826, now seen corresponding path program 2 times [2023-08-31 01:36:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357652962] [2023-08-31 01:36:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:25,476 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 01:36:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357652962] [2023-08-31 01:36:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357652962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:36:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:36:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 01:36:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123864834] [2023-08-31 01:36:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:36:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:36:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:36:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:36:25,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 224 [2023-08-31 01:36:25,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 01:36:25,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:25,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 224 [2023-08-31 01:36:25,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:25,554 INFO L130 PetriNetUnfolder]: 110/185 cut-off events. [2023-08-31 01:36:25,554 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2023-08-31 01:36:25,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 185 events. 110/185 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 14 based on Foata normal form. 8/193 useless extension candidates. Maximal degree in co-relation 190. Up to 128 conditions per place. [2023-08-31 01:36:25,556 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 29 selfloop transitions, 7 changer transitions 5/41 dead transitions. [2023-08-31 01:36:25,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 41 transitions, 247 flow [2023-08-31 01:36:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:36:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:36:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-08-31 01:36:25,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47232142857142856 [2023-08-31 01:36:25,558 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-08-31 01:36:25,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-08-31 01:36:25,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:25,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-08-31 01:36:25,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states 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 01:36:25,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:36:25,561 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:36:25,561 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 99 flow. Second operand 5 states and 529 transitions. [2023-08-31 01:36:25,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 41 transitions, 247 flow [2023-08-31 01:36:25,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 01:36:25,563 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 127 flow [2023-08-31 01:36:25,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-31 01:36:25,563 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 8 predicate places. [2023-08-31 01:36:25,563 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 127 flow [2023-08-31 01:36:25,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 01:36:25,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:25,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:25,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 01:36:25,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:25,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1139161799, now seen corresponding path program 1 times [2023-08-31 01:36:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710556741] [2023-08-31 01:36:25,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:36:25,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710556741] [2023-08-31 01:36:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710556741] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023697130] [2023-08-31 01:36:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:25,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:25,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:25,679 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 01:36:25,738 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 01:36:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:25,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 01:36:25,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:36:25,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:36:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023697130] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:25,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-08-31 01:36:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091633303] [2023-08-31 01:36:25,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:25,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 01:36:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 01:36:25,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 01:36:25,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:36:25,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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 01:36:25,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:25,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:36:25,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:26,076 INFO L130 PetriNetUnfolder]: 108/175 cut-off events. [2023-08-31 01:36:26,077 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2023-08-31 01:36:26,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 175 events. 108/175 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 466 event pairs, 0 based on Foata normal form. 16/191 useless extension candidates. Maximal degree in co-relation 289. Up to 91 conditions per place. [2023-08-31 01:36:26,078 INFO L137 encePairwiseOnDemand]: 219/224 looper letters, 31 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2023-08-31 01:36:26,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 264 flow [2023-08-31 01:36:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:36:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:36:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-08-31 01:36:26,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2023-08-31 01:36:26,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-08-31 01:36:26,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-08-31 01:36:26,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:26,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-08-31 01:36:26,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 01:36:26,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:36:26,083 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:36:26,083 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 127 flow. Second operand 5 states and 515 transitions. [2023-08-31 01:36:26,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 264 flow [2023-08-31 01:36:26,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 252 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 01:36:26,088 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 144 flow [2023-08-31 01:36:26,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2023-08-31 01:36:26,089 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 10 predicate places. [2023-08-31 01:36:26,089 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 144 flow [2023-08-31 01:36:26,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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 01:36:26,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:26,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:26,110 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 01:36:26,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:26,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:26,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1197066339, now seen corresponding path program 1 times [2023-08-31 01:36:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:26,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539471122] [2023-08-31 01:36:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539471122] [2023-08-31 01:36:26,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539471122] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736171527] [2023-08-31 01:36:26,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:26,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:26,617 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 01:36:26,620 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 01:36:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:26,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 01:36:26,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:29,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736171527] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:29,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:29,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-31 01:36:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450137097] [2023-08-31 01:36:29,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:29,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 01:36:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 01:36:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=108, Unknown=1, NotChecked=0, Total=156 [2023-08-31 01:36:29,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-08-31 01:36:29,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 144 flow. Second operand has 13 states, 13 states have (on average 86.0) internal successors, (1118), 13 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states 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 01:36:29,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:29,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-08-31 01:36:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:30,047 INFO L130 PetriNetUnfolder]: 260/427 cut-off events. [2023-08-31 01:36:30,047 INFO L131 PetriNetUnfolder]: For 528/528 co-relation queries the response was YES. [2023-08-31 01:36:30,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 427 events. 260/427 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1514 event pairs, 18 based on Foata normal form. 10/437 useless extension candidates. Maximal degree in co-relation 598. Up to 221 conditions per place. [2023-08-31 01:36:30,049 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 55 selfloop transitions, 20 changer transitions 14/89 dead transitions. [2023-08-31 01:36:30,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 89 transitions, 618 flow [2023-08-31 01:36:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 01:36:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 01:36:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 915 transitions. [2023-08-31 01:36:30,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40848214285714285 [2023-08-31 01:36:30,052 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 915 transitions. [2023-08-31 01:36:30,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 915 transitions. [2023-08-31 01:36:30,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:30,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 915 transitions. [2023-08-31 01:36:30,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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 01:36:30,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 224.0) internal successors, (2464), 11 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states 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 01:36:30,057 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 224.0) internal successors, (2464), 11 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states 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 01:36:30,057 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 144 flow. Second operand 10 states and 915 transitions. [2023-08-31 01:36:30,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 89 transitions, 618 flow [2023-08-31 01:36:30,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 89 transitions, 600 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 01:36:30,061 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 307 flow [2023-08-31 01:36:30,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=307, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-08-31 01:36:30,061 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 23 predicate places. [2023-08-31 01:36:30,061 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 307 flow [2023-08-31 01:36:30,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.0) internal successors, (1118), 13 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states 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 01:36:30,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:30,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:30,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-31 01:36:30,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:30,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:30,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1971463267, now seen corresponding path program 2 times [2023-08-31 01:36:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490703863] [2023-08-31 01:36:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490703863] [2023-08-31 01:36:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490703863] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45453724] [2023-08-31 01:36:30,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:36:30,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:30,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:30,593 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 01:36:30,616 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 01:36:30,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:36:30,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:36:30,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 01:36:30,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:30,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45453724] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:31,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-31 01:36:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163323988] [2023-08-31 01:36:31,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:31,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 01:36:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 01:36:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-08-31 01:36:31,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-31 01:36:31,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 307 flow. Second operand has 13 states, 13 states have (on average 93.84615384615384) internal successors, (1220), 13 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 01:36:31,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:31,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-31 01:36:31,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:31,901 INFO L130 PetriNetUnfolder]: 612/1001 cut-off events. [2023-08-31 01:36:31,901 INFO L131 PetriNetUnfolder]: For 2162/2162 co-relation queries the response was YES. [2023-08-31 01:36:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 1001 events. 612/1001 cut-off events. For 2162/2162 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4333 event pairs, 30 based on Foata normal form. 7/1008 useless extension candidates. Maximal degree in co-relation 4336. Up to 537 conditions per place. [2023-08-31 01:36:31,906 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 99 selfloop transitions, 59 changer transitions 7/165 dead transitions. [2023-08-31 01:36:31,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 165 transitions, 1402 flow [2023-08-31 01:36:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 01:36:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 01:36:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1497 transitions. [2023-08-31 01:36:31,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4455357142857143 [2023-08-31 01:36:31,910 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1497 transitions. [2023-08-31 01:36:31,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1497 transitions. [2023-08-31 01:36:31,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:31,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1497 transitions. [2023-08-31 01:36:31,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.8) internal successors, (1497), 15 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states 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 01:36:31,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 224.0) internal successors, (3584), 16 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states 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 01:36:31,916 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 224.0) internal successors, (3584), 16 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states 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 01:36:31,916 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 307 flow. Second operand 15 states and 1497 transitions. [2023-08-31 01:36:31,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 165 transitions, 1402 flow [2023-08-31 01:36:31,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 165 transitions, 1259 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-08-31 01:36:31,922 INFO L231 Difference]: Finished difference. Result has 60 places, 86 transitions, 847 flow [2023-08-31 01:36:31,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=847, PETRI_PLACES=60, PETRI_TRANSITIONS=86} [2023-08-31 01:36:31,923 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 41 predicate places. [2023-08-31 01:36:31,923 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 86 transitions, 847 flow [2023-08-31 01:36:31,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.84615384615384) internal successors, (1220), 13 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 01:36:31,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:31,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:31,928 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 01:36:32,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:32,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:32,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -237029505, now seen corresponding path program 3 times [2023-08-31 01:36:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441438906] [2023-08-31 01:36:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:32,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441438906] [2023-08-31 01:36:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441438906] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041390703] [2023-08-31 01:36:32,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:36:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:32,393 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 01:36:32,395 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 01:36:32,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 01:36:32,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:36:32,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-31 01:36:32,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:32,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041390703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:32,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-31 01:36:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897876737] [2023-08-31 01:36:32,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:32,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 01:36:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 01:36:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-08-31 01:36:33,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-31 01:36:33,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 86 transitions, 847 flow. Second operand has 13 states, 13 states have (on average 93.84615384615384) internal successors, (1220), 13 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 01:36:33,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:33,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-31 01:36:33,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:33,497 INFO L130 PetriNetUnfolder]: 1100/1797 cut-off events. [2023-08-31 01:36:33,497 INFO L131 PetriNetUnfolder]: For 7302/7302 co-relation queries the response was YES. [2023-08-31 01:36:33,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9172 conditions, 1797 events. 1100/1797 cut-off events. For 7302/7302 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8789 event pairs, 172 based on Foata normal form. 4/1801 useless extension candidates. Maximal degree in co-relation 7097. Up to 977 conditions per place. [2023-08-31 01:36:33,508 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 106 selfloop transitions, 80 changer transitions 5/191 dead transitions. [2023-08-31 01:36:33,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 191 transitions, 2112 flow [2023-08-31 01:36:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 01:36:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 01:36:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 988 transitions. [2023-08-31 01:36:33,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44107142857142856 [2023-08-31 01:36:33,511 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 988 transitions. [2023-08-31 01:36:33,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 988 transitions. [2023-08-31 01:36:33,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:33,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 988 transitions. [2023-08-31 01:36:33,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.8) internal successors, (988), 10 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:36:33,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 224.0) internal successors, (2464), 11 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states 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 01:36:33,515 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 224.0) internal successors, (2464), 11 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states 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 01:36:33,515 INFO L175 Difference]: Start difference. First operand has 60 places, 86 transitions, 847 flow. Second operand 10 states and 988 transitions. [2023-08-31 01:36:33,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 191 transitions, 2112 flow [2023-08-31 01:36:33,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 191 transitions, 1928 flow, removed 89 selfloop flow, removed 2 redundant places. [2023-08-31 01:36:33,552 INFO L231 Difference]: Finished difference. Result has 71 places, 132 transitions, 1490 flow [2023-08-31 01:36:33,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1490, PETRI_PLACES=71, PETRI_TRANSITIONS=132} [2023-08-31 01:36:33,552 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 52 predicate places. [2023-08-31 01:36:33,553 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 132 transitions, 1490 flow [2023-08-31 01:36:33,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.84615384615384) internal successors, (1220), 13 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 01:36:33,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:33,553 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:33,560 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 01:36:33,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:33,758 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:33,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1704426119, now seen corresponding path program 1 times [2023-08-31 01:36:33,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606041923] [2023-08-31 01:36:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:36:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606041923] [2023-08-31 01:36:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606041923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661304808] [2023-08-31 01:36:33,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:33,819 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 01:36:33,821 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 01:36:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:33,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:36:33,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:36:33,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:36:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661304808] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:33,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-31 01:36:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752088504] [2023-08-31 01:36:33,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:33,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 01:36:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:33,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 01:36:33,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 01:36:33,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:36:33,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 132 transitions, 1490 flow. Second operand has 10 states, 10 states have (on average 98.8) internal successors, (988), 10 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:36:33,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:33,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:36:33,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:34,404 INFO L130 PetriNetUnfolder]: 2041/3411 cut-off events. [2023-08-31 01:36:34,405 INFO L131 PetriNetUnfolder]: For 19991/19991 co-relation queries the response was YES. [2023-08-31 01:36:34,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18724 conditions, 3411 events. 2041/3411 cut-off events. For 19991/19991 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 19781 event pairs, 67 based on Foata normal form. 64/3475 useless extension candidates. Maximal degree in co-relation 13927. Up to 1821 conditions per place. [2023-08-31 01:36:34,427 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 324 selfloop transitions, 103 changer transitions 5/432 dead transitions. [2023-08-31 01:36:34,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 432 transitions, 5461 flow [2023-08-31 01:36:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 01:36:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 01:36:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1241 transitions. [2023-08-31 01:36:34,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616815476190476 [2023-08-31 01:36:34,430 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1241 transitions. [2023-08-31 01:36:34,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1241 transitions. [2023-08-31 01:36:34,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:34,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1241 transitions. [2023-08-31 01:36:34,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 103.41666666666667) internal successors, (1241), 12 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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 01:36:34,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 224.0) internal successors, (2912), 13 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states 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 01:36:34,436 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 224.0) internal successors, (2912), 13 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states 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 01:36:34,437 INFO L175 Difference]: Start difference. First operand has 71 places, 132 transitions, 1490 flow. Second operand 12 states and 1241 transitions. [2023-08-31 01:36:34,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 432 transitions, 5461 flow [2023-08-31 01:36:34,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 432 transitions, 5298 flow, removed 69 selfloop flow, removed 3 redundant places. [2023-08-31 01:36:34,466 INFO L231 Difference]: Finished difference. Result has 87 places, 217 transitions, 3056 flow [2023-08-31 01:36:34,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3056, PETRI_PLACES=87, PETRI_TRANSITIONS=217} [2023-08-31 01:36:34,468 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 68 predicate places. [2023-08-31 01:36:34,468 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 217 transitions, 3056 flow [2023-08-31 01:36:34,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.8) internal successors, (988), 10 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:36:34,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:34,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:34,489 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 01:36:34,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:34,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:34,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1605359529, now seen corresponding path program 2 times [2023-08-31 01:36:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124394524] [2023-08-31 01:36:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124394524] [2023-08-31 01:36:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124394524] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726594245] [2023-08-31 01:36:35,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:36:35,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:35,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:35,062 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 01:36:35,081 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 01:36:35,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:36:35,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:36:35,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 01:36:35,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:35,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:36:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726594245] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:36,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:36,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 15 [2023-08-31 01:36:36,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818000547] [2023-08-31 01:36:36,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-31 01:36:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-31 01:36:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-08-31 01:36:36,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-31 01:36:36,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 217 transitions, 3056 flow. Second operand has 17 states, 17 states have (on average 93.47058823529412) internal successors, (1589), 17 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states 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 01:36:36,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:36,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-31 01:36:36,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:40,303 INFO L130 PetriNetUnfolder]: 2497/4190 cut-off events. [2023-08-31 01:36:40,304 INFO L131 PetriNetUnfolder]: For 38200/38200 co-relation queries the response was YES. [2023-08-31 01:36:40,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27532 conditions, 4190 events. 2497/4190 cut-off events. For 38200/38200 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25238 event pairs, 196 based on Foata normal form. 12/4202 useless extension candidates. Maximal degree in co-relation 24298. Up to 3160 conditions per place. [2023-08-31 01:36:40,352 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 330 selfloop transitions, 86 changer transitions 25/441 dead transitions. [2023-08-31 01:36:40,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 441 transitions, 6700 flow [2023-08-31 01:36:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 01:36:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 01:36:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1695 transitions. [2023-08-31 01:36:40,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44511554621848737 [2023-08-31 01:36:40,357 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1695 transitions. [2023-08-31 01:36:40,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1695 transitions. [2023-08-31 01:36:40,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:40,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1695 transitions. [2023-08-31 01:36:40,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 99.70588235294117) internal successors, (1695), 17 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states 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 01:36:40,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 224.0) internal successors, (4032), 18 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states 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 01:36:40,365 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 224.0) internal successors, (4032), 18 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states 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 01:36:40,365 INFO L175 Difference]: Start difference. First operand has 87 places, 217 transitions, 3056 flow. Second operand 17 states and 1695 transitions. [2023-08-31 01:36:40,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 441 transitions, 6700 flow [2023-08-31 01:36:40,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 441 transitions, 6019 flow, removed 336 selfloop flow, removed 1 redundant places. [2023-08-31 01:36:40,447 INFO L231 Difference]: Finished difference. Result has 109 places, 277 transitions, 4044 flow [2023-08-31 01:36:40,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=2735, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4044, PETRI_PLACES=109, PETRI_TRANSITIONS=277} [2023-08-31 01:36:40,448 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 90 predicate places. [2023-08-31 01:36:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 277 transitions, 4044 flow [2023-08-31 01:36:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 93.47058823529412) internal successors, (1589), 17 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states 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 01:36:40,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:40,449 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:40,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-31 01:36:40,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:40,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:40,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash -834738333, now seen corresponding path program 3 times [2023-08-31 01:36:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:40,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104657608] [2023-08-31 01:36:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:40,847 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 01:36:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:40,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104657608] [2023-08-31 01:36:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104657608] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:40,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439501773] [2023-08-31 01:36:40,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:36:40,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:40,849 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 01:36:40,851 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 01:36:40,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 01:36:40,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:36:40,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-31 01:36:40,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:41,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:36:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439501773] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:41,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:41,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 13 [2023-08-31 01:36:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840364465] [2023-08-31 01:36:41,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:41,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 01:36:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 01:36:41,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-08-31 01:36:43,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:36:43,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2023-08-31 01:36:43,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 277 transitions, 4044 flow. Second operand has 15 states, 15 states have (on average 95.53333333333333) internal successors, (1433), 15 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states 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 01:36:43,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:43,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2023-08-31 01:36:43,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:46,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:36:48,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:36:49,657 INFO L130 PetriNetUnfolder]: 2896/4900 cut-off events. [2023-08-31 01:36:49,658 INFO L131 PetriNetUnfolder]: For 54216/54216 co-relation queries the response was YES. [2023-08-31 01:36:49,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32679 conditions, 4900 events. 2896/4900 cut-off events. For 54216/54216 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30934 event pairs, 210 based on Foata normal form. 27/4927 useless extension candidates. Maximal degree in co-relation 32097. Up to 3748 conditions per place. [2023-08-31 01:36:49,692 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 344 selfloop transitions, 135 changer transitions 18/497 dead transitions. [2023-08-31 01:36:49,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 497 transitions, 7814 flow [2023-08-31 01:36:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-31 01:36:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-31 01:36:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2126 transitions. [2023-08-31 01:36:49,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45195578231292516 [2023-08-31 01:36:49,697 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2126 transitions. [2023-08-31 01:36:49,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2126 transitions. [2023-08-31 01:36:49,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:49,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2126 transitions. [2023-08-31 01:36:49,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 101.23809523809524) internal successors, (2126), 21 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states 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 01:36:49,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 224.0) internal successors, (4928), 22 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states 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 01:36:49,707 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 224.0) internal successors, (4928), 22 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states 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 01:36:49,707 INFO L175 Difference]: Start difference. First operand has 109 places, 277 transitions, 4044 flow. Second operand 21 states and 2126 transitions. [2023-08-31 01:36:49,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 497 transitions, 7814 flow [2023-08-31 01:36:49,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 497 transitions, 7220 flow, removed 287 selfloop flow, removed 7 redundant places. [2023-08-31 01:36:49,814 INFO L231 Difference]: Finished difference. Result has 132 places, 369 transitions, 5951 flow [2023-08-31 01:36:49,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=3521, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5951, PETRI_PLACES=132, PETRI_TRANSITIONS=369} [2023-08-31 01:36:49,815 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 113 predicate places. [2023-08-31 01:36:49,815 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 369 transitions, 5951 flow [2023-08-31 01:36:49,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 95.53333333333333) internal successors, (1433), 15 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states 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 01:36:49,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:49,816 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:49,823 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 01:36:50,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:50,022 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:50,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash -922612837, now seen corresponding path program 4 times [2023-08-31 01:36:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:50,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141100161] [2023-08-31 01:36:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:50,130 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 01:36:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141100161] [2023-08-31 01:36:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141100161] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141623292] [2023-08-31 01:36:50,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:36:50,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:50,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:50,132 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 01:36:50,134 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 01:36:50,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:36:50,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:36:50,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:36:50,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:50,225 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 01:36:50,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:50,261 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 01:36:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141623292] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:50,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2023-08-31 01:36:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387164722] [2023-08-31 01:36:50,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 01:36:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:50,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 01:36:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 01:36:50,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:36:50,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 369 transitions, 5951 flow. Second operand has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states 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 01:36:50,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:50,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:36:50,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:36:51,250 INFO L130 PetriNetUnfolder]: 3271/5800 cut-off events. [2023-08-31 01:36:51,251 INFO L131 PetriNetUnfolder]: For 71785/71785 co-relation queries the response was YES. [2023-08-31 01:36:51,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39823 conditions, 5800 events. 3271/5800 cut-off events. For 71785/71785 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 40295 event pairs, 296 based on Foata normal form. 40/5840 useless extension candidates. Maximal degree in co-relation 37952. Up to 2273 conditions per place. [2023-08-31 01:36:51,296 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 339 selfloop transitions, 316 changer transitions 6/661 dead transitions. [2023-08-31 01:36:51,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 661 transitions, 11513 flow [2023-08-31 01:36:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-31 01:36:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-31 01:36:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1437 transitions. [2023-08-31 01:36:51,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45822704081632654 [2023-08-31 01:36:51,298 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1437 transitions. [2023-08-31 01:36:51,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1437 transitions. [2023-08-31 01:36:51,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:36:51,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1437 transitions. [2023-08-31 01:36:51,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 102.64285714285714) internal successors, (1437), 14 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states 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 01:36:51,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 224.0) internal successors, (3360), 15 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states 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 01:36:51,303 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 224.0) internal successors, (3360), 15 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states 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 01:36:51,303 INFO L175 Difference]: Start difference. First operand has 132 places, 369 transitions, 5951 flow. Second operand 14 states and 1437 transitions. [2023-08-31 01:36:51,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 661 transitions, 11513 flow [2023-08-31 01:36:51,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 661 transitions, 10434 flow, removed 527 selfloop flow, removed 7 redundant places. [2023-08-31 01:36:51,503 INFO L231 Difference]: Finished difference. Result has 146 places, 467 transitions, 8053 flow [2023-08-31 01:36:51,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=5174, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8053, PETRI_PLACES=146, PETRI_TRANSITIONS=467} [2023-08-31 01:36:51,504 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 127 predicate places. [2023-08-31 01:36:51,504 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 467 transitions, 8053 flow [2023-08-31 01:36:51,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states 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 01:36:51,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:36:51,505 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:36:51,510 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 01:36:51,709 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,SelfDestructingSolverStorable10 [2023-08-31 01:36:51,710 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:36:51,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:36:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1944370241, now seen corresponding path program 5 times [2023-08-31 01:36:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:36:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102527885] [2023-08-31 01:36:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:36:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:36:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:36:51,977 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 01:36:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:36:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102527885] [2023-08-31 01:36:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102527885] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:36:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098137711] [2023-08-31 01:36:51,978 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 01:36:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:36:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:36:51,979 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 01:36:51,981 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 01:36:52,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-31 01:36:52,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:36:52,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 01:36:52,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:36:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:36:52,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:36:52,737 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 01:36:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098137711] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:36:52,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:36:52,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-31 01:36:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476650983] [2023-08-31 01:36:52,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:36:52,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 01:36:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:36:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 01:36:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-08-31 01:36:54,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:36:57,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:36:57,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 224 [2023-08-31 01:36:57,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 467 transitions, 8053 flow. Second operand has 18 states, 18 states have (on average 94.38888888888889) internal successors, (1699), 18 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states 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 01:36:57,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:36:57,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 224 [2023-08-31 01:36:57,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:03,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:37:05,674 INFO L130 PetriNetUnfolder]: 4345/7642 cut-off events. [2023-08-31 01:37:05,675 INFO L131 PetriNetUnfolder]: For 112133/112133 co-relation queries the response was YES. [2023-08-31 01:37:05,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57273 conditions, 7642 events. 4345/7642 cut-off events. For 112133/112133 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 55220 event pairs, 238 based on Foata normal form. 19/7661 useless extension candidates. Maximal degree in co-relation 54841. Up to 3059 conditions per place. [2023-08-31 01:37:05,746 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 353 selfloop transitions, 565 changer transitions 21/939 dead transitions. [2023-08-31 01:37:05,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 939 transitions, 17802 flow [2023-08-31 01:37:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-31 01:37:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-31 01:37:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3366 transitions. [2023-08-31 01:37:05,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4419642857142857 [2023-08-31 01:37:05,750 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3366 transitions. [2023-08-31 01:37:05,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3366 transitions. [2023-08-31 01:37:05,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:05,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3366 transitions. [2023-08-31 01:37:05,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 99.0) internal successors, (3366), 34 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states 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 01:37:05,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 224.0) internal successors, (7840), 35 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states 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 01:37:05,762 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 224.0) internal successors, (7840), 35 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states 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 01:37:05,762 INFO L175 Difference]: Start difference. First operand has 146 places, 467 transitions, 8053 flow. Second operand 34 states and 3366 transitions. [2023-08-31 01:37:05,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 939 transitions, 17802 flow [2023-08-31 01:37:06,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 939 transitions, 16869 flow, removed 454 selfloop flow, removed 3 redundant places. [2023-08-31 01:37:06,222 INFO L231 Difference]: Finished difference. Result has 188 places, 753 transitions, 15432 flow [2023-08-31 01:37:06,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=7632, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=15432, PETRI_PLACES=188, PETRI_TRANSITIONS=753} [2023-08-31 01:37:06,223 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 169 predicate places. [2023-08-31 01:37:06,224 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 753 transitions, 15432 flow [2023-08-31 01:37:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 94.38888888888889) internal successors, (1699), 18 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states 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 01:37:06,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:06,224 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:06,229 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 01:37:06,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:06,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:06,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -620121257, now seen corresponding path program 6 times [2023-08-31 01:37:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19153638] [2023-08-31 01:37:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19153638] [2023-08-31 01:37:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19153638] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349585381] [2023-08-31 01:37:06,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 01:37:06,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:06,519 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 01:37:06,524 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 01:37:06,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-31 01:37:06,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:37:06,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:37:06,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:06,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:06,657 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 01:37:06,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349585381] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:06,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-31 01:37:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119599512] [2023-08-31 01:37:06,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:06,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 01:37:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:06,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 01:37:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 01:37:06,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:37:06,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 753 transitions, 15432 flow. Second operand has 10 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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 01:37:06,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:06,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:37:06,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:08,849 INFO L130 PetriNetUnfolder]: 5225/9187 cut-off events. [2023-08-31 01:37:08,849 INFO L131 PetriNetUnfolder]: For 149556/149556 co-relation queries the response was YES. [2023-08-31 01:37:08,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72583 conditions, 9187 events. 5225/9187 cut-off events. For 149556/149556 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 68369 event pairs, 424 based on Foata normal form. 174/9361 useless extension candidates. Maximal degree in co-relation 70289. Up to 3335 conditions per place. [2023-08-31 01:37:08,932 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 574 selfloop transitions, 625 changer transitions 0/1199 dead transitions. [2023-08-31 01:37:08,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1199 transitions, 25589 flow [2023-08-31 01:37:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-31 01:37:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-31 01:37:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1440 transitions. [2023-08-31 01:37:08,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2023-08-31 01:37:08,934 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1440 transitions. [2023-08-31 01:37:08,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1440 transitions. [2023-08-31 01:37:08,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:08,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1440 transitions. [2023-08-31 01:37:08,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 102.85714285714286) internal successors, (1440), 14 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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 01:37:08,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 224.0) internal successors, (3360), 15 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states 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 01:37:08,938 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 224.0) internal successors, (3360), 15 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states 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 01:37:08,939 INFO L175 Difference]: Start difference. First operand has 188 places, 753 transitions, 15432 flow. Second operand 14 states and 1440 transitions. [2023-08-31 01:37:08,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1199 transitions, 25589 flow [2023-08-31 01:37:09,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1199 transitions, 22613 flow, removed 1469 selfloop flow, removed 7 redundant places. [2023-08-31 01:37:09,928 INFO L231 Difference]: Finished difference. Result has 202 places, 948 transitions, 19816 flow [2023-08-31 01:37:09,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=13331, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=19816, PETRI_PLACES=202, PETRI_TRANSITIONS=948} [2023-08-31 01:37:09,929 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 183 predicate places. [2023-08-31 01:37:09,929 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 948 transitions, 19816 flow [2023-08-31 01:37:09,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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 01:37:09,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:09,930 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:09,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-31 01:37:10,134 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,SelfDestructingSolverStorable12 [2023-08-31 01:37:10,135 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:10,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1394518185, now seen corresponding path program 7 times [2023-08-31 01:37:10,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:10,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146970198] [2023-08-31 01:37:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146970198] [2023-08-31 01:37:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146970198] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157500303] [2023-08-31 01:37:10,241 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 01:37:10,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:10,249 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 01:37:10,250 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 01:37:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:37:10,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:10,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:37:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157500303] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:10,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2023-08-31 01:37:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322755771] [2023-08-31 01:37:10,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:10,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 01:37:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 01:37:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 01:37:10,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:37:10,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 948 transitions, 19816 flow. Second operand has 9 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 01:37:10,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:10,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:37:10,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:12,981 INFO L130 PetriNetUnfolder]: 5565/9746 cut-off events. [2023-08-31 01:37:12,982 INFO L131 PetriNetUnfolder]: For 182839/182839 co-relation queries the response was YES. [2023-08-31 01:37:13,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81471 conditions, 9746 events. 5565/9746 cut-off events. For 182839/182839 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 73520 event pairs, 108 based on Foata normal form. 100/9846 useless extension candidates. Maximal degree in co-relation 79428. Up to 3519 conditions per place. [2023-08-31 01:37:13,152 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 977 selfloop transitions, 485 changer transitions 0/1462 dead transitions. [2023-08-31 01:37:13,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1462 transitions, 29781 flow [2023-08-31 01:37:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 01:37:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 01:37:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1536 transitions. [2023-08-31 01:37:13,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2023-08-31 01:37:13,157 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1536 transitions. [2023-08-31 01:37:13,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1536 transitions. [2023-08-31 01:37:13,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:13,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1536 transitions. [2023-08-31 01:37:13,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 102.4) internal successors, (1536), 15 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states 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 01:37:13,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 224.0) internal successors, (3584), 16 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states 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 01:37:13,162 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 224.0) internal successors, (3584), 16 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states 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 01:37:13,162 INFO L175 Difference]: Start difference. First operand has 202 places, 948 transitions, 19816 flow. Second operand 15 states and 1536 transitions. [2023-08-31 01:37:13,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1462 transitions, 29781 flow [2023-08-31 01:37:14,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1462 transitions, 29286 flow, removed 197 selfloop flow, removed 4 redundant places. [2023-08-31 01:37:14,489 INFO L231 Difference]: Finished difference. Result has 216 places, 1043 transitions, 22932 flow [2023-08-31 01:37:14,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=19031, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=22932, PETRI_PLACES=216, PETRI_TRANSITIONS=1043} [2023-08-31 01:37:14,490 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 197 predicate places. [2023-08-31 01:37:14,490 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 1043 transitions, 22932 flow [2023-08-31 01:37:14,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 01:37:14,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:14,491 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:14,495 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 01:37:14,694 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,SelfDestructingSolverStorable13 [2023-08-31 01:37:14,694 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:14,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash -231131307, now seen corresponding path program 8 times [2023-08-31 01:37:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:14,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080241280] [2023-08-31 01:37:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080241280] [2023-08-31 01:37:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080241280] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85679020] [2023-08-31 01:37:14,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:37:14,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:14,964 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 01:37:14,966 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 01:37:15,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:37:15,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:37:15,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 01:37:15,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:15,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:37:15,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85679020] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:15,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:15,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-31 01:37:15,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268246890] [2023-08-31 01:37:15,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:15,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 01:37:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:15,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 01:37:15,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-08-31 01:37:16,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 224 [2023-08-31 01:37:16,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1043 transitions, 22932 flow. Second operand has 18 states, 18 states have (on average 96.38888888888889) internal successors, (1735), 18 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states 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 01:37:16,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:16,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 224 [2023-08-31 01:37:16,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:18,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:37:31,541 INFO L130 PetriNetUnfolder]: 8085/14149 cut-off events. [2023-08-31 01:37:31,541 INFO L131 PetriNetUnfolder]: For 327784/327784 co-relation queries the response was YES. [2023-08-31 01:37:31,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129401 conditions, 14149 events. 8085/14149 cut-off events. For 327784/327784 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 112079 event pairs, 521 based on Foata normal form. 40/14189 useless extension candidates. Maximal degree in co-relation 126433. Up to 5344 conditions per place. [2023-08-31 01:37:31,668 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 704 selfloop transitions, 1181 changer transitions 35/1920 dead transitions. [2023-08-31 01:37:31,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 1920 transitions, 47385 flow [2023-08-31 01:37:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-31 01:37:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-31 01:37:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4041 transitions. [2023-08-31 01:37:31,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4510044642857143 [2023-08-31 01:37:31,673 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 4041 transitions. [2023-08-31 01:37:31,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 4041 transitions. [2023-08-31 01:37:31,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:31,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 4041 transitions. [2023-08-31 01:37:31,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 101.025) internal successors, (4041), 40 states have internal predecessors, (4041), 0 states have call successors, (0), 0 states 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 01:37:31,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 224.0) internal successors, (9184), 41 states have internal predecessors, (9184), 0 states have call successors, (0), 0 states 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 01:37:31,683 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 224.0) internal successors, (9184), 41 states have internal predecessors, (9184), 0 states have call successors, (0), 0 states 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 01:37:31,683 INFO L175 Difference]: Start difference. First operand has 216 places, 1043 transitions, 22932 flow. Second operand 40 states and 4041 transitions. [2023-08-31 01:37:31,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 1920 transitions, 47385 flow [2023-08-31 01:37:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1920 transitions, 46130 flow, removed 623 selfloop flow, removed 1 redundant places. [2023-08-31 01:37:34,491 INFO L231 Difference]: Finished difference. Result has 267 places, 1639 transitions, 43226 flow [2023-08-31 01:37:34,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=22561, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=664, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=43226, PETRI_PLACES=267, PETRI_TRANSITIONS=1639} [2023-08-31 01:37:34,492 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 248 predicate places. [2023-08-31 01:37:34,493 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 1639 transitions, 43226 flow [2023-08-31 01:37:34,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 96.38888888888889) internal successors, (1735), 18 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states 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 01:37:34,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:34,493 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:34,497 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 01:37:34,695 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,SelfDestructingSolverStorable14 [2023-08-31 01:37:34,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:34,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1040135160, now seen corresponding path program 9 times [2023-08-31 01:37:34,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:34,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935983725] [2023-08-31 01:37:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:37:34,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:34,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935983725] [2023-08-31 01:37:34,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935983725] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:34,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455174626] [2023-08-31 01:37:34,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:37:34,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:34,767 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 01:37:34,769 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 01:37:34,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 01:37:34,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:37:34,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:37:34,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:37:34,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:37:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455174626] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:34,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-31 01:37:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367624821] [2023-08-31 01:37:34,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:34,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 01:37:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 01:37:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 01:37:35,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:37:35,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 1639 transitions, 43226 flow. Second operand has 10 states, 10 states have (on average 99.4) internal successors, (994), 10 states have internal predecessors, (994), 0 states have call successors, (0), 0 states 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 01:37:35,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:35,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:37:35,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:41,297 INFO L130 PetriNetUnfolder]: 8546/14882 cut-off events. [2023-08-31 01:37:41,297 INFO L131 PetriNetUnfolder]: For 399517/399517 co-relation queries the response was YES. [2023-08-31 01:37:41,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145168 conditions, 14882 events. 8546/14882 cut-off events. For 399517/399517 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 117489 event pairs, 812 based on Foata normal form. 634/15516 useless extension candidates. Maximal degree in co-relation 142417. Up to 12495 conditions per place. [2023-08-31 01:37:41,480 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1645 selfloop transitions, 303 changer transitions 0/1948 dead transitions. [2023-08-31 01:37:41,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1948 transitions, 53439 flow [2023-08-31 01:37:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 01:37:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 01:37:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1350 transitions. [2023-08-31 01:37:41,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635989010989011 [2023-08-31 01:37:41,483 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1350 transitions. [2023-08-31 01:37:41,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1350 transitions. [2023-08-31 01:37:41,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:41,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1350 transitions. [2023-08-31 01:37:41,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.84615384615384) internal successors, (1350), 13 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states 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 01:37:41,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 224.0) internal successors, (3136), 14 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 01:37:41,487 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 224.0) internal successors, (3136), 14 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 01:37:41,487 INFO L175 Difference]: Start difference. First operand has 267 places, 1639 transitions, 43226 flow. Second operand 13 states and 1350 transitions. [2023-08-31 01:37:41,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1948 transitions, 53439 flow [2023-08-31 01:37:45,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1948 transitions, 48517 flow, removed 2455 selfloop flow, removed 2 redundant places. [2023-08-31 01:37:45,848 INFO L231 Difference]: Finished difference. Result has 284 places, 1795 transitions, 43567 flow [2023-08-31 01:37:45,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=37433, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=43567, PETRI_PLACES=284, PETRI_TRANSITIONS=1795} [2023-08-31 01:37:45,850 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 265 predicate places. [2023-08-31 01:37:45,850 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 1795 transitions, 43567 flow [2023-08-31 01:37:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 99.4) internal successors, (994), 10 states have internal predecessors, (994), 0 states have call successors, (0), 0 states 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 01:37:45,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:45,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:45,855 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 01:37:46,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-31 01:37:46,053 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:46,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:46,053 INFO L85 PathProgramCache]: Analyzing trace with hash 711602978, now seen corresponding path program 10 times [2023-08-31 01:37:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:46,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861759759] [2023-08-31 01:37:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:37:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861759759] [2023-08-31 01:37:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861759759] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801424487] [2023-08-31 01:37:46,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:37:46,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:46,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:46,098 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 01:37:46,126 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 01:37:46,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:37:46,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:37:46,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 01:37:46,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:37:46,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:37:46,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801424487] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:46,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:46,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-31 01:37:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396176851] [2023-08-31 01:37:46,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:46,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 01:37:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 01:37:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-31 01:37:46,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 224 [2023-08-31 01:37:46,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 1795 transitions, 43567 flow. Second operand has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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 01:37:46,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:46,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 224 [2023-08-31 01:37:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:50,480 INFO L130 PetriNetUnfolder]: 5505/9656 cut-off events. [2023-08-31 01:37:50,481 INFO L131 PetriNetUnfolder]: For 267514/267514 co-relation queries the response was YES. [2023-08-31 01:37:50,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88907 conditions, 9656 events. 5505/9656 cut-off events. For 267514/267514 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 72100 event pairs, 398 based on Foata normal form. 584/10240 useless extension candidates. Maximal degree in co-relation 88506. Up to 5680 conditions per place. [2023-08-31 01:37:50,590 INFO L137 encePairwiseOnDemand]: 221/224 looper letters, 1038 selfloop transitions, 307 changer transitions 2/1347 dead transitions. [2023-08-31 01:37:50,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1347 transitions, 34557 flow [2023-08-31 01:37:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:37:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:37:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-31 01:37:50,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830357142857143 [2023-08-31 01:37:50,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-31 01:37:50,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-31 01:37:50,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:50,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-31 01:37:50,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 01:37:50,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:37:50,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 01:37:50,594 INFO L175 Difference]: Start difference. First operand has 284 places, 1795 transitions, 43567 flow. Second operand 5 states and 541 transitions. [2023-08-31 01:37:50,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1347 transitions, 34557 flow [2023-08-31 01:37:52,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1347 transitions, 32071 flow, removed 597 selfloop flow, removed 15 redundant places. [2023-08-31 01:37:52,740 INFO L231 Difference]: Finished difference. Result has 274 places, 1205 transitions, 27593 flow [2023-08-31 01:37:52,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=24970, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=27593, PETRI_PLACES=274, PETRI_TRANSITIONS=1205} [2023-08-31 01:37:52,741 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 255 predicate places. [2023-08-31 01:37:52,741 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 1205 transitions, 27593 flow [2023-08-31 01:37:52,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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 01:37:52,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:52,742 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:52,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-31 01:37:52,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:52,945 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:52,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 793995680, now seen corresponding path program 11 times [2023-08-31 01:37:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013660055] [2023-08-31 01:37:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:37:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013660055] [2023-08-31 01:37:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013660055] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211007236] [2023-08-31 01:37:52,998 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 01:37:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:52,999 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 01:37:53,001 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 01:37:53,052 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-08-31 01:37:53,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:37:53,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:37:53,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:37:53,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 01:37:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211007236] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:53,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2023-08-31 01:37:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337213924] [2023-08-31 01:37:53,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:53,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 01:37:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 01:37:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 01:37:53,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:37:53,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1205 transitions, 27593 flow. Second operand has 9 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 01:37:53,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:53,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:37:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:37:56,365 INFO L130 PetriNetUnfolder]: 5625/9975 cut-off events. [2023-08-31 01:37:56,365 INFO L131 PetriNetUnfolder]: For 253459/253459 co-relation queries the response was YES. [2023-08-31 01:37:56,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91125 conditions, 9975 events. 5625/9975 cut-off events. For 253459/253459 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 75727 event pairs, 264 based on Foata normal form. 14/9989 useless extension candidates. Maximal degree in co-relation 90781. Up to 6586 conditions per place. [2023-08-31 01:37:56,464 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1185 selfloop transitions, 156 changer transitions 21/1362 dead transitions. [2023-08-31 01:37:56,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 1362 transitions, 32905 flow [2023-08-31 01:37:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 01:37:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 01:37:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1531 transitions. [2023-08-31 01:37:56,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556547619047619 [2023-08-31 01:37:56,467 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1531 transitions. [2023-08-31 01:37:56,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1531 transitions. [2023-08-31 01:37:56,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:37:56,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1531 transitions. [2023-08-31 01:37:56,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 102.06666666666666) internal successors, (1531), 15 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states 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 01:37:56,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 224.0) internal successors, (3584), 16 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states 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 01:37:56,471 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 224.0) internal successors, (3584), 16 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states 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 01:37:56,471 INFO L175 Difference]: Start difference. First operand has 274 places, 1205 transitions, 27593 flow. Second operand 15 states and 1531 transitions. [2023-08-31 01:37:56,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 1362 transitions, 32905 flow [2023-08-31 01:37:58,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1362 transitions, 32626 flow, removed 136 selfloop flow, removed 2 redundant places. [2023-08-31 01:37:58,598 INFO L231 Difference]: Finished difference. Result has 290 places, 1253 transitions, 28753 flow [2023-08-31 01:37:58,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=26863, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=28753, PETRI_PLACES=290, PETRI_TRANSITIONS=1253} [2023-08-31 01:37:58,599 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 271 predicate places. [2023-08-31 01:37:58,599 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 1253 transitions, 28753 flow [2023-08-31 01:37:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 01:37:58,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:37:58,600 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:37:58,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-31 01:37:58,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-31 01:37:58,804 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:37:58,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:37:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -965795692, now seen corresponding path program 12 times [2023-08-31 01:37:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:37:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114997555] [2023-08-31 01:37:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:37:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:37:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:37:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:37:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:37:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114997555] [2023-08-31 01:37:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114997555] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:37:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267994857] [2023-08-31 01:37:58,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 01:37:58,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:37:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:37:58,873 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:37:58,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-31 01:37:58,947 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-31 01:37:58,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:37:58,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:37:58,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:37:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:37:58,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:37:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:37:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267994857] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:37:59,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:37:59,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-31 01:37:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215916065] [2023-08-31 01:37:59,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:37:59,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 01:37:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:37:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 01:37:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 01:37:59,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:37:59,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 1253 transitions, 28753 flow. Second operand has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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 01:37:59,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:37:59,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:37:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:03,495 INFO L130 PetriNetUnfolder]: 6518/11755 cut-off events. [2023-08-31 01:38:03,495 INFO L131 PetriNetUnfolder]: For 341991/341991 co-relation queries the response was YES. [2023-08-31 01:38:03,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109218 conditions, 11755 events. 6518/11755 cut-off events. For 341991/341991 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 92896 event pairs, 296 based on Foata normal form. 216/11971 useless extension candidates. Maximal degree in co-relation 108152. Up to 4637 conditions per place. [2023-08-31 01:38:03,605 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1120 selfloop transitions, 471 changer transitions 109/1700 dead transitions. [2023-08-31 01:38:03,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1700 transitions, 40066 flow [2023-08-31 01:38:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 01:38:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 01:38:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1233 transitions. [2023-08-31 01:38:03,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45870535714285715 [2023-08-31 01:38:03,608 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1233 transitions. [2023-08-31 01:38:03,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1233 transitions. [2023-08-31 01:38:03,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:38:03,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1233 transitions. [2023-08-31 01:38:03,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 102.75) internal successors, (1233), 12 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states 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 01:38:03,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 224.0) internal successors, (2912), 13 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states 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 01:38:03,612 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 224.0) internal successors, (2912), 13 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states 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 01:38:03,612 INFO L175 Difference]: Start difference. First operand has 290 places, 1253 transitions, 28753 flow. Second operand 12 states and 1233 transitions. [2023-08-31 01:38:03,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1700 transitions, 40066 flow [2023-08-31 01:38:06,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 1700 transitions, 39465 flow, removed 294 selfloop flow, removed 2 redundant places. [2023-08-31 01:38:06,368 INFO L231 Difference]: Finished difference. Result has 305 places, 1307 transitions, 31444 flow [2023-08-31 01:38:06,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=26529, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=31444, PETRI_PLACES=305, PETRI_TRANSITIONS=1307} [2023-08-31 01:38:06,369 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 286 predicate places. [2023-08-31 01:38:06,369 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 1307 transitions, 31444 flow [2023-08-31 01:38:06,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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 01:38:06,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:38:06,369 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:38:06,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-31 01:38:06,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:06,573 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:38:06,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:38:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash 92124486, now seen corresponding path program 13 times [2023-08-31 01:38:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:38:06,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402997536] [2023-08-31 01:38:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:38:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:38:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:38:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402997536] [2023-08-31 01:38:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402997536] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:38:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413875027] [2023-08-31 01:38:06,626 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 01:38:06,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:06,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:38:06,627 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:38:06,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-31 01:38:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:06,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 01:38:06,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:38:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:06,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:38:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413875027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:38:06,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:38:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2023-08-31 01:38:06,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930713010] [2023-08-31 01:38:06,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:38:06,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 01:38:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:38:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 01:38:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 01:38:06,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:38:06,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1307 transitions, 31444 flow. Second operand has 9 states, 9 states have (on average 99.44444444444444) internal successors, (895), 9 states have internal predecessors, (895), 0 states have call successors, (0), 0 states 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 01:38:06,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:38:06,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:38:06,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:11,344 INFO L130 PetriNetUnfolder]: 6223/11170 cut-off events. [2023-08-31 01:38:11,344 INFO L131 PetriNetUnfolder]: For 386329/386329 co-relation queries the response was YES. [2023-08-31 01:38:11,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109534 conditions, 11170 events. 6223/11170 cut-off events. For 386329/386329 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 86388 event pairs, 482 based on Foata normal form. 362/11532 useless extension candidates. Maximal degree in co-relation 108281. Up to 6465 conditions per place. [2023-08-31 01:38:11,487 INFO L137 encePairwiseOnDemand]: 219/224 looper letters, 1009 selfloop transitions, 545 changer transitions 2/1556 dead transitions. [2023-08-31 01:38:11,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1556 transitions, 39380 flow [2023-08-31 01:38:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 01:38:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 01:38:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1140 transitions. [2023-08-31 01:38:11,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46266233766233766 [2023-08-31 01:38:11,490 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1140 transitions. [2023-08-31 01:38:11,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1140 transitions. [2023-08-31 01:38:11,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:38:11,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1140 transitions. [2023-08-31 01:38:11,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 103.63636363636364) internal successors, (1140), 11 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states 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 01:38:11,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 224.0) internal successors, (2688), 12 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states 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 01:38:11,493 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 224.0) internal successors, (2688), 12 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states 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 01:38:11,493 INFO L175 Difference]: Start difference. First operand has 305 places, 1307 transitions, 31444 flow. Second operand 11 states and 1140 transitions. [2023-08-31 01:38:11,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1556 transitions, 39380 flow [2023-08-31 01:38:15,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1556 transitions, 37366 flow, removed 979 selfloop flow, removed 5 redundant places. [2023-08-31 01:38:15,060 INFO L231 Difference]: Finished difference. Result has 314 places, 1366 transitions, 33134 flow [2023-08-31 01:38:15,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=29438, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=478, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=33134, PETRI_PLACES=314, PETRI_TRANSITIONS=1366} [2023-08-31 01:38:15,062 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 295 predicate places. [2023-08-31 01:38:15,062 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 1366 transitions, 33134 flow [2023-08-31 01:38:15,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.44444444444444) internal successors, (895), 9 states have internal predecessors, (895), 0 states have call successors, (0), 0 states 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 01:38:15,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:38:15,062 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:38:15,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-31 01:38:15,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:15,266 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:38:15,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:38:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -675962772, now seen corresponding path program 14 times [2023-08-31 01:38:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:38:15,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259246719] [2023-08-31 01:38:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:38:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:38:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:38:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259246719] [2023-08-31 01:38:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259246719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:38:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:38:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 01:38:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311231592] [2023-08-31 01:38:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:38:15,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 01:38:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:38:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 01:38:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 01:38:15,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 224 [2023-08-31 01:38:15,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 1366 transitions, 33134 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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 01:38:15,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:38:15,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 224 [2023-08-31 01:38:15,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:18,954 INFO L130 PetriNetUnfolder]: 4972/9271 cut-off events. [2023-08-31 01:38:18,954 INFO L131 PetriNetUnfolder]: For 297686/297686 co-relation queries the response was YES. [2023-08-31 01:38:19,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90507 conditions, 9271 events. 4972/9271 cut-off events. For 297686/297686 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 71895 event pairs, 1291 based on Foata normal form. 402/9673 useless extension candidates. Maximal degree in co-relation 88694. Up to 5250 conditions per place. [2023-08-31 01:38:19,045 INFO L137 encePairwiseOnDemand]: 221/224 looper letters, 890 selfloop transitions, 236 changer transitions 223/1349 dead transitions. [2023-08-31 01:38:19,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1349 transitions, 36311 flow [2023-08-31 01:38:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 01:38:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 01:38:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-08-31 01:38:19,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48325892857142855 [2023-08-31 01:38:19,047 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-08-31 01:38:19,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-08-31 01:38:19,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:38:19,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-08-31 01:38:19,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 01:38:19,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 01:38:19,049 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 01:38:19,050 INFO L175 Difference]: Start difference. First operand has 314 places, 1366 transitions, 33134 flow. Second operand 4 states and 433 transitions. [2023-08-31 01:38:19,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1349 transitions, 36311 flow [2023-08-31 01:38:21,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1349 transitions, 35377 flow, removed 405 selfloop flow, removed 6 redundant places. [2023-08-31 01:38:21,420 INFO L231 Difference]: Finished difference. Result has 310 places, 1038 transitions, 25181 flow [2023-08-31 01:38:21,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=28423, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=25181, PETRI_PLACES=310, PETRI_TRANSITIONS=1038} [2023-08-31 01:38:21,421 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 291 predicate places. [2023-08-31 01:38:21,421 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 1038 transitions, 25181 flow [2023-08-31 01:38:21,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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 01:38:21,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:38:21,421 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:38:21,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 01:38:21,422 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:38:21,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:38:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -84218570, now seen corresponding path program 4 times [2023-08-31 01:38:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:38:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836966319] [2023-08-31 01:38:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:38:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:38:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:21,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:38:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836966319] [2023-08-31 01:38:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836966319] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:38:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918312866] [2023-08-31 01:38:21,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:38:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:38:21,490 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:38:21,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-31 01:38:21,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:38:21,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:38:21,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 01:38:21,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:38:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:21,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:38:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:21,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918312866] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:38:21,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:38:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2023-08-31 01:38:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374594779] [2023-08-31 01:38:21,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:38:21,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 01:38:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:38:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 01:38:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-08-31 01:38:21,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:38:21,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1038 transitions, 25181 flow. Second operand has 12 states, 12 states have (on average 98.66666666666667) internal successors, (1184), 12 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states 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 01:38:21,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:38:21,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:38:21,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:25,418 INFO L130 PetriNetUnfolder]: 5603/10358 cut-off events. [2023-08-31 01:38:25,419 INFO L131 PetriNetUnfolder]: For 362971/362971 co-relation queries the response was YES. [2023-08-31 01:38:25,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104397 conditions, 10358 events. 5603/10358 cut-off events. For 362971/362971 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 79190 event pairs, 568 based on Foata normal form. 132/10490 useless extension candidates. Maximal degree in co-relation 102531. Up to 3245 conditions per place. [2023-08-31 01:38:25,540 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 759 selfloop transitions, 846 changer transitions 1/1606 dead transitions. [2023-08-31 01:38:25,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1606 transitions, 41735 flow [2023-08-31 01:38:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 01:38:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 01:38:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2369 transitions. [2023-08-31 01:38:25,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2023-08-31 01:38:25,543 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2369 transitions. [2023-08-31 01:38:25,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2369 transitions. [2023-08-31 01:38:25,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:38:25,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2369 transitions. [2023-08-31 01:38:25,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 103.0) internal successors, (2369), 23 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states 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 01:38:25,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 224.0) internal successors, (5376), 24 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states 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 01:38:25,549 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 224.0) internal successors, (5376), 24 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states 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 01:38:25,549 INFO L175 Difference]: Start difference. First operand has 310 places, 1038 transitions, 25181 flow. Second operand 23 states and 2369 transitions. [2023-08-31 01:38:25,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 1606 transitions, 41735 flow [2023-08-31 01:38:28,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1606 transitions, 40857 flow, removed 239 selfloop flow, removed 7 redundant places. [2023-08-31 01:38:28,113 INFO L231 Difference]: Finished difference. Result has 335 places, 1342 transitions, 36566 flow [2023-08-31 01:38:28,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=24575, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=578, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=36566, PETRI_PLACES=335, PETRI_TRANSITIONS=1342} [2023-08-31 01:38:28,114 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 316 predicate places. [2023-08-31 01:38:28,115 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 1342 transitions, 36566 flow [2023-08-31 01:38:28,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.66666666666667) internal successors, (1184), 12 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states 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 01:38:28,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:38:28,115 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:38:28,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-31 01:38:28,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:28,319 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:38:28,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:38:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash -862660922, now seen corresponding path program 5 times [2023-08-31 01:38:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:38:28,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56889004] [2023-08-31 01:38:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:38:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:38:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:38:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56889004] [2023-08-31 01:38:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56889004] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:38:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935770171] [2023-08-31 01:38:28,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 01:38:28,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:28,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:38:28,386 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:38:28,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-31 01:38:28,441 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-31 01:38:28,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:38:28,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 01:38:28,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:38:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:28,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:38:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935770171] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:38:28,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:38:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2023-08-31 01:38:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232718584] [2023-08-31 01:38:28,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:38:28,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 01:38:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:38:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 01:38:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-08-31 01:38:28,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-08-31 01:38:28,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 1342 transitions, 36566 flow. Second operand has 12 states, 12 states have (on average 98.83333333333333) internal successors, (1186), 12 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states 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 01:38:28,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:38:28,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-08-31 01:38:28,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:32,944 INFO L130 PetriNetUnfolder]: 5396/10050 cut-off events. [2023-08-31 01:38:32,945 INFO L131 PetriNetUnfolder]: For 402850/402850 co-relation queries the response was YES. [2023-08-31 01:38:33,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106272 conditions, 10050 events. 5396/10050 cut-off events. For 402850/402850 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 77672 event pairs, 124 based on Foata normal form. 112/10162 useless extension candidates. Maximal degree in co-relation 104362. Up to 2999 conditions per place. [2023-08-31 01:38:33,060 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1036 selfloop transitions, 672 changer transitions 32/1740 dead transitions. [2023-08-31 01:38:33,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 1740 transitions, 46794 flow [2023-08-31 01:38:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-31 01:38:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-31 01:38:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2554 transitions. [2023-08-31 01:38:33,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45607142857142857 [2023-08-31 01:38:33,063 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2554 transitions. [2023-08-31 01:38:33,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2554 transitions. [2023-08-31 01:38:33,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:38:33,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2554 transitions. [2023-08-31 01:38:33,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 102.16) internal successors, (2554), 25 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states 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 01:38:33,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 224.0) internal successors, (5824), 26 states have internal predecessors, (5824), 0 states have call successors, (0), 0 states 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 01:38:33,068 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 224.0) internal successors, (5824), 26 states have internal predecessors, (5824), 0 states have call successors, (0), 0 states 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 01:38:33,069 INFO L175 Difference]: Start difference. First operand has 335 places, 1342 transitions, 36566 flow. Second operand 25 states and 2554 transitions. [2023-08-31 01:38:33,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 1740 transitions, 46794 flow [2023-08-31 01:38:35,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1740 transitions, 45882 flow, removed 422 selfloop flow, removed 4 redundant places. [2023-08-31 01:38:35,827 INFO L231 Difference]: Finished difference. Result has 360 places, 1352 transitions, 38165 flow [2023-08-31 01:38:35,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=34938, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=643, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=38165, PETRI_PLACES=360, PETRI_TRANSITIONS=1352} [2023-08-31 01:38:35,828 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 341 predicate places. [2023-08-31 01:38:35,828 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 1352 transitions, 38165 flow [2023-08-31 01:38:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.83333333333333) internal successors, (1186), 12 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states 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 01:38:35,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:38:35,828 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:38:35,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-31 01:38:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:36,033 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:38:36,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:38:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 793791252, now seen corresponding path program 15 times [2023-08-31 01:38:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:38:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277558803] [2023-08-31 01:38:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:38:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:38:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:36,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:38:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277558803] [2023-08-31 01:38:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277558803] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:38:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904588762] [2023-08-31 01:38:36,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:38:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:36,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:38:36,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:38:36,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-31 01:38:36,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 01:38:36,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:38:36,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 01:38:36,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:38:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:36,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:38:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:38:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904588762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:38:36,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:38:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-08-31 01:38:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556386560] [2023-08-31 01:38:36,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:38:36,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 01:38:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:38:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 01:38:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-31 01:38:36,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 224 [2023-08-31 01:38:36,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1352 transitions, 38165 flow. Second operand has 11 states, 11 states have (on average 102.54545454545455) internal successors, (1128), 11 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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 01:38:36,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:38:36,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 224 [2023-08-31 01:38:36,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:42,565 INFO L130 PetriNetUnfolder]: 7432/13814 cut-off events. [2023-08-31 01:38:42,565 INFO L131 PetriNetUnfolder]: For 617867/617867 co-relation queries the response was YES. [2023-08-31 01:38:42,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151374 conditions, 13814 events. 7432/13814 cut-off events. For 617867/617867 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 112886 event pairs, 358 based on Foata normal form. 410/14224 useless extension candidates. Maximal degree in co-relation 149860. Up to 5245 conditions per place. [2023-08-31 01:38:42,727 INFO L137 encePairwiseOnDemand]: 221/224 looper letters, 1653 selfloop transitions, 432 changer transitions 27/2112 dead transitions. [2023-08-31 01:38:42,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 2112 transitions, 65038 flow [2023-08-31 01:38:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 01:38:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 01:38:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions. [2023-08-31 01:38:42,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846938775510204 [2023-08-31 01:38:42,729 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 760 transitions. [2023-08-31 01:38:42,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions. [2023-08-31 01:38:42,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:38:42,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions. [2023-08-31 01:38:42,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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 01:38:42,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states 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 01:38:42,731 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states 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 01:38:42,731 INFO L175 Difference]: Start difference. First operand has 360 places, 1352 transitions, 38165 flow. Second operand 7 states and 760 transitions. [2023-08-31 01:38:42,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 2112 transitions, 65038 flow [2023-08-31 01:38:48,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 2112 transitions, 61628 flow, removed 1515 selfloop flow, removed 9 redundant places. [2023-08-31 01:38:48,555 INFO L231 Difference]: Finished difference. Result has 355 places, 1400 transitions, 39442 flow [2023-08-31 01:38:48,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=33714, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=39442, PETRI_PLACES=355, PETRI_TRANSITIONS=1400} [2023-08-31 01:38:48,557 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 336 predicate places. [2023-08-31 01:38:48,557 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 1400 transitions, 39442 flow [2023-08-31 01:38:48,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.54545454545455) internal successors, (1128), 11 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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 01:38:48,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:38:48,558 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:38:48,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-31 01:38:48,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-31 01:38:48,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:38:48,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:38:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1144083644, now seen corresponding path program 16 times [2023-08-31 01:38:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:38:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936414851] [2023-08-31 01:38:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:38:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:38:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:38:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:38:49,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936414851] [2023-08-31 01:38:49,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936414851] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:38:49,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224668853] [2023-08-31 01:38:49,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:38:49,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:38:49,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:38:49,019 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:38:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-31 01:38:49,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:38:49,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:38:49,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 01:38:49,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:38:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:49,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:38:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:38:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224668853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:38:49,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:38:49,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 19 [2023-08-31 01:38:49,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975136617] [2023-08-31 01:38:49,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:38:49,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:38:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:38:49,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:38:49,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-08-31 01:38:50,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-31 01:38:50,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 1400 transitions, 39442 flow. Second operand has 21 states, 21 states have (on average 93.57142857142857) internal successors, (1965), 21 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states 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 01:38:50,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:38:50,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-31 01:38:50,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:38:54,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:38:57,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:39:02,958 INFO L130 PetriNetUnfolder]: 8111/15141 cut-off events. [2023-08-31 01:39:02,959 INFO L131 PetriNetUnfolder]: For 603480/603480 co-relation queries the response was YES. [2023-08-31 01:39:03,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163230 conditions, 15141 events. 8111/15141 cut-off events. For 603480/603480 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 126140 event pairs, 814 based on Foata normal form. 20/15161 useless extension candidates. Maximal degree in co-relation 161044. Up to 13958 conditions per place. [2023-08-31 01:39:03,142 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1514 selfloop transitions, 165 changer transitions 19/1698 dead transitions. [2023-08-31 01:39:03,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1698 transitions, 50688 flow [2023-08-31 01:39:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-31 01:39:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-31 01:39:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1769 transitions. [2023-08-31 01:39:03,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43874007936507936 [2023-08-31 01:39:03,145 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1769 transitions. [2023-08-31 01:39:03,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1769 transitions. [2023-08-31 01:39:03,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:39:03,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1769 transitions. [2023-08-31 01:39:03,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 98.27777777777777) internal successors, (1769), 18 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states 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 01:39:03,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 224.0) internal successors, (4256), 19 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states 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 01:39:03,166 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 224.0) internal successors, (4256), 19 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states 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 01:39:03,167 INFO L175 Difference]: Start difference. First operand has 355 places, 1400 transitions, 39442 flow. Second operand 18 states and 1769 transitions. [2023-08-31 01:39:03,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1698 transitions, 50688 flow [2023-08-31 01:39:08,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 1698 transitions, 49925 flow, removed 153 selfloop flow, removed 3 redundant places. [2023-08-31 01:39:08,162 INFO L231 Difference]: Finished difference. Result has 378 places, 1538 transitions, 43653 flow [2023-08-31 01:39:08,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=38797, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=43653, PETRI_PLACES=378, PETRI_TRANSITIONS=1538} [2023-08-31 01:39:08,164 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 359 predicate places. [2023-08-31 01:39:08,164 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 1538 transitions, 43653 flow [2023-08-31 01:39:08,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 93.57142857142857) internal successors, (1965), 21 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states 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 01:39:08,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:39:08,164 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:39:08,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-08-31 01:39:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-31 01:39:08,369 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:39:08,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:39:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2146555946, now seen corresponding path program 17 times [2023-08-31 01:39:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:39:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396737445] [2023-08-31 01:39:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:39:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:39:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:39:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:39:08,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:39:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396737445] [2023-08-31 01:39:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396737445] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:39:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365580565] [2023-08-31 01:39:08,629 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 01:39:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:39:08,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:39:08,645 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:39:08,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-31 01:39:08,965 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-31 01:39:08,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:39:08,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-31 01:39:08,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:39:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:39:09,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:39:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:39:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365580565] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:39:16,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:39:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2023-08-31 01:39:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068097745] [2023-08-31 01:39:16,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:39:16,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-31 01:39:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:39:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-31 01:39:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=419, Unknown=1, NotChecked=0, Total=506 [2023-08-31 01:39:18,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:39:20,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:39:22,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:39:24,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:39:25,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 224 [2023-08-31 01:39:25,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1538 transitions, 43653 flow. Second operand has 23 states, 23 states have (on average 89.34782608695652) internal successors, (2055), 23 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states 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 01:39:25,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:39:25,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 224 [2023-08-31 01:39:25,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:40:15,778 WARN L222 SmtUtils]: Spent 27.07s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:40:20,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:22,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:24,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:26,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:28,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:30,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:32,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:34,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:36,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:38,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:41,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:43,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:45,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:47,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:49,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:51,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:53,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:40:55,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:57,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:40:59,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:01,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:03,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:05,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:07,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:09,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:11,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:13,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:15,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:17,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:19,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:21,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:23,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:25,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:27,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:29,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:31,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:33,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:35,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:37,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:39,896 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse2 (+ c_~j1~0 1))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (let ((.cse0 (* 2 ~m~0))) (<= (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse0) 4294967296) 4294967296)) (+ c_~k2~0 .cse0 .cse1))) (< .cse2 ~m~0) (< ~m~0 1))) (or (let ((.cse5 (* c_~m~0 2))) (let ((.cse4 (+ c_~k2~0 .cse5 (* (div (+ c_~k1~0 1) 4294967296) 4294967296))) (.cse3 (* (div (+ c_~k2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ .cse3 c_~k1~0 1) .cse4) (< .cse4 (+ .cse3 2 c_~k1~0))))) (< c_~m~0 1) (< c_~j1~0 c_~m~0)) (forall ((~m~0 Int)) (or (let ((.cse6 (* 2 ~m~0))) (< (+ c_~k2~0 .cse6 .cse1) (+ 3 c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse2 ~m~0) (< ~m~0 1))) (< 0 c_~m~0) (<= c_~m~0 1) (= (mod (+ (* c_~m~0 4294967295) c_~k2~0) 4294967296) 0) (<= 0 c_~j1~0) (= (mod (+ 4294967295 c_~k1~0) 4294967296) 0))) is different from false [2023-08-31 01:41:41,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:44,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:46,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:48,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:50,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:52,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:54,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:56,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:41:58,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:00,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:02,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:04,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:06,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:08,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:42:10,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:12,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:14,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:18,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:20,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:22,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:24,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:26,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:28,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:30,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:32,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:34,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:36,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:38,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:40,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:42,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:44,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:46,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:48,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:42:51,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:53,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:55,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:57,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:42:59,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:01,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:03,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:05,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:07,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:09,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:11,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:14,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:16,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:18,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:43:20,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:22,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:24,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:26,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:28,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:30,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:32,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:34,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:36,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:38,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:40,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:42,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:44,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:46,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:48,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:50,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:43:52,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:55,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:57,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:43:59,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:01,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:03,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:05,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:07,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:09,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:11,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:13,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:15,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:17,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:19,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:21,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:23,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:25,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:35,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:44:37,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:44:39,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:41,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:43,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:45,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:47,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:49,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:51,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:53,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:55,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:57,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:44:59,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:45:01,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:03,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:07,976 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse2 (+ c_~j1~0 1)) (.cse8 (* 4294967296 (div c_~k2~0 4294967296))) (.cse7 (+ c_~k2~0 (* 4294967296 (div c_~k1~0 4294967296))))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (let ((.cse0 (* 2 ~m~0))) (<= (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse0) 4294967296) 4294967296)) (+ c_~k2~0 .cse0 .cse1))) (< .cse2 ~m~0) (< ~m~0 1))) (or (let ((.cse5 (* c_~m~0 2))) (let ((.cse4 (+ c_~k2~0 .cse5 (* (div (+ c_~k1~0 1) 4294967296) 4294967296))) (.cse3 (* (div (+ c_~k2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ .cse3 c_~k1~0 1) .cse4) (< .cse4 (+ .cse3 2 c_~k1~0))))) (< c_~m~0 1) (< c_~j1~0 c_~m~0)) (forall ((~m~0 Int)) (or (let ((.cse6 (* 2 ~m~0))) (< (+ c_~k2~0 .cse6 .cse1) (+ 3 c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse2 ~m~0) (< ~m~0 1))) (< .cse7 (+ .cse8 c_~k1~0 1)) (<= (+ .cse8 c_~k1~0) .cse7))) is different from false [2023-08-31 01:45:10,041 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* 4294967296 (div c_~k1~0 4294967296)))) (let ((.cse1 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse2 (+ c_~j1~0 1)) (.cse8 (+ c_~k2~0 c_~m~0 .cse11)) (.cse7 (* (div (+ c_~k2~0 c_~m~0) 4294967296) 4294967296)) (.cse10 (* 4294967296 (div c_~k2~0 4294967296))) (.cse9 (+ c_~k2~0 .cse11))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (let ((.cse0 (* 2 ~m~0))) (<= (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse0) 4294967296) 4294967296)) (+ c_~k2~0 .cse0 .cse1))) (< .cse2 ~m~0) (< ~m~0 1))) (or (let ((.cse5 (* c_~m~0 2))) (let ((.cse4 (+ c_~k2~0 .cse5 (* (div (+ c_~k1~0 1) 4294967296) 4294967296))) (.cse3 (* (div (+ c_~k2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ .cse3 c_~k1~0 1) .cse4) (< .cse4 (+ .cse3 2 c_~k1~0))))) (< c_~m~0 1) (< c_~j1~0 c_~m~0)) (forall ((~m~0 Int)) (or (let ((.cse6 (* 2 ~m~0))) (< (+ c_~k2~0 .cse6 .cse1) (+ 3 c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse2 ~m~0) (< ~m~0 1))) (<= (+ .cse7 c_~k1~0) .cse8) (< .cse8 (+ .cse7 c_~k1~0 1)) (< .cse9 (+ .cse10 c_~k1~0 1)) (<= (+ .cse10 c_~k1~0) .cse9)))) is different from false [2023-08-31 01:45:12,137 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse2 (+ c_~j1~0 1))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (let ((.cse0 (* 2 ~m~0))) (<= (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse0) 4294967296) 4294967296)) (+ c_~k2~0 .cse0 .cse1))) (< .cse2 ~m~0) (< ~m~0 1))) (or (let ((.cse5 (* c_~m~0 2))) (let ((.cse4 (+ c_~k2~0 .cse5 (* (div (+ c_~k1~0 1) 4294967296) 4294967296))) (.cse3 (* (div (+ c_~k2~0 .cse5) 4294967296) 4294967296))) (and (<= (+ .cse3 c_~k1~0 1) .cse4) (< .cse4 (+ .cse3 2 c_~k1~0))))) (< c_~m~0 1) (< c_~j1~0 c_~m~0)) (forall ((~m~0 Int)) (or (let ((.cse6 (* 2 ~m~0))) (< (+ c_~k2~0 .cse6 .cse1) (+ 3 c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse2 ~m~0) (< ~m~0 1))) (exists ((~m~0 Int)) (and (<= ~m~0 1) (<= 1 ~m~0) (= (mod (+ c_~k2~0 (* 4294967294 ~m~0)) 4294967296) 0))) (= (mod (+ 4294967294 c_~k1~0) 4294967296) 0))) is different from false [2023-08-31 01:45:14,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:16,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:18,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:20,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:22,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:24,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:26,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:28,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:30,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:32,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:34,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:36,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:38,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:45:41,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:45:43,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:45:45,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:45:52,073 INFO L130 PetriNetUnfolder]: 9056/16863 cut-off events. [2023-08-31 01:45:52,073 INFO L131 PetriNetUnfolder]: For 683408/683408 co-relation queries the response was YES. [2023-08-31 01:45:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184098 conditions, 16863 events. 9056/16863 cut-off events. For 683408/683408 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 143100 event pairs, 550 based on Foata normal form. 30/16893 useless extension candidates. Maximal degree in co-relation 182057. Up to 6895 conditions per place. [2023-08-31 01:45:52,320 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 772 selfloop transitions, 1220 changer transitions 81/2073 dead transitions. [2023-08-31 01:45:52,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 2073 transitions, 61445 flow [2023-08-31 01:45:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-31 01:45:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-31 01:45:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3255 transitions. [2023-08-31 01:45:52,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2023-08-31 01:45:52,335 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3255 transitions. [2023-08-31 01:45:52,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3255 transitions. [2023-08-31 01:45:52,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:45:52,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3255 transitions. [2023-08-31 01:45:52,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 93.0) internal successors, (3255), 35 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states 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 01:45:52,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 224.0) internal successors, (8064), 36 states have internal predecessors, (8064), 0 states have call successors, (0), 0 states 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 01:45:52,345 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 224.0) internal successors, (8064), 36 states have internal predecessors, (8064), 0 states have call successors, (0), 0 states 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 01:45:52,346 INFO L175 Difference]: Start difference. First operand has 378 places, 1538 transitions, 43653 flow. Second operand 35 states and 3255 transitions. [2023-08-31 01:45:52,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 2073 transitions, 61445 flow [2023-08-31 01:45:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 2073 transitions, 60406 flow, removed 513 selfloop flow, removed 4 redundant places. [2023-08-31 01:45:58,741 INFO L231 Difference]: Finished difference. Result has 428 places, 1846 transitions, 56107 flow [2023-08-31 01:45:58,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=42844, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=945, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=56107, PETRI_PLACES=428, PETRI_TRANSITIONS=1846} [2023-08-31 01:45:58,742 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 409 predicate places. [2023-08-31 01:45:58,742 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 1846 transitions, 56107 flow [2023-08-31 01:45:58,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 89.34782608695652) internal successors, (2055), 23 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states 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 01:45:58,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:45:58,742 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:45:58,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-31 01:45:58,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-31 01:45:58,947 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:45:58,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:45:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1811320966, now seen corresponding path program 18 times [2023-08-31 01:45:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:45:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836161854] [2023-08-31 01:45:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:45:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:45:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:45:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:45:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:45:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836161854] [2023-08-31 01:45:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836161854] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:45:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734108062] [2023-08-31 01:45:59,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 01:45:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:45:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:45:59,167 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:45:59,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-31 01:45:59,327 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-31 01:45:59,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:45:59,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 01:45:59,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:45:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:45:59,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:46:01,798 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (forall ((~m~0 Int)) (or (let ((.cse3 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse3 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse3) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))))) is different from false [2023-08-31 01:46:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-08-31 01:46:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734108062] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:46:02,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:46:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 19 [2023-08-31 01:46:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392216731] [2023-08-31 01:46:02,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:46:02,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:46:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:46:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:46:02,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2023-08-31 01:46:02,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-08-31 01:46:02,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 1846 transitions, 56107 flow. Second operand has 21 states, 21 states have (on average 85.42857142857143) internal successors, (1794), 21 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states 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 01:46:02,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:46:02,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-08-31 01:46:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:46:04,489 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse3 (+ c_~j1~0 1))) (and (or (let ((.cse2 (* c_~m~0 2))) (let ((.cse1 (+ c_~k2~0 .cse2 (* (div (+ c_~k1~0 1) 4294967296) 4294967296))) (.cse0 (* (div (+ c_~k2~0 .cse2) 4294967296) 4294967296))) (and (< (+ .cse0 c_~k1~0) .cse1) (<= .cse1 (+ .cse0 c_~k1~0 1))))) (< c_~j1~0 c_~m~0)) (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse3 ~m~0) (let ((.cse4 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse4) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse4 .cse5))))) (forall ((~m~0 Int)) (or (let ((.cse6 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse6 .cse5) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse3 ~m~0))) (< 0 c_~m~0) (<= c_~m~0 1) (= (mod (+ (* c_~m~0 4294967295) c_~k2~0) 4294967296) 0) (= (mod (+ 4294967295 c_~k1~0) 4294967296) 0))) is different from false [2023-08-31 01:46:07,516 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (exists ((~m~0 Int)) (and (<= ~m~0 1) (< 0 ~m~0) (= (mod (+ c_~k2~0 (* 4294967294 ~m~0)) 4294967296) 0))) (forall ((~m~0 Int)) (or (let ((.cse3 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse3 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse3) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))) (= (mod (+ 4294967294 c_~k1~0) 4294967296) 0))) is different from false [2023-08-31 01:46:10,894 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1)) (.cse5 (+ (* 4294967296 (div c_~k2~0 4294967296)) c_~k1~0)) (.cse4 (* 4294967296 (div c_~k1~0 4294967296)))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (forall ((~m~0 Int)) (or (let ((.cse3 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse3 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse3) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))) (<= (+ c_~k2~0 .cse4) .cse5) (< .cse5 (+ c_~k2~0 .cse4 1)))) is different from false [2023-08-31 01:46:18,891 INFO L130 PetriNetUnfolder]: 9466/17661 cut-off events. [2023-08-31 01:46:18,892 INFO L131 PetriNetUnfolder]: For 822045/822045 co-relation queries the response was YES. [2023-08-31 01:46:19,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215070 conditions, 17661 events. 9466/17661 cut-off events. For 822045/822045 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 151109 event pairs, 903 based on Foata normal form. 9/17670 useless extension candidates. Maximal degree in co-relation 213001. Up to 16683 conditions per place. [2023-08-31 01:46:19,140 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 1918 selfloop transitions, 162 changer transitions 11/2091 dead transitions. [2023-08-31 01:46:19,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 2091 transitions, 67488 flow [2023-08-31 01:46:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-31 01:46:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-31 01:46:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1615 transitions. [2023-08-31 01:46:19,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40054563492063494 [2023-08-31 01:46:19,143 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1615 transitions. [2023-08-31 01:46:19,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1615 transitions. [2023-08-31 01:46:19,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:46:19,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1615 transitions. [2023-08-31 01:46:19,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 89.72222222222223) internal successors, (1615), 18 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 01:46:19,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 224.0) internal successors, (4256), 19 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states 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 01:46:19,146 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 224.0) internal successors, (4256), 19 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states 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 01:46:19,147 INFO L175 Difference]: Start difference. First operand has 428 places, 1846 transitions, 56107 flow. Second operand 18 states and 1615 transitions. [2023-08-31 01:46:19,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 2091 transitions, 67488 flow [2023-08-31 01:46:28,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2091 transitions, 64042 flow, removed 1274 selfloop flow, removed 9 redundant places. [2023-08-31 01:46:28,088 INFO L231 Difference]: Finished difference. Result has 445 places, 1962 transitions, 57210 flow [2023-08-31 01:46:28,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=52999, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=57210, PETRI_PLACES=445, PETRI_TRANSITIONS=1962} [2023-08-31 01:46:28,089 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 426 predicate places. [2023-08-31 01:46:28,090 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 1962 transitions, 57210 flow [2023-08-31 01:46:28,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 85.42857142857143) internal successors, (1794), 21 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states 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 01:46:28,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:46:28,090 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:46:28,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-31 01:46:28,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:46:28,295 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:46:28,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:46:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 7973638, now seen corresponding path program 19 times [2023-08-31 01:46:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:46:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219299805] [2023-08-31 01:46:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:46:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:46:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:46:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:46:28,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:46:28,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219299805] [2023-08-31 01:46:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219299805] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:46:28,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799104771] [2023-08-31 01:46:28,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 01:46:28,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:46:28,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:46:28,553 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:46:28,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-31 01:46:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:46:28,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 01:46:28,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:46:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:46:29,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:46:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:46:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799104771] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:46:29,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:46:29,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 19 [2023-08-31 01:46:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886607432] [2023-08-31 01:46:29,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:46:29,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:46:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:46:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:46:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-08-31 01:46:30,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-31 01:46:30,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1962 transitions, 57210 flow. Second operand has 21 states, 21 states have (on average 93.38095238095238) internal successors, (1961), 21 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states 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 01:46:30,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:46:30,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-31 01:46:30,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:46:44,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:46:47,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:46:48,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:46:50,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:46:52,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 01:46:54,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:46:56,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:47:04,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:47:13,462 INFO L130 PetriNetUnfolder]: 10315/19342 cut-off events. [2023-08-31 01:47:13,463 INFO L131 PetriNetUnfolder]: For 953746/953746 co-relation queries the response was YES. [2023-08-31 01:47:13,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241389 conditions, 19342 events. 10315/19342 cut-off events. For 953746/953746 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 167579 event pairs, 974 based on Foata normal form. 24/19366 useless extension candidates. Maximal degree in co-relation 237767. Up to 17146 conditions per place. [2023-08-31 01:47:13,756 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1984 selfloop transitions, 366 changer transitions 33/2383 dead transitions. [2023-08-31 01:47:13,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 2383 transitions, 74651 flow [2023-08-31 01:47:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-31 01:47:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-31 01:47:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2155 transitions. [2023-08-31 01:47:13,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43729707792207795 [2023-08-31 01:47:13,758 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2155 transitions. [2023-08-31 01:47:13,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2155 transitions. [2023-08-31 01:47:13,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:47:13,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2155 transitions. [2023-08-31 01:47:13,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 97.95454545454545) internal successors, (2155), 22 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states 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 01:47:13,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 224.0) internal successors, (5152), 23 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states 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 01:47:13,763 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 224.0) internal successors, (5152), 23 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states 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 01:47:13,763 INFO L175 Difference]: Start difference. First operand has 445 places, 1962 transitions, 57210 flow. Second operand 22 states and 2155 transitions. [2023-08-31 01:47:13,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 2383 transitions, 74651 flow [2023-08-31 01:47:24,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 2383 transitions, 73905 flow, removed 360 selfloop flow, removed 7 redundant places. [2023-08-31 01:47:24,149 INFO L231 Difference]: Finished difference. Result has 468 places, 2181 transitions, 65035 flow [2023-08-31 01:47:24,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=56464, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=65035, PETRI_PLACES=468, PETRI_TRANSITIONS=2181} [2023-08-31 01:47:24,150 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 449 predicate places. [2023-08-31 01:47:24,150 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 2181 transitions, 65035 flow [2023-08-31 01:47:24,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 93.38095238095238) internal successors, (1961), 21 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states 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 01:47:24,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:47:24,151 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:47:24,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-08-31 01:47:24,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-31 01:47:24,355 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:47:24,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:47:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1559351968, now seen corresponding path program 20 times [2023-08-31 01:47:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:47:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327062495] [2023-08-31 01:47:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:47:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:47:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:47:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:47:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:47:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327062495] [2023-08-31 01:47:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327062495] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:47:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293254832] [2023-08-31 01:47:24,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:47:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:47:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:47:24,641 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:47:24,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-31 01:47:24,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:47:24,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:47:24,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-31 01:47:24,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:47:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:47:25,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:47:27,441 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (forall ((~m~0 Int)) (or (let ((.cse3 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse3 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse3) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))))) is different from false [2023-08-31 01:47:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-08-31 01:47:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293254832] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:47:27,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:47:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 19 [2023-08-31 01:47:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149048380] [2023-08-31 01:47:27,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:47:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:47:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:47:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:47:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=322, Unknown=1, NotChecked=36, Total=420 [2023-08-31 01:47:27,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-08-31 01:47:27,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 2181 transitions, 65035 flow. Second operand has 21 states, 21 states have (on average 85.42857142857143) internal successors, (1794), 21 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states 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 01:47:27,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:47:27,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-08-31 01:47:27,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:47:31,028 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (* 4294967296 (div c_~k2~0 4294967296)))) (let ((.cse3 (* (div (+ c_~k1~0 1) 4294967296) 4294967296)) (.cse4 (< c_~j1~0 c_~m~0)) (.cse7 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse5 (+ c_~j1~0 1)) (.cse10 (+ .cse9 c_~k1~0)) (.cse12 (* 4294967296 (div c_~k1~0 4294967296)))) (and (<= c_~j1~0 1) (or (let ((.cse2 (* c_~m~0 2))) (let ((.cse1 (+ c_~k2~0 .cse2 .cse3)) (.cse0 (* (div (+ c_~k2~0 .cse2) 4294967296) 4294967296))) (and (< (+ .cse0 c_~k1~0) .cse1) (<= .cse1 (+ .cse0 c_~k1~0 1))))) .cse4) (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse5 ~m~0) (let ((.cse6 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse6 .cse7))))) (or (let ((.cse8 (+ c_~k2~0 .cse3))) (and (<= .cse8 (+ .cse9 c_~k1~0 1)) (< .cse10 .cse8))) .cse4) (forall ((~m~0 Int)) (or (let ((.cse11 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse11 .cse7) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse11) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse5 ~m~0))) (< 0 c_~m~0) (= (mod (+ (* c_~m~0 4294967295) c_~k2~0) 4294967296) 0) (<= (+ c_~k2~0 .cse12) .cse10) (< .cse10 (+ c_~k2~0 .cse12 1)) (= (mod (+ 4294967295 c_~k1~0) 4294967296) 0)))) is different from false [2023-08-31 01:47:34,910 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (exists ((~m~0 Int)) (and (<= ~m~0 1) (< 0 ~m~0) (= (mod (+ c_~k2~0 (* 4294967294 ~m~0)) 4294967296) 0))) (forall ((~m~0 Int)) (or (let ((.cse3 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse3 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse3) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))) (= (mod (+ 4294967294 c_~k1~0) 4294967296) 0))) is different from false [2023-08-31 01:47:41,608 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1)) (.cse5 (+ (* 4294967296 (div c_~k2~0 4294967296)) c_~k1~0)) (.cse4 (* 4294967296 (div c_~k1~0 4294967296)))) (and (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (forall ((~m~0 Int)) (or (let ((.cse3 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse3 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse3) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))) (<= (+ c_~k2~0 .cse4) .cse5) (< .cse5 (+ c_~k2~0 .cse4 1)))) is different from false [2023-08-31 01:47:49,758 INFO L130 PetriNetUnfolder]: 10818/20292 cut-off events. [2023-08-31 01:47:49,758 INFO L131 PetriNetUnfolder]: For 1043486/1043486 co-relation queries the response was YES. [2023-08-31 01:47:49,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258430 conditions, 20292 events. 10818/20292 cut-off events. For 1043486/1043486 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 177400 event pairs, 958 based on Foata normal form. 9/20301 useless extension candidates. Maximal degree in co-relation 256688. Up to 19340 conditions per place. [2023-08-31 01:47:50,073 INFO L137 encePairwiseOnDemand]: 216/224 looper letters, 2286 selfloop transitions, 171 changer transitions 25/2482 dead transitions. [2023-08-31 01:47:50,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 2482 transitions, 78192 flow [2023-08-31 01:47:50,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-31 01:47:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-31 01:47:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2319 transitions. [2023-08-31 01:47:50,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39817994505494503 [2023-08-31 01:47:50,076 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2319 transitions. [2023-08-31 01:47:50,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2319 transitions. [2023-08-31 01:47:50,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:47:50,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2319 transitions. [2023-08-31 01:47:50,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 89.1923076923077) internal successors, (2319), 26 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states 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 01:47:50,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 224.0) internal successors, (6048), 27 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states 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 01:47:50,082 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 224.0) internal successors, (6048), 27 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states 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 01:47:50,082 INFO L175 Difference]: Start difference. First operand has 468 places, 2181 transitions, 65035 flow. Second operand 26 states and 2319 transitions. [2023-08-31 01:47:50,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 2482 transitions, 78192 flow [2023-08-31 01:48:02,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 2482 transitions, 76155 flow, removed 1003 selfloop flow, removed 7 redundant places. [2023-08-31 01:48:02,109 INFO L231 Difference]: Finished difference. Result has 500 places, 2304 transitions, 67996 flow [2023-08-31 01:48:02,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=62998, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=67996, PETRI_PLACES=500, PETRI_TRANSITIONS=2304} [2023-08-31 01:48:02,111 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 481 predicate places. [2023-08-31 01:48:02,111 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 2304 transitions, 67996 flow [2023-08-31 01:48:02,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 85.42857142857143) internal successors, (1794), 21 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states 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 01:48:02,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:48:02,111 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:48:02,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-31 01:48:02,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-31 01:48:02,316 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:48:02,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:48:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1704281468, now seen corresponding path program 21 times [2023-08-31 01:48:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:48:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334737617] [2023-08-31 01:48:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:48:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:48:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:48:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:48:02,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:48:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334737617] [2023-08-31 01:48:02,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334737617] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:48:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196706534] [2023-08-31 01:48:02,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:48:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:48:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:48:02,524 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:48:02,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-31 01:48:02,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 01:48:02,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:48:02,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-31 01:48:02,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:48:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:48:03,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:48:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:48:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196706534] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:48:03,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:48:03,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-08-31 01:48:03,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101670570] [2023-08-31 01:48:03,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:48:03,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-31 01:48:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:48:03,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-31 01:48:03,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2023-08-31 01:48:05,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-31 01:48:05,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 2304 transitions, 67996 flow. Second operand has 24 states, 24 states have (on average 93.25) internal successors, (2238), 24 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states 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 01:48:05,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:48:05,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-31 01:48:05,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:48:15,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:48:17,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:48:19,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:48:29,527 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 47 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:48:32,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-31 01:48:48,145 WARN L222 SmtUtils]: Spent 14.87s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:48:50,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-31 01:49:04,568 INFO L130 PetriNetUnfolder]: 13301/24855 cut-off events. [2023-08-31 01:49:04,568 INFO L131 PetriNetUnfolder]: For 1396048/1396048 co-relation queries the response was YES. [2023-08-31 01:49:04,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332721 conditions, 24855 events. 13301/24855 cut-off events. For 1396048/1396048 co-relation queries the response was YES. Maximal size of possible extension queue 1412. Compared 221033 event pairs, 984 based on Foata normal form. 22/24877 useless extension candidates. Maximal degree in co-relation 330516. Up to 12913 conditions per place. [2023-08-31 01:49:05,062 INFO L137 encePairwiseOnDemand]: 218/224 looper letters, 1475 selfloop transitions, 1705 changer transitions 56/3236 dead transitions. [2023-08-31 01:49:05,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 3236 transitions, 101964 flow [2023-08-31 01:49:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-31 01:49:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-31 01:49:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3211 transitions. [2023-08-31 01:49:05,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43438852813852813 [2023-08-31 01:49:05,068 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3211 transitions. [2023-08-31 01:49:05,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3211 transitions. [2023-08-31 01:49:05,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:49:05,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3211 transitions. [2023-08-31 01:49:05,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 97.3030303030303) internal successors, (3211), 33 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states 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 01:49:05,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 224.0) internal successors, (7616), 34 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states 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 01:49:05,075 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 224.0) internal successors, (7616), 34 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states 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 01:49:05,075 INFO L175 Difference]: Start difference. First operand has 500 places, 2304 transitions, 67996 flow. Second operand 33 states and 3211 transitions. [2023-08-31 01:49:05,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 3236 transitions, 101964 flow [2023-08-31 01:49:22,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 3236 transitions, 100956 flow, removed 480 selfloop flow, removed 11 redundant places. [2023-08-31 01:49:22,392 INFO L231 Difference]: Finished difference. Result has 534 places, 2820 transitions, 92643 flow [2023-08-31 01:49:22,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=66939, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=828, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=92643, PETRI_PLACES=534, PETRI_TRANSITIONS=2820} [2023-08-31 01:49:22,394 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 515 predicate places. [2023-08-31 01:49:22,394 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 2820 transitions, 92643 flow [2023-08-31 01:49:22,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 93.25) internal successors, (2238), 24 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states 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 01:49:22,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:49:22,395 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:49:22,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-08-31 01:49:22,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:49:22,597 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:49:22,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:49:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1960753912, now seen corresponding path program 22 times [2023-08-31 01:49:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:49:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782434374] [2023-08-31 01:49:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:49:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:49:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:49:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:49:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:49:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782434374] [2023-08-31 01:49:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782434374] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:49:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584403266] [2023-08-31 01:49:22,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:49:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:49:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:49:22,817 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:49:22,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-31 01:49:23,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:49:23,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:49:23,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-31 01:49:23,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:49:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:49:23,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:49:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:49:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584403266] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:49:56,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:49:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 19 [2023-08-31 01:49:56,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137579903] [2023-08-31 01:49:56,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:49:56,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:49:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:49:56,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:49:56,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=342, Unknown=14, NotChecked=0, Total=420 [2023-08-31 01:49:58,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:01,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:03,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:05,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:07,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:09,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:11,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:13,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:50:13,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-08-31 01:50:13,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 2820 transitions, 92643 flow. Second operand has 21 states, 21 states have (on average 85.42857142857143) internal successors, (1794), 21 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states 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 01:50:13,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:50:13,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-08-31 01:50:13,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:50:29,503 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4294967296 (div c_~k2~0 4294967296)))) (let ((.cse2 (* 4294967296 (div (+ 2 c_~k1~0) 4294967296))) (.cse0 (+ c_~j1~0 1)) (.cse5 (+ .cse4 c_~k1~0)) (.cse7 (* 4294967296 (div c_~k1~0 4294967296)))) (and (<= c_~j1~0 1) (forall ((~m~0 Int)) (or (<= ~m~0 c_~j1~0) (< .cse0 ~m~0) (let ((.cse1 (* 2 ~m~0))) (< (+ c_~k1~0 (* (div (+ c_~k2~0 .cse1) 4294967296) 4294967296) 1) (+ c_~k2~0 .cse1 .cse2))))) (or (let ((.cse3 (+ c_~k2~0 (* (div (+ c_~k1~0 1) 4294967296) 4294967296)))) (and (<= .cse3 (+ .cse4 c_~k1~0 1)) (< .cse5 .cse3))) (< c_~j1~0 c_~m~0)) (forall ((~m~0 Int)) (or (let ((.cse6 (* 2 ~m~0))) (<= (+ c_~k2~0 .cse6 .cse2) (+ 2 c_~k1~0 (* (div (+ c_~k2~0 .cse6) 4294967296) 4294967296)))) (<= ~m~0 c_~j1~0) (< .cse0 ~m~0))) (< 0 c_~m~0) (= (mod (+ (* c_~m~0 4294967295) c_~k2~0) 4294967296) 0) (<= (+ c_~k2~0 .cse7) .cse5) (< .cse5 (+ c_~k2~0 .cse7 1)) (= (mod (+ 4294967295 c_~k1~0) 4294967296) 0)))) is different from false Killed by 15