./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.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 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 03:21:54,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 03:21:54,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 03:21:54,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 03:21:54,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 03:21:54,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 03:21:54,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 03:21:54,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 03:21:54,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 03:21:54,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 03:21:54,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 03:21:54,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 03:21:54,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 03:21:54,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 03:21:54,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 03:21:54,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 03:21:54,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 03:21:54,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 03:21:54,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 03:21:54,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 03:21:54,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 03:21:54,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 03:21:54,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 03:21:54,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 03:21:54,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 03:21:54,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 03:21:54,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 03:21:54,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 03:21:54,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 03:21:54,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 03:21:54,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 03:21:54,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 03:21:54,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 03:21:54,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 03:21:54,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 03:21:54,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 03:21:54,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 03:21:54,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 03:21:54,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 03:21:54,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 03:21:54,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 03:21:54,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 03:21:54,641 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 03:21:54,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 03:21:54,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 03:21:54,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 03:21:54,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 03:21:54,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 03:21:54,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 03:21:54,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 03:21:54,645 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 03:21:54,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 03:21:54,645 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 03:21:54,646 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 03:21:54,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 03:21:54,647 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 03:21:54,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 03:21:54,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 03:21:54,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 03:21:54,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 03:21:54,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:21:54,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 03:21:54,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 03:21:54,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 03:21:54,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 03:21:54,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 03:21:54,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 03:21:54,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 03:21:54,649 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 03:21:54,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 03:21:54,649 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 03:21:54,649 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 -> 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 03:21:54,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 03:21:54,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 03:21:54,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 03:21:54,898 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 03:21:54,899 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 03:21:54,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-08-31 03:21:55,800 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 03:21:55,952 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 03:21:55,952 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-08-31 03:21:55,957 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cce45ed2/245ec254a5c2493e9f6952c1951dcbc3/FLAG32d7d6d2b [2023-08-31 03:21:55,967 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cce45ed2/245ec254a5c2493e9f6952c1951dcbc3 [2023-08-31 03:21:55,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 03:21:55,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 03:21:55,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 03:21:55,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 03:21:55,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 03:21:55,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:21:55" (1/1) ... [2023-08-31 03:21:55,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116b941f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:55, skipping insertion in model container [2023-08-31 03:21:55,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:21:55" (1/1) ... [2023-08-31 03:21:55,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 03:21:55,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 03:21:56,107 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-08-31 03:21:56,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:21:56,118 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 03:21:56,132 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-08-31 03:21:56,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:21:56,143 INFO L208 MainTranslator]: Completed translation [2023-08-31 03:21:56,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56 WrapperNode [2023-08-31 03:21:56,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 03:21:56,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 03:21:56,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 03:21:56,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 03:21:56,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,166 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 108 [2023-08-31 03:21:56,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 03:21:56,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 03:21:56,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 03:21:56,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 03:21:56,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 03:21:56,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 03:21:56,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 03:21:56,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 03:21:56,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (1/1) ... [2023-08-31 03:21:56,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:21:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:21:56,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 03:21:56,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 03:21:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 03:21:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 03:21:56,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 03:21:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 03:21:56,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 03:21:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 03:21:56,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 03:21:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 03:21:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 03:21:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 03:21:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 03:21:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 03:21:56,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 03:21:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 03:21:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 03:21:56,249 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 03:21:56,319 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 03:21:56,321 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 03:21:56,532 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 03:21:56,538 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 03:21:56,538 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-31 03:21:56,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:21:56 BoogieIcfgContainer [2023-08-31 03:21:56,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 03:21:56,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 03:21:56,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 03:21:56,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 03:21:56,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 03:21:55" (1/3) ... [2023-08-31 03:21:56,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f42057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:21:56, skipping insertion in model container [2023-08-31 03:21:56,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:21:56" (2/3) ... [2023-08-31 03:21:56,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f42057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:21:56, skipping insertion in model container [2023-08-31 03:21:56,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:21:56" (3/3) ... [2023-08-31 03:21:56,545 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-08-31 03:21:56,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 03:21:56,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 03:21:56,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 03:21:56,577 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 03:21:56,697 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 03:21:56,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 175 transitions, 374 flow [2023-08-31 03:21:56,832 INFO L130 PetriNetUnfolder]: 15/172 cut-off events. [2023-08-31 03:21:56,832 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:21:56,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 172 events. 15/172 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-08-31 03:21:56,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 175 transitions, 374 flow [2023-08-31 03:21:56,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 162 transitions, 342 flow [2023-08-31 03:21:56,847 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 03:21:56,858 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 162 transitions, 342 flow [2023-08-31 03:21:56,860 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 162 transitions, 342 flow [2023-08-31 03:21:56,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 162 transitions, 342 flow [2023-08-31 03:21:56,898 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2023-08-31 03:21:56,898 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:21:56,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 162 events. 15/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-08-31 03:21:56,902 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2023-08-31 03:22:01,524 INFO L134 LiptonReduction]: Checked pairs total: 4092 [2023-08-31 03:22:01,524 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-08-31 03:22:01,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 03:22:01,538 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;@3040afca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 03:22:01,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 03:22:01,542 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-08-31 03:22:01,542 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:22:01,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:01,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:01,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:01,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1548535715, now seen corresponding path program 1 times [2023-08-31 03:22:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:01,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430140248] [2023-08-31 03:22:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430140248] [2023-08-31 03:22:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430140248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:22:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:22:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:22:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79596943] [2023-08-31 03:22:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:22:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:22:02,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:22:02,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-31 03:22:02,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:02,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-31 03:22:02,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:02,227 INFO L130 PetriNetUnfolder]: 543/714 cut-off events. [2023-08-31 03:22:02,227 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-31 03:22:02,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 714 events. 543/714 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2207 event pairs, 212 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 1213. Up to 697 conditions per place. [2023-08-31 03:22:02,234 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-31 03:22:02,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 128 flow [2023-08-31 03:22:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:22:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:22:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-31 03:22:02,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809384164222874 [2023-08-31 03:22:02,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-31 03:22:02,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-31 03:22:02,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:02,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-31 03:22:02,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,269 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 492 transitions. [2023-08-31 03:22:02,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 128 flow [2023-08-31 03:22:02,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 03:22:02,273 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2023-08-31 03:22:02,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-08-31 03:22:02,276 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-08-31 03:22:02,277 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 74 flow [2023-08-31 03:22:02,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:02,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:02,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 03:22:02,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:02,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2004951010, now seen corresponding path program 1 times [2023-08-31 03:22:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013467790] [2023-08-31 03:22:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:02,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:02,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013467790] [2023-08-31 03:22:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013467790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:22:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:22:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:22:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312589993] [2023-08-31 03:22:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:22:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:22:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:22:02,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-31 03:22:02,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:02,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-31 03:22:02,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:02,737 INFO L130 PetriNetUnfolder]: 753/1008 cut-off events. [2023-08-31 03:22:02,738 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-31 03:22:02,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1008 events. 753/1008 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3502 event pairs, 95 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 2032. Up to 825 conditions per place. [2023-08-31 03:22:02,741 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 39 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-08-31 03:22:02,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 203 flow [2023-08-31 03:22:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:22:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:22:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-08-31 03:22:02,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965786901270772 [2023-08-31 03:22:02,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-08-31 03:22:02,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-08-31 03:22:02,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:02,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-08-31 03:22:02,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,748 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 74 flow. Second operand 3 states and 508 transitions. [2023-08-31 03:22:02,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 203 flow [2023-08-31 03:22:02,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 199 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 03:22:02,750 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 100 flow [2023-08-31 03:22:02,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2023-08-31 03:22:02,751 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-31 03:22:02,751 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 100 flow [2023-08-31 03:22:02,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:02,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:02,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:02,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 03:22:02,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:02,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash 610154948, now seen corresponding path program 1 times [2023-08-31 03:22:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231120447] [2023-08-31 03:22:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:02,884 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 03:22:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231120447] [2023-08-31 03:22:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231120447] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617311759] [2023-08-31 03:22:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:02,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:02,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:02,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 03:22:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:02,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 03:22:02,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:03,262 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 03:22:03,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:03,340 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 03:22:03,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617311759] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:22:03,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:22:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-31 03:22:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277197127] [2023-08-31 03:22:03,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:22:03,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 03:22:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 03:22:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-08-31 03:22:03,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 341 [2023-08-31 03:22:03,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 100 flow. Second operand has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 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 03:22:03,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:03,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 341 [2023-08-31 03:22:03,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:03,748 INFO L130 PetriNetUnfolder]: 1451/1990 cut-off events. [2023-08-31 03:22:03,748 INFO L131 PetriNetUnfolder]: For 456/458 co-relation queries the response was YES. [2023-08-31 03:22:03,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 1990 events. 1451/1990 cut-off events. For 456/458 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8476 event pairs, 397 based on Foata normal form. 66/1680 useless extension candidates. Maximal degree in co-relation 2520. Up to 758 conditions per place. [2023-08-31 03:22:03,763 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 80 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2023-08-31 03:22:03,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 88 transitions, 445 flow [2023-08-31 03:22:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 03:22:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 03:22:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1100 transitions. [2023-08-31 03:22:03,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608294930875576 [2023-08-31 03:22:03,766 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1100 transitions. [2023-08-31 03:22:03,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1100 transitions. [2023-08-31 03:22:03,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:03,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1100 transitions. [2023-08-31 03:22:03,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:03,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:03,772 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:03,772 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 100 flow. Second operand 7 states and 1100 transitions. [2023-08-31 03:22:03,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 88 transitions, 445 flow [2023-08-31 03:22:03,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 88 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:22:03,774 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 143 flow [2023-08-31 03:22:03,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-08-31 03:22:03,775 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-31 03:22:03,775 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 143 flow [2023-08-31 03:22:03,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 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 03:22:03,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:03,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:03,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 03:22:03,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:03,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:03,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash -141297123, now seen corresponding path program 1 times [2023-08-31 03:22:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616306750] [2023-08-31 03:22:03,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:04,058 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 03:22:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616306750] [2023-08-31 03:22:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616306750] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675437765] [2023-08-31 03:22:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:04,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:04,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:04,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:04,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 03:22:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:04,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:22:04,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:04,173 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 03:22:04,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:04,206 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 03:22:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675437765] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:22:04,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:22:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-31 03:22:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404234908] [2023-08-31 03:22:04,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:22:04,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 03:22:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 03:22:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-31 03:22:04,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 341 [2023-08-31 03:22:04,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 143 flow. Second operand has 12 states, 12 states have (on average 150.58333333333334) internal successors, (1807), 12 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:04,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:04,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 341 [2023-08-31 03:22:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:04,539 INFO L130 PetriNetUnfolder]: 942/1371 cut-off events. [2023-08-31 03:22:04,539 INFO L131 PetriNetUnfolder]: For 627/679 co-relation queries the response was YES. [2023-08-31 03:22:04,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 1371 events. 942/1371 cut-off events. For 627/679 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5932 event pairs, 343 based on Foata normal form. 64/1230 useless extension candidates. Maximal degree in co-relation 2541. Up to 612 conditions per place. [2023-08-31 03:22:04,545 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 70 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2023-08-31 03:22:04,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 424 flow [2023-08-31 03:22:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 03:22:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 03:22:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1107 transitions. [2023-08-31 03:22:04,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637620444072057 [2023-08-31 03:22:04,548 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1107 transitions. [2023-08-31 03:22:04,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1107 transitions. [2023-08-31 03:22:04,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:04,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1107 transitions. [2023-08-31 03:22:04,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:04,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:04,554 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:04,554 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 143 flow. Second operand 7 states and 1107 transitions. [2023-08-31 03:22:04,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 424 flow [2023-08-31 03:22:04,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 416 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-31 03:22:04,557 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 165 flow [2023-08-31 03:22:04,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-31 03:22:04,558 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-08-31 03:22:04,558 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 165 flow [2023-08-31 03:22:04,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 150.58333333333334) internal successors, (1807), 12 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:04,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:04,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:04,565 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 03:22:04,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-31 03:22:04,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:04,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -990089336, now seen corresponding path program 1 times [2023-08-31 03:22:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:04,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354433541] [2023-08-31 03:22:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:04,965 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 03:22:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354433541] [2023-08-31 03:22:04,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354433541] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:04,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501185197] [2023-08-31 03:22:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:04,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:04,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:04,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 03:22:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:05,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 03:22:05,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:05,109 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 03:22:05,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:05,153 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 03:22:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501185197] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:22:05,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:22:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-31 03:22:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826856400] [2023-08-31 03:22:05,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:22:05,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 03:22:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 03:22:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-08-31 03:22:05,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 341 [2023-08-31 03:22:05,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 165 flow. Second operand has 14 states, 14 states have (on average 149.21428571428572) internal successors, (2089), 14 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:05,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:05,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 341 [2023-08-31 03:22:05,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:05,616 INFO L130 PetriNetUnfolder]: 734/1067 cut-off events. [2023-08-31 03:22:05,616 INFO L131 PetriNetUnfolder]: For 808/841 co-relation queries the response was YES. [2023-08-31 03:22:05,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1067 events. 734/1067 cut-off events. For 808/841 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4421 event pairs, 271 based on Foata normal form. 33/1031 useless extension candidates. Maximal degree in co-relation 2802. Up to 691 conditions per place. [2023-08-31 03:22:05,620 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 40 selfloop transitions, 4 changer transitions 25/71 dead transitions. [2023-08-31 03:22:05,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 403 flow [2023-08-31 03:22:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 03:22:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 03:22:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1085 transitions. [2023-08-31 03:22:05,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-08-31 03:22:05,623 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1085 transitions. [2023-08-31 03:22:05,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1085 transitions. [2023-08-31 03:22:05,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:05,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1085 transitions. [2023-08-31 03:22:05,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:05,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:05,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:05,629 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 165 flow. Second operand 7 states and 1085 transitions. [2023-08-31 03:22:05,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 403 flow [2023-08-31 03:22:05,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 394 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 03:22:05,633 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 140 flow [2023-08-31 03:22:05,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2023-08-31 03:22:05,635 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-08-31 03:22:05,635 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 140 flow [2023-08-31 03:22:05,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 149.21428571428572) internal successors, (2089), 14 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:05,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:05,636 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:05,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:05,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:05,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:05,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash 547279721, now seen corresponding path program 2 times [2023-08-31 03:22:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:05,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581587471] [2023-08-31 03:22:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581587471] [2023-08-31 03:22:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581587471] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276788347] [2023-08-31 03:22:05,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:22:05,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:05,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:05,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:05,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 03:22:06,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:22:06,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:22:06,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 03:22:06,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:06,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276788347] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:22:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-08-31 03:22:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197004291] [2023-08-31 03:22:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:06,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 03:22:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 03:22:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-31 03:22:06,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 341 [2023-08-31 03:22:06,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:06,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:06,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 341 [2023-08-31 03:22:06,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:06,261 INFO L130 PetriNetUnfolder]: 751/1009 cut-off events. [2023-08-31 03:22:06,262 INFO L131 PetriNetUnfolder]: For 744/746 co-relation queries the response was YES. [2023-08-31 03:22:06,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 1009 events. 751/1009 cut-off events. For 744/746 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3415 event pairs, 155 based on Foata normal form. 48/1056 useless extension candidates. Maximal degree in co-relation 3082. Up to 583 conditions per place. [2023-08-31 03:22:06,266 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2023-08-31 03:22:06,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 289 flow [2023-08-31 03:22:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 03:22:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 03:22:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2023-08-31 03:22:06,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-08-31 03:22:06,269 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 930 transitions. [2023-08-31 03:22:06,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 930 transitions. [2023-08-31 03:22:06,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:06,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 930 transitions. [2023-08-31 03:22:06,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:06,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:06,274 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:06,274 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 140 flow. Second operand 6 states and 930 transitions. [2023-08-31 03:22:06,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 289 flow [2023-08-31 03:22:06,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 243 flow, removed 12 selfloop flow, removed 13 redundant places. [2023-08-31 03:22:06,278 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 144 flow [2023-08-31 03:22:06,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-31 03:22:06,280 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-31 03:22:06,280 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 144 flow [2023-08-31 03:22:06,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:06,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:06,281 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:06,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:06,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:06,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:06,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1381542472, now seen corresponding path program 2 times [2023-08-31 03:22:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:06,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185024183] [2023-08-31 03:22:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185024183] [2023-08-31 03:22:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185024183] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12174995] [2023-08-31 03:22:06,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:22:06,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:06,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:06,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:06,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 03:22:06,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:22:06,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:22:06,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:22:06,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:06,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:06,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12174995] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:22:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-08-31 03:22:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943599756] [2023-08-31 03:22:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:06,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 03:22:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 03:22:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-08-31 03:22:06,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 341 [2023-08-31 03:22:06,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:06,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:06,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 341 [2023-08-31 03:22:06,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:07,195 INFO L130 PetriNetUnfolder]: 947/1306 cut-off events. [2023-08-31 03:22:07,195 INFO L131 PetriNetUnfolder]: For 1389/1577 co-relation queries the response was YES. [2023-08-31 03:22:07,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 1306 events. 947/1306 cut-off events. For 1389/1577 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4851 event pairs, 242 based on Foata normal form. 202/1419 useless extension candidates. Maximal degree in co-relation 3927. Up to 717 conditions per place. [2023-08-31 03:22:07,202 INFO L137 encePairwiseOnDemand]: 332/341 looper letters, 76 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-31 03:22:07,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 538 flow [2023-08-31 03:22:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:22:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:22:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1208 transitions. [2023-08-31 03:22:07,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44281524926686217 [2023-08-31 03:22:07,206 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1208 transitions. [2023-08-31 03:22:07,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1208 transitions. [2023-08-31 03:22:07,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:07,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1208 transitions. [2023-08-31 03:22:07,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.0) internal successors, (1208), 8 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:07,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:07,212 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:07,212 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 144 flow. Second operand 8 states and 1208 transitions. [2023-08-31 03:22:07,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 538 flow [2023-08-31 03:22:07,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 533 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 03:22:07,214 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2023-08-31 03:22:07,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 03:22:07,215 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-08-31 03:22:07,215 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2023-08-31 03:22:07,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:07,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:07,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:07,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:07,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:07,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:07,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1520372626, now seen corresponding path program 3 times [2023-08-31 03:22:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359168033] [2023-08-31 03:22:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:07,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359168033] [2023-08-31 03:22:07,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359168033] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:07,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619404516] [2023-08-31 03:22:07,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:22:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:07,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:07,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:07,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-31 03:22:07,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:22:07,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:22:07,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:22:07,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:07,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619404516] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:07,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:22:07,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2023-08-31 03:22:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488145337] [2023-08-31 03:22:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:07,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 03:22:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 03:22:07,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-08-31 03:22:07,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 341 [2023-08-31 03:22:07,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:07,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:07,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 341 [2023-08-31 03:22:07,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:08,144 INFO L130 PetriNetUnfolder]: 1354/1861 cut-off events. [2023-08-31 03:22:08,144 INFO L131 PetriNetUnfolder]: For 2964/3192 co-relation queries the response was YES. [2023-08-31 03:22:08,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1861 events. 1354/1861 cut-off events. For 2964/3192 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7039 event pairs, 292 based on Foata normal form. 240/2100 useless extension candidates. Maximal degree in co-relation 6667. Up to 877 conditions per place. [2023-08-31 03:22:08,153 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 98 selfloop transitions, 28 changer transitions 0/127 dead transitions. [2023-08-31 03:22:08,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 896 flow [2023-08-31 03:22:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 03:22:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 03:22:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1512 transitions. [2023-08-31 03:22:08,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434017595307918 [2023-08-31 03:22:08,157 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1512 transitions. [2023-08-31 03:22:08,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1512 transitions. [2023-08-31 03:22:08,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:08,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1512 transitions. [2023-08-31 03:22:08,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 151.2) internal successors, (1512), 10 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:08,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:08,163 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:08,163 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 208 flow. Second operand 10 states and 1512 transitions. [2023-08-31 03:22:08,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 896 flow [2023-08-31 03:22:08,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 127 transitions, 873 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 03:22:08,166 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 383 flow [2023-08-31 03:22:08,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2023-08-31 03:22:08,167 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-08-31 03:22:08,167 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 383 flow [2023-08-31 03:22:08,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:08,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:08,168 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:08,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:08,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:08,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:08,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -259531838, now seen corresponding path program 4 times [2023-08-31 03:22:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913986983] [2023-08-31 03:22:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913986983] [2023-08-31 03:22:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913986983] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:08,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130838309] [2023-08-31 03:22:08,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 03:22:08,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:08,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:08,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-31 03:22:08,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 03:22:08,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:22:08,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:22:08,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:08,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:22:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130838309] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:22:08,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:22:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-08-31 03:22:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740722485] [2023-08-31 03:22:08,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:22:08,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 03:22:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 03:22:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-08-31 03:22:09,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 341 [2023-08-31 03:22:09,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 383 flow. Second operand has 18 states, 18 states have (on average 144.83333333333334) internal successors, (2607), 18 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:09,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:09,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 341 [2023-08-31 03:22:09,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:09,508 INFO L130 PetriNetUnfolder]: 1773/2440 cut-off events. [2023-08-31 03:22:09,508 INFO L131 PetriNetUnfolder]: For 6600/6898 co-relation queries the response was YES. [2023-08-31 03:22:09,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2440 events. 1773/2440 cut-off events. For 6600/6898 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9975 event pairs, 316 based on Foata normal form. 312/2751 useless extension candidates. Maximal degree in co-relation 10429. Up to 1135 conditions per place. [2023-08-31 03:22:09,522 INFO L137 encePairwiseOnDemand]: 330/341 looper letters, 110 selfloop transitions, 51 changer transitions 0/162 dead transitions. [2023-08-31 03:22:09,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 162 transitions, 1330 flow [2023-08-31 03:22:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 03:22:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 03:22:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1523 transitions. [2023-08-31 03:22:09,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4466275659824047 [2023-08-31 03:22:09,526 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1523 transitions. [2023-08-31 03:22:09,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1523 transitions. [2023-08-31 03:22:09,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:09,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1523 transitions. [2023-08-31 03:22:09,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 152.3) internal successors, (1523), 10 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:09,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:09,532 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:09,532 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 383 flow. Second operand 10 states and 1523 transitions. [2023-08-31 03:22:09,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 162 transitions, 1330 flow [2023-08-31 03:22:09,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 1269 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-31 03:22:09,544 INFO L231 Difference]: Finished difference. Result has 69 places, 90 transitions, 794 flow [2023-08-31 03:22:09,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=794, PETRI_PLACES=69, PETRI_TRANSITIONS=90} [2023-08-31 03:22:09,544 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2023-08-31 03:22:09,545 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 90 transitions, 794 flow [2023-08-31 03:22:09,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 144.83333333333334) internal successors, (2607), 18 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:09,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:09,546 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:09,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:09,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:09,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:09,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 111750626, now seen corresponding path program 5 times [2023-08-31 03:22:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188746491] [2023-08-31 03:22:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188746491] [2023-08-31 03:22:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188746491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055499173] [2023-08-31 03:22:09,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:22:09,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:09,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:09,905 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:09,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-31 03:22:09,993 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:22:09,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:22:09,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 03:22:09,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:22:10,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:22:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055499173] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:22:10,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:22:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-08-31 03:22:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579982242] [2023-08-31 03:22:10,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:22:10,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 03:22:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 03:22:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-08-31 03:22:10,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 341 [2023-08-31 03:22:10,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 90 transitions, 794 flow. Second operand has 15 states, 15 states have (on average 140.86666666666667) internal successors, (2113), 15 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:10,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:10,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 341 [2023-08-31 03:22:10,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:11,341 INFO L130 PetriNetUnfolder]: 2124/2936 cut-off events. [2023-08-31 03:22:11,342 INFO L131 PetriNetUnfolder]: For 11245/11245 co-relation queries the response was YES. [2023-08-31 03:22:11,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14382 conditions, 2936 events. 2124/2936 cut-off events. For 11245/11245 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11868 event pairs, 72 based on Foata normal form. 16/2952 useless extension candidates. Maximal degree in co-relation 14340. Up to 1249 conditions per place. [2023-08-31 03:22:11,371 INFO L137 encePairwiseOnDemand]: 329/341 looper letters, 144 selfloop transitions, 105 changer transitions 0/249 dead transitions. [2023-08-31 03:22:11,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 249 transitions, 2475 flow [2023-08-31 03:22:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-31 03:22:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-31 03:22:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2351 transitions. [2023-08-31 03:22:11,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4309017595307918 [2023-08-31 03:22:11,378 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2351 transitions. [2023-08-31 03:22:11,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2351 transitions. [2023-08-31 03:22:11,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:11,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2351 transitions. [2023-08-31 03:22:11,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 146.9375) internal successors, (2351), 16 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:11,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 341.0) internal successors, (5797), 17 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:11,398 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 341.0) internal successors, (5797), 17 states have internal predecessors, (5797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:11,398 INFO L175 Difference]: Start difference. First operand has 69 places, 90 transitions, 794 flow. Second operand 16 states and 2351 transitions. [2023-08-31 03:22:11,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 249 transitions, 2475 flow [2023-08-31 03:22:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 249 transitions, 2432 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-31 03:22:11,434 INFO L231 Difference]: Finished difference. Result has 89 places, 149 transitions, 1706 flow [2023-08-31 03:22:11,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1706, PETRI_PLACES=89, PETRI_TRANSITIONS=149} [2023-08-31 03:22:11,436 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2023-08-31 03:22:11,436 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 149 transitions, 1706 flow [2023-08-31 03:22:11,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 140.86666666666667) internal successors, (2113), 15 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:11,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:11,437 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:11,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:11,645 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,SelfDestructingSolverStorable9 [2023-08-31 03:22:11,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:11,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:11,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2132688008, now seen corresponding path program 6 times [2023-08-31 03:22:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:11,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973838701] [2023-08-31 03:22:11,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:11,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:11,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973838701] [2023-08-31 03:22:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973838701] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:11,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744636527] [2023-08-31 03:22:11,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 03:22:11,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:11,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:11,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:11,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-31 03:22:11,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 03:22:11,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:22:11,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:22:11,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:11,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744636527] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:22:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-08-31 03:22:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469940453] [2023-08-31 03:22:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:12,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 03:22:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 03:22:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-08-31 03:22:12,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 341 [2023-08-31 03:22:12,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 149 transitions, 1706 flow. Second operand has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:12,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:12,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 341 [2023-08-31 03:22:12,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:12,552 INFO L130 PetriNetUnfolder]: 2056/2828 cut-off events. [2023-08-31 03:22:12,553 INFO L131 PetriNetUnfolder]: For 13548/13666 co-relation queries the response was YES. [2023-08-31 03:22:12,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15149 conditions, 2828 events. 2056/2828 cut-off events. For 13548/13666 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11377 event pairs, 270 based on Foata normal form. 132/2960 useless extension candidates. Maximal degree in co-relation 15098. Up to 1119 conditions per place. [2023-08-31 03:22:12,567 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 130 selfloop transitions, 71 changer transitions 0/207 dead transitions. [2023-08-31 03:22:12,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 207 transitions, 2433 flow [2023-08-31 03:22:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 03:22:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 03:22:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1368 transitions. [2023-08-31 03:22:12,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44574780058651026 [2023-08-31 03:22:12,570 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1368 transitions. [2023-08-31 03:22:12,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1368 transitions. [2023-08-31 03:22:12,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:12,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1368 transitions. [2023-08-31 03:22:12,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 152.0) internal successors, (1368), 9 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:12,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:12,575 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:12,575 INFO L175 Difference]: Start difference. First operand has 89 places, 149 transitions, 1706 flow. Second operand 9 states and 1368 transitions. [2023-08-31 03:22:12,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 207 transitions, 2433 flow [2023-08-31 03:22:12,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 207 transitions, 2400 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-31 03:22:12,606 INFO L231 Difference]: Finished difference. Result has 96 places, 151 transitions, 1893 flow [2023-08-31 03:22:12,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1893, PETRI_PLACES=96, PETRI_TRANSITIONS=151} [2023-08-31 03:22:12,607 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2023-08-31 03:22:12,607 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 151 transitions, 1893 flow [2023-08-31 03:22:12,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:12,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:12,607 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:12,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:12,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:12,812 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:12,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1095595526, now seen corresponding path program 7 times [2023-08-31 03:22:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186124285] [2023-08-31 03:22:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186124285] [2023-08-31 03:22:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186124285] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318958144] [2023-08-31 03:22:12,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 03:22:12,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:12,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:12,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:12,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 03:22:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:12,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 03:22:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:13,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:22:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318958144] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:22:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2023-08-31 03:22:13,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61052842] [2023-08-31 03:22:13,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:13,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 03:22:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 03:22:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-08-31 03:22:13,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 341 [2023-08-31 03:22:13,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 151 transitions, 1893 flow. Second operand has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:13,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:13,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 341 [2023-08-31 03:22:13,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:13,644 INFO L130 PetriNetUnfolder]: 2020/2772 cut-off events. [2023-08-31 03:22:13,644 INFO L131 PetriNetUnfolder]: For 16622/16734 co-relation queries the response was YES. [2023-08-31 03:22:13,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15837 conditions, 2772 events. 2020/2772 cut-off events. For 16622/16734 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10995 event pairs, 302 based on Foata normal form. 126/2898 useless extension candidates. Maximal degree in co-relation 15783. Up to 1096 conditions per place. [2023-08-31 03:22:13,663 INFO L137 encePairwiseOnDemand]: 331/341 looper letters, 95 selfloop transitions, 102 changer transitions 0/203 dead transitions. [2023-08-31 03:22:13,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 2568 flow [2023-08-31 03:22:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 03:22:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 03:22:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1363 transitions. [2023-08-31 03:22:13,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444118605408928 [2023-08-31 03:22:13,666 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1363 transitions. [2023-08-31 03:22:13,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1363 transitions. [2023-08-31 03:22:13,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:13,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1363 transitions. [2023-08-31 03:22:13,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.44444444444446) internal successors, (1363), 9 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:13,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:13,672 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:13,672 INFO L175 Difference]: Start difference. First operand has 96 places, 151 transitions, 1893 flow. Second operand 9 states and 1363 transitions. [2023-08-31 03:22:13,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 2568 flow [2023-08-31 03:22:13,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 203 transitions, 2553 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 03:22:13,713 INFO L231 Difference]: Finished difference. Result has 103 places, 153 transitions, 2192 flow [2023-08-31 03:22:13,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2192, PETRI_PLACES=103, PETRI_TRANSITIONS=153} [2023-08-31 03:22:13,714 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2023-08-31 03:22:13,714 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 153 transitions, 2192 flow [2023-08-31 03:22:13,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:13,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:13,715 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:13,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 03:22:13,919 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,SelfDestructingSolverStorable11 [2023-08-31 03:22:13,919 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:13,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1081782259, now seen corresponding path program 1 times [2023-08-31 03:22:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398687072] [2023-08-31 03:22:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:22:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398687072] [2023-08-31 03:22:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398687072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:22:13,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:22:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 03:22:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467286369] [2023-08-31 03:22:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:22:13,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:22:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:22:13,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:22:13,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 341 [2023-08-31 03:22:13,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 153 transitions, 2192 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:13,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:13,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 341 [2023-08-31 03:22:13,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:14,254 INFO L130 PetriNetUnfolder]: 1876/2602 cut-off events. [2023-08-31 03:22:14,255 INFO L131 PetriNetUnfolder]: For 25072/25806 co-relation queries the response was YES. [2023-08-31 03:22:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16315 conditions, 2602 events. 1876/2602 cut-off events. For 25072/25806 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 11346 event pairs, 464 based on Foata normal form. 436/2943 useless extension candidates. Maximal degree in co-relation 16258. Up to 1644 conditions per place. [2023-08-31 03:22:14,271 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 166 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2023-08-31 03:22:14,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 194 transitions, 3059 flow [2023-08-31 03:22:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:22:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:22:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-08-31 03:22:14,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49853372434017595 [2023-08-31 03:22:14,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-08-31 03:22:14,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-08-31 03:22:14,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:22:14,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-08-31 03:22:14,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:14,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:14,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:14,276 INFO L175 Difference]: Start difference. First operand has 103 places, 153 transitions, 2192 flow. Second operand 3 states and 510 transitions. [2023-08-31 03:22:14,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 194 transitions, 3059 flow [2023-08-31 03:22:14,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 194 transitions, 2924 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-31 03:22:14,307 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 2093 flow [2023-08-31 03:22:14,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2023-08-31 03:22:14,309 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2023-08-31 03:22:14,309 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 2093 flow [2023-08-31 03:22:14,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:14,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:22:14,309 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:22:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 03:22:14,309 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:22:14,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:22:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2072266448, now seen corresponding path program 1 times [2023-08-31 03:22:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:22:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274140801] [2023-08-31 03:22:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:22:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:16,795 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 03:22:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:22:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274140801] [2023-08-31 03:22:16,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274140801] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:22:16,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870817579] [2023-08-31 03:22:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:22:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:22:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:22:16,801 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:22:16,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 03:22:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:22:17,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-31 03:22:17,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:22:17,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 03:22:17,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 03:22:17,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:22:17,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 03:22:17,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:22:17,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 03:22:17,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:22:17,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:22:17,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-08-31 03:22:17,897 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 03:22:17,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:22:18,916 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4 (* c_thread1Thread1of1ForFork0_~i~0 4))) (.cse10 (* 4 c_~M~0))) (let ((.cse1 (= (mod c_~sorted3~0 256) 0)) (.cse2 (<= c_~N~0 (+ c_~M~0 1))) (.cse3 (< (+ 2 c_~M~0) c_~N~0)) (.cse8 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 4)) (.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse0 (forall ((v_ArrVal_587 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base) .cse6) |c_thread1Thread1of1ForFork0_#t~mem2|)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse1 .cse2 .cse3 .cse4 (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (< |c_thread1Thread1of1ForFork0_#t~mem2| (select .cse5 .cse6)) (<= (select .cse5 .cse7) (select .cse5 .cse8)))))) (or .cse2 .cse3 (and (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (<= (select .cse9 .cse6) |c_thread1Thread1of1ForFork0_#t~mem2|) (< (select .cse9 .cse8) (select .cse9 .cse7))))) (or (not .cse4) .cse0)))))) is different from false [2023-08-31 03:22:27,271 WARN L222 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:22:28,285 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_585))) (let ((.cse0 (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (let ((.cse1 (* ~M~0 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse1 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ 2 ~M~0) c_~N~0) (<= (select .cse0 .cse2) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= c_~N~0 (+ ~M~0 1)))))) (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_585))) (let ((.cse5 (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< 0 ~M~0) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse5 .cse2)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse6 (* ~M~0 4))) (<= (select .cse5 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= c_~N~0 (+ ~M~0 1)))))))) is different from false [2023-08-31 03:22:28,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:22:28,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 76 [2023-08-31 03:22:28,353 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-08-31 03:22:28,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 515 treesize of output 480 [2023-08-31 03:22:28,395 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-08-31 03:22:28,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 254 [2023-08-31 03:22:28,420 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-08-31 03:22:28,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 220 [2023-08-31 03:22:28,474 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-08-31 03:22:28,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 119 [2023-08-31 03:22:28,947 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 03:22:28,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2023-08-31 03:22:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-31 03:22:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870817579] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:22:29,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:22:29,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 41 [2023-08-31 03:22:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826876192] [2023-08-31 03:22:29,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:22:29,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-31 03:22:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:22:29,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-31 03:22:29,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1464, Unknown=13, NotChecked=158, Total=1806 [2023-08-31 03:22:29,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-08-31 03:22:29,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 2093 flow. Second operand has 43 states, 43 states have (on average 86.74418604651163) internal successors, (3730), 43 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:22:29,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:22:29,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-08-31 03:22:29,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:22:39,220 WARN L222 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 123 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:23:03,943 WARN L222 SmtUtils]: Spent 23.36s on a formula simplification. DAG size of input: 136 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:23:36,107 WARN L222 SmtUtils]: Spent 26.20s on a formula simplification. DAG size of input: 143 DAG size of output: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:24:28,761 WARN L222 SmtUtils]: Spent 16.42s on a formula simplification. DAG size of input: 162 DAG size of output: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:24:58,898 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse16 (= (mod c_~sorted2~0 256) 0)) (.cse13 (= (mod c_~sorted3~0 256) 0)) (.cse22 (+ c_~A~0.offset 4 .cse31))) (let ((.cse19 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (.cse1 (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base) .cse22) |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse18 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (not .cse13)) (.cse0 (< 2 c_~N~0)) (.cse8 (not .cse16)) (.cse17 (select |c_#memory_int| c_~A~0.base)) (.cse6 (= (mod c_~sorted1~0 256) 0))) (and (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or .cse0 .cse1 .cse2) (= c_~sorted2~0 1) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse3 (= c_~sorted3~0 1)) (.cse4 (= 1 c_~sorted1~0))) (or (and .cse3 .cse4) (let ((.cse5 (not (= c_thread3Thread1of1ForFork2_~i~2 1)))) (and (or (= c_~sorted3~0 0) (and .cse5 .cse3)) (or (and .cse5 .cse4) (= 0 c_~sorted1~0)))))) (or .cse6 (let ((.cse10 (+ c_~A~0.offset 4)) (.cse11 (select .cse17 c_~A~0.offset))) (let ((.cse7 (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base) .cse10) .cse11)))) (and (or .cse7 .cse0 .cse8) (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (< 0 ~M~0) (<= (select .cse9 .cse10) .cse11) (< (+ 2 ~M~0) c_~N~0) (let ((.cse12 (* ~M~0 4))) (< (select .cse9 (+ c_~A~0.offset .cse12)) (select .cse9 (+ c_~A~0.offset .cse12 4)))) (<= c_~N~0 (+ ~M~0 1))))) (or .cse7 .cse0 .cse2) (or .cse13 (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (let ((.cse15 (* ~M~0 4))) (<= (select .cse14 (+ c_~A~0.offset .cse15 4)) (select .cse14 (+ c_~A~0.offset .cse15)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< .cse11 (select .cse14 .cse10)) (<= c_~N~0 (+ ~M~0 1))))) .cse16))))) (<= .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse19 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse18 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse19 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse21 (* ~M~0 4))) (< (select .cse20 (+ c_~A~0.offset .cse21)) (select .cse20 (+ c_~A~0.offset .cse21 4)))) (<= (select .cse20 .cse22) |c_thread1Thread1of1ForFork0_#t~mem2|) (<= c_~N~0 (+ ~M~0 1))))) (<= c_thread3Thread1of1ForFork2_~i~2 1) (<= 2 c_~N~0) (or .cse0 .cse1 .cse8) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse13 (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (let ((.cse24 (* ~M~0 4))) (<= (select .cse23 (+ c_~A~0.offset .cse24 4)) (select .cse23 (+ c_~A~0.offset .cse24)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< |c_thread1Thread1of1ForFork0_#t~mem2| (select .cse23 .cse22)) (<= c_~N~0 (+ ~M~0 1))))) .cse16) (or (let ((.cse26 (select .cse17 (+ c_~A~0.offset .cse31)))) (let ((.cse28 (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base) .cse22) .cse26)))) (and (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (<= (select .cse25 .cse22) .cse26) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse27 (* ~M~0 4))) (< (select .cse25 (+ c_~A~0.offset .cse27)) (select .cse25 (+ c_~A~0.offset .cse27 4)))) (<= c_~N~0 (+ ~M~0 1))))) (or .cse0 .cse28 .cse2) (or .cse0 .cse8 .cse28) (or .cse13 (forall ((~M~0 Int) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (or (let ((.cse30 (* ~M~0 4))) (<= (select .cse29 (+ c_~A~0.offset .cse30 4)) (select .cse29 (+ c_~A~0.offset .cse30)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (< .cse26 (select .cse29 .cse22)) (<= c_~N~0 (+ ~M~0 1))))) .cse16)))) .cse6))))) is different from false [2023-08-31 03:25:12,146 WARN L222 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 139 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:25:31,272 WARN L222 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 192 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:25:36,045 INFO L130 PetriNetUnfolder]: 6204/8974 cut-off events. [2023-08-31 03:25:36,045 INFO L131 PetriNetUnfolder]: For 70428/70428 co-relation queries the response was YES. [2023-08-31 03:25:36,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51677 conditions, 8974 events. 6204/8974 cut-off events. For 70428/70428 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 47654 event pairs, 121 based on Foata normal form. 7/8981 useless extension candidates. Maximal degree in co-relation 51621. Up to 3632 conditions per place. [2023-08-31 03:25:36,103 INFO L137 encePairwiseOnDemand]: 323/341 looper letters, 649 selfloop transitions, 519 changer transitions 42/1210 dead transitions. [2023-08-31 03:25:36,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1210 transitions, 14784 flow [2023-08-31 03:25:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-31 03:25:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-31 03:25:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 8134 transitions. [2023-08-31 03:25:36,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2741766946438804 [2023-08-31 03:25:36,112 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 8134 transitions. [2023-08-31 03:25:36,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 8134 transitions. [2023-08-31 03:25:36,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:25:36,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 8134 transitions. [2023-08-31 03:25:36,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 93.49425287356321) internal successors, (8134), 87 states have internal predecessors, (8134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:25:36,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 341.0) internal successors, (30008), 88 states have internal predecessors, (30008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:25:36,149 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 341.0) internal successors, (30008), 88 states have internal predecessors, (30008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:25:36,150 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 2093 flow. Second operand 87 states and 8134 transitions. [2023-08-31 03:25:36,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1210 transitions, 14784 flow [2023-08-31 03:25:36,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1210 transitions, 14775 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:25:36,347 INFO L231 Difference]: Finished difference. Result has 211 places, 666 transitions, 10426 flow [2023-08-31 03:25:36,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=10426, PETRI_PLACES=211, PETRI_TRANSITIONS=666} [2023-08-31 03:25:36,348 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2023-08-31 03:25:36,348 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 666 transitions, 10426 flow [2023-08-31 03:25:36,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 86.74418604651163) internal successors, (3730), 43 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:25:36,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:25:36,349 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:25:36,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-31 03:25:36,554 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 03:25:36,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:25:36,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:25:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1236109612, now seen corresponding path program 2 times [2023-08-31 03:25:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:25:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573661445] [2023-08-31 03:25:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:25:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:25:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:25:38,543 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 03:25:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:25:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573661445] [2023-08-31 03:25:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573661445] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:25:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753087753] [2023-08-31 03:25:38,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:25:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:25:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:25:38,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:25:38,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-31 03:25:38,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:25:38,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:25:38,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-31 03:25:38,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:25:39,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:25:39,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:25:39,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-08-31 03:25:39,541 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 03:25:39,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:25:40,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:25:40,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 79 [2023-08-31 03:25:40,680 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-08-31 03:25:40,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 1 [2023-08-31 03:25:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:25:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753087753] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:25:41,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:25:41,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-08-31 03:25:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150139519] [2023-08-31 03:25:41,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:25:41,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-31 03:25:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:25:41,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-31 03:25:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2023-08-31 03:25:44,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-31 03:25:44,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 666 transitions, 10426 flow. Second operand has 38 states, 38 states have (on average 121.97368421052632) internal successors, (4635), 38 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:25:44,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:25:44,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-31 03:25:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:26:09,748 INFO L130 PetriNetUnfolder]: 12521/18102 cut-off events. [2023-08-31 03:26:09,748 INFO L131 PetriNetUnfolder]: For 185068/185068 co-relation queries the response was YES. [2023-08-31 03:26:09,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121179 conditions, 18102 events. 12521/18102 cut-off events. For 185068/185068 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 105238 event pairs, 156 based on Foata normal form. 389/18491 useless extension candidates. Maximal degree in co-relation 121093. Up to 7114 conditions per place. [2023-08-31 03:26:09,917 INFO L137 encePairwiseOnDemand]: 322/341 looper letters, 839 selfloop transitions, 1317 changer transitions 51/2207 dead transitions. [2023-08-31 03:26:09,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 2207 transitions, 31905 flow [2023-08-31 03:26:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-08-31 03:26:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2023-08-31 03:26:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 13342 transitions. [2023-08-31 03:26:09,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835892128112242 [2023-08-31 03:26:09,942 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 13342 transitions. [2023-08-31 03:26:09,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 13342 transitions. [2023-08-31 03:26:09,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:26:09,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 13342 transitions. [2023-08-31 03:26:09,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 130.80392156862746) internal successors, (13342), 102 states have internal predecessors, (13342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:26:09,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 341.0) internal successors, (35123), 103 states have internal predecessors, (35123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:26:09,996 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 341.0) internal successors, (35123), 103 states have internal predecessors, (35123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:26:09,996 INFO L175 Difference]: Start difference. First operand has 211 places, 666 transitions, 10426 flow. Second operand 102 states and 13342 transitions. [2023-08-31 03:26:09,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 2207 transitions, 31905 flow [2023-08-31 03:26:10,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 2207 transitions, 29624 flow, removed 1088 selfloop flow, removed 3 redundant places. [2023-08-31 03:26:10,874 INFO L231 Difference]: Finished difference. Result has 364 places, 1540 transitions, 25056 flow [2023-08-31 03:26:10,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=8144, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=25056, PETRI_PLACES=364, PETRI_TRANSITIONS=1540} [2023-08-31 03:26:10,875 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 332 predicate places. [2023-08-31 03:26:10,875 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 1540 transitions, 25056 flow [2023-08-31 03:26:10,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 121.97368421052632) internal successors, (4635), 38 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:26:10,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:26:10,876 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:26:10,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-31 03:26:11,080 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 03:26:11,081 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:26:11,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:26:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -178464276, now seen corresponding path program 3 times [2023-08-31 03:26:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 03:26:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703477530] [2023-08-31 03:26:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:26:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 03:26:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:26:12,928 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 03:26:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 03:26:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703477530] [2023-08-31 03:26:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703477530] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 03:26:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217998071] [2023-08-31 03:26:12,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:26:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 03:26:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:26:12,930 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 03:26:12,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-31 03:26:13,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:26:13,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:26:13,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-31 03:26:13,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:26:13,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 03:26:13,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 03:26:13,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 03:26:13,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:26:13,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 03:26:13,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 03:26:13,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:26:13,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-08-31 03:26:14,174 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 03:26:14,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:26:21,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:26:21,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2023-08-31 03:26:21,738 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-08-31 03:26:21,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 823 treesize of output 776 [2023-08-31 03:26:21,772 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-08-31 03:26:21,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 258 [2023-08-31 03:26:21,814 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-08-31 03:26:21,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 234 [2023-08-31 03:26:21,866 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-08-31 03:26:21,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 119 [2023-08-31 03:26:22,368 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 03:26:22,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 1 [2023-08-31 03:26:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:26:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217998071] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:26:22,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 03:26:22,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 39 [2023-08-31 03:26:22,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287760474] [2023-08-31 03:26:22,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 03:26:22,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-31 03:26:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 03:26:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-31 03:26:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1431, Unknown=39, NotChecked=0, Total=1640 [2023-08-31 03:26:26,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 341 [2023-08-31 03:26:26,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1540 transitions, 25056 flow. Second operand has 41 states, 41 states have (on average 86.82926829268293) internal successors, (3560), 41 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:26:26,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:26:26,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 341 [2023-08-31 03:26:26,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:26:45,496 WARN L222 SmtUtils]: Spent 12.67s on a formula simplification. DAG size of input: 138 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:26:45,769 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (= (mod c_~sorted2~0 256) 0)) (.cse40 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse4 (= (mod c_~sorted3~0 256) 0))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse15 (< 2 c_~N~0)) (.cse16 (not .cse4)) (.cse8 (+ c_~A~0.offset 4 .cse40)) (.cse17 (+ c_~A~0.offset .cse40)) (.cse12 (not .cse5)) (.cse18 (= (mod c_~sorted1~0 256) 0)) (.cse3 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (let ((.cse1 (select .cse2 4)) (.cse0 (select .cse2 0))) (or (and (< .cse0 .cse1) (= 1 c_~sorted1~0)) (and (= 0 c_~sorted1~0) (<= .cse1 .cse0)))) (= c_~sorted2~0 1) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (let ((.cse6 (select .cse2 .cse17))) (and (or .cse4 .cse5 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< .cse6 (select .cse7 .cse8)) (< 0 ~M~0) (let ((.cse9 (* ~M~0 4))) (<= (select .cse7 (+ c_~A~0.offset .cse9 4)) (select .cse7 (+ c_~A~0.offset .cse9)))) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))))) (forall ((v_ArrVal_688 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse10 .cse8) .cse6) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse11 (* ~M~0 4))) (< (select .cse10 (+ c_~A~0.offset .cse11)) (select .cse10 (+ c_~A~0.offset .cse11 4)))) (<= c_~N~0 (+ ~M~0 1))))))) (or .cse12 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse13 .cse8) .cse6) (< 0 ~M~0) (let ((.cse14 (* ~M~0 4))) (<= (select .cse13 (+ c_~A~0.offset .cse14 4)) (select .cse13 (+ c_~A~0.offset .cse14)))) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))))) (or .cse15 (forall ((v_ArrVal_688 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse8) .cse6)) .cse16))) .cse18) (<= .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse18 (let ((.cse21 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse19 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((~M~0 Int)) (or (let ((.cse20 (* ~M~0 4))) (< (select .cse19 (+ c_~A~0.offset .cse20)) (select .cse19 (+ c_~A~0.offset .cse20 4)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))) (<= (select .cse19 .cse21) (select (select .cse22 c_~A~0.base) c_~A~0.offset)))))) (or .cse15 .cse16 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (<= (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse21) (select (select .cse23 c_~A~0.base) c_~A~0.offset))))) (or .cse12 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse24 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse25 (* ~M~0 4))) (<= (select .cse24 (+ c_~A~0.offset .cse25 4)) (select .cse24 (+ c_~A~0.offset .cse25)))) (<= (select .cse24 .cse21) (select (select .cse26 c_~A~0.base) c_~A~0.offset)) (<= c_~N~0 (+ ~M~0 1))))))) (or .cse4 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (< (select (select .cse27 c_~A~0.base) c_~A~0.offset) (select .cse28 .cse21)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse29 (* ~M~0 4))) (<= (select .cse28 (+ c_~A~0.offset .cse29 4)) (select .cse28 (+ c_~A~0.offset .cse29)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse5)))) (<= 2 c_~N~0) (= c_~A~0.offset 0) (or (and (or .cse4 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (select (select .cse30 c_~A~0.base) .cse17) (select .cse31 .cse8)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse32 (* ~M~0 4))) (<= (select .cse31 (+ c_~A~0.offset .cse32 4)) (select .cse31 (+ c_~A~0.offset .cse32)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse5) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse33 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((~M~0 Int)) (or (let ((.cse34 (* ~M~0 4))) (< (select .cse33 (+ c_~A~0.offset .cse34)) (select .cse33 (+ c_~A~0.offset .cse34 4)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))) (<= (select .cse33 .cse8) (select (select .cse35 c_~A~0.base) .cse17)))))) (or .cse15 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (<= (select (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse8) (select (select .cse36 c_~A~0.base) .cse17)))) .cse16) (or (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse37 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (<= (select .cse37 .cse8) (select (select .cse38 c_~A~0.base) .cse17)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse39 (* ~M~0 4))) (<= (select .cse37 (+ c_~A~0.offset .cse39 4)) (select .cse37 (+ c_~A~0.offset .cse39)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse12)) .cse18) (= c_~sorted3~0 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2023-08-31 03:27:07,661 WARN L222 SmtUtils]: Spent 21.05s on a formula simplification. DAG size of input: 171 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:27:14,389 WARN L222 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 112 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:27:26,401 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 03:27:28,488 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 03:27:30,512 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 03:27:32,525 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 03:27:51,170 WARN L222 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 141 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:28:04,979 WARN L222 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:28:05,141 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| c_~A~0.base))) (let ((.cse8 (= (mod c_~sorted2~0 256) 0)) (.cse33 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse7 (= (mod c_~sorted3~0 256) 0)) (.cse1 (select .cse20 4)) (.cse0 (select .cse20 0))) (let ((.cse2 (<= .cse1 .cse0)) (.cse18 (< 2 c_~N~0)) (.cse19 (not .cse7)) (.cse11 (+ c_~A~0.offset 4 .cse33)) (.cse21 (+ c_~A~0.offset .cse33)) (.cse15 (not .cse8)) (.cse22 (= (mod c_~sorted1~0 256) 0)) (.cse6 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or (and (< .cse0 .cse1) (= 1 c_~sorted1~0)) (and (= 0 c_~sorted1~0) .cse2)) (= c_~sorted2~0 1) (let ((.cse5 (div c_~sorted1~0 256))) (let ((.cse3 (* 4294967296 (div (+ (* (- 256) .cse5) c_~sorted1~0) 4294967296))) (.cse4 (* .cse5 256))) (or (and .cse2 (= (+ .cse3 .cse4) c_~sorted1~0)) (and (= (+ .cse3 .cse4 1) c_~sorted1~0) (<= (+ .cse0 1) .cse1))))) (<= c_~N~0 2) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_thread2Thread1of1ForFork1_~i~1 0) (<= .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (let ((.cse9 (select .cse20 .cse21))) (and (or .cse7 .cse8 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< .cse9 (select .cse10 .cse11)) (< 0 ~M~0) (let ((.cse12 (* ~M~0 4))) (<= (select .cse10 (+ c_~A~0.offset .cse12 4)) (select .cse10 (+ c_~A~0.offset .cse12)))) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))))) (forall ((v_ArrVal_688 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse13 .cse11) .cse9) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse14 (* ~M~0 4))) (< (select .cse13 (+ c_~A~0.offset .cse14)) (select .cse13 (+ c_~A~0.offset .cse14 4)))) (<= c_~N~0 (+ ~M~0 1))))))) (or .cse15 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse16 .cse11) .cse9) (< 0 ~M~0) (let ((.cse17 (* ~M~0 4))) (<= (select .cse16 (+ c_~A~0.offset .cse17 4)) (select .cse16 (+ c_~A~0.offset .cse17)))) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))))) (or .cse18 (forall ((v_ArrVal_688 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse11) .cse9)) .cse19))) .cse22) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~A~0.offset 0) (or (and (or .cse7 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse24 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (select (select .cse23 c_~A~0.base) .cse21) (select .cse24 .cse11)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse25 (* ~M~0 4))) (<= (select .cse24 (+ c_~A~0.offset .cse25 4)) (select .cse24 (+ c_~A~0.offset .cse25)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse8) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse26 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((~M~0 Int)) (or (let ((.cse27 (* ~M~0 4))) (< (select .cse26 (+ c_~A~0.offset .cse27)) (select .cse26 (+ c_~A~0.offset .cse27 4)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))) (<= (select .cse26 .cse11) (select (select .cse28 c_~A~0.base) .cse21)))))) (or .cse18 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (<= (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse11) (select (select .cse29 c_~A~0.base) .cse21)))) .cse19) (or (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse30 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (<= (select .cse30 .cse11) (select (select .cse31 c_~A~0.base) .cse21)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse32 (* ~M~0 4))) (<= (select .cse30 (+ c_~A~0.offset .cse32 4)) (select .cse30 (+ c_~A~0.offset .cse32)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse15)) .cse22) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= c_~sorted3~0 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|))))) is different from false [2023-08-31 03:28:31,086 WARN L222 SmtUtils]: Spent 10.65s on a formula simplification. DAG size of input: 173 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:28:45,049 WARN L222 SmtUtils]: Spent 8.64s on a formula simplification. DAG size of input: 141 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:29:14,874 WARN L222 SmtUtils]: Spent 18.59s on a formula simplification. DAG size of input: 123 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:29:27,134 WARN L222 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 174 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:29:27,243 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (= (mod c_~sorted2~0 256) 0)) (.cse43 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse6 (= (mod c_~sorted3~0 256) 0)) (.cse1 (select .cse19 4)) (.cse0 (select .cse19 0))) (let ((.cse2 (<= .cse1 .cse0)) (.cse17 (< 2 c_~N~0)) (.cse18 (not .cse6)) (.cse10 (+ c_~A~0.offset 4 .cse43)) (.cse20 (+ c_~A~0.offset .cse43)) (.cse14 (not .cse7)) (.cse21 (= (mod c_~sorted1~0 256) 0))) (and (or (and (< .cse0 .cse1) (= 1 c_~sorted1~0)) (and (= 0 c_~sorted1~0) .cse2)) (= c_~sorted2~0 1) (let ((.cse5 (div c_~sorted1~0 256))) (let ((.cse3 (* 4294967296 (div (+ (* (- 256) .cse5) c_~sorted1~0) 4294967296))) (.cse4 (* .cse5 256))) (or (and .cse2 (= (+ .cse3 .cse4) c_~sorted1~0)) (and (= (+ .cse3 .cse4 1) c_~sorted1~0) (<= (+ .cse0 1) .cse1))))) (<= c_~N~0 2) (<= c_~M~0 0) (or (let ((.cse8 (select .cse19 .cse20))) (and (or .cse6 .cse7 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< .cse8 (select .cse9 .cse10)) (< 0 ~M~0) (let ((.cse11 (* ~M~0 4))) (<= (select .cse9 (+ c_~A~0.offset .cse11 4)) (select .cse9 (+ c_~A~0.offset .cse11)))) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))))) (forall ((v_ArrVal_688 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse12 .cse10) .cse8) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse13 (* ~M~0 4))) (< (select .cse12 (+ c_~A~0.offset .cse13)) (select .cse12 (+ c_~A~0.offset .cse13 4)))) (<= c_~N~0 (+ ~M~0 1))))))) (or .cse14 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int)) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (<= (select .cse15 .cse10) .cse8) (< 0 ~M~0) (let ((.cse16 (* ~M~0 4))) (<= (select .cse15 (+ c_~A~0.offset .cse16 4)) (select .cse15 (+ c_~A~0.offset .cse16)))) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))))) (or .cse17 (forall ((v_ArrVal_688 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse10) .cse8)) .cse18))) .cse21) (or .cse21 (let ((.cse24 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse22 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((~M~0 Int)) (or (let ((.cse23 (* ~M~0 4))) (< (select .cse22 (+ c_~A~0.offset .cse23)) (select .cse22 (+ c_~A~0.offset .cse23 4)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))) (<= (select .cse22 .cse24) (select (select .cse25 c_~A~0.base) c_~A~0.offset)))))) (or .cse17 .cse18 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (<= (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse24) (select (select .cse26 c_~A~0.base) c_~A~0.offset))))) (or .cse14 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse27 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse28 (* ~M~0 4))) (<= (select .cse27 (+ c_~A~0.offset .cse28 4)) (select .cse27 (+ c_~A~0.offset .cse28)))) (<= (select .cse27 .cse24) (select (select .cse29 c_~A~0.base) c_~A~0.offset)) (<= c_~N~0 (+ ~M~0 1))))))) (or .cse6 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (< (select (select .cse30 c_~A~0.base) c_~A~0.offset) (select .cse31 .cse24)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse32 (* ~M~0 4))) (<= (select .cse31 (+ c_~A~0.offset .cse32 4)) (select .cse31 (+ c_~A~0.offset .cse32)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse7)))) (<= 2 c_~N~0) (= c_~A~0.offset 0) (or (and (or .cse6 (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse34 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< (select (select .cse33 c_~A~0.base) .cse20) (select .cse34 .cse10)) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (let ((.cse35 (* ~M~0 4))) (<= (select .cse34 (+ c_~A~0.offset .cse35 4)) (select .cse34 (+ c_~A~0.offset .cse35)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse7) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse36 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (forall ((~M~0 Int)) (or (let ((.cse37 (* ~M~0 4))) (< (select .cse36 (+ c_~A~0.offset .cse37)) (select .cse36 (+ c_~A~0.offset .cse37 4)))) (< 0 ~M~0) (< (+ 2 ~M~0) c_~N~0) (<= c_~N~0 (+ ~M~0 1)))) (<= (select .cse36 .cse10) (select (select .cse38 c_~A~0.base) .cse20)))))) (or .cse17 (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (<= (select (select (store .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base) .cse10) (select (select .cse39 c_~A~0.base) .cse20)))) .cse18) (or (forall ((v_ArrVal_688 (Array Int Int)) (~M~0 Int) (v_ArrVal_687 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687))) (let ((.cse40 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_688) c_~A~0.base))) (or (< 0 ~M~0) (<= (select .cse40 .cse10) (select (select .cse41 c_~A~0.base) .cse20)) (< (+ 2 ~M~0) c_~N~0) (let ((.cse42 (* ~M~0 4))) (<= (select .cse40 (+ c_~A~0.offset .cse42 4)) (select .cse40 (+ c_~A~0.offset .cse42)))) (<= c_~N~0 (+ ~M~0 1)))))) .cse14)) .cse21) (= c_~sorted3~0 1))))) is different from false [2023-08-31 03:29:39,214 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 03:29:56,301 WARN L222 SmtUtils]: Spent 14.34s on a formula simplification. DAG size of input: 139 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:30:19,433 WARN L222 SmtUtils]: Spent 22.60s on a formula simplification. DAG size of input: 136 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:30:37,080 WARN L222 SmtUtils]: Spent 17.23s on a formula simplification. DAG size of input: 98 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:30:52,341 WARN L222 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 140 DAG size of output: 113 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:31:02,974 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 03:31:17,733 WARN L222 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 138 DAG size of output: 120 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:31:34,444 WARN L222 SmtUtils]: Spent 12.89s on a formula simplification. DAG size of input: 143 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:31:46,055 WARN L222 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 166 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:31:59,585 WARN L222 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 149 DAG size of output: 144 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:32:13,710 WARN L222 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 142 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:32:21,899 WARN L222 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 169 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:32:36,393 WARN L222 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 133 DAG size of output: 108 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:32:38,435 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 03:33:25,117 WARN L222 SmtUtils]: Spent 16.92s on a formula simplification. DAG size of input: 176 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:33:41,603 WARN L222 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 210 DAG size of output: 142 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:34:04,378 WARN L222 SmtUtils]: Spent 17.04s on a formula simplification. DAG size of input: 162 DAG size of output: 157 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:34:19,391 WARN L222 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 146 DAG size of output: 144 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:34:39,522 WARN L222 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 132 DAG size of output: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:34:49,392 WARN L222 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 155 DAG size of output: 137 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 03:34:55,510 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-08-31 03:34:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2023-08-31 03:34:55,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-08-31 03:34:55,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-31 03:34:55,713 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 03:34:55,714 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 62 more [2023-08-31 03:34:55,717 INFO L158 Benchmark]: Toolchain (without parser) took 779748.03ms. Allocated memory was 67.1MB in the beginning and 996.1MB in the end (delta: 929.0MB). Free memory was 40.3MB in the beginning and 408.8MB in the end (delta: -368.5MB). Peak memory consumption was 560.4MB. Max. memory is 16.1GB. [2023-08-31 03:34:55,717 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 33.1MB in the beginning and 33.0MB in the end (delta: 48.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 03:34:55,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.39ms. Allocated memory is still 67.1MB. Free memory was 40.1MB in the beginning and 44.4MB in the end (delta: -4.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2023-08-31 03:34:55,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.79ms. Allocated memory is still 67.1MB. Free memory was 44.4MB in the beginning and 42.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 03:34:55,721 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 40.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 03:34:55,721 INFO L158 Benchmark]: RCFGBuilder took 354.25ms. Allocated memory is still 67.1MB. Free memory was 40.9MB in the beginning and 40.3MB in the end (delta: 683.8kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-31 03:34:55,721 INFO L158 Benchmark]: TraceAbstraction took 779175.82ms. Allocated memory was 67.1MB in the beginning and 996.1MB in the end (delta: 929.0MB). Free memory was 39.6MB in the beginning and 408.8MB in the end (delta: -369.2MB). Peak memory consumption was 559.7MB. Max. memory is 16.1GB. [2023-08-31 03:34:55,723 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 33.1MB in the beginning and 33.0MB in the end (delta: 48.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.39ms. Allocated memory is still 67.1MB. Free memory was 40.1MB in the beginning and 44.4MB in the end (delta: -4.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.79ms. Allocated memory is still 67.1MB. Free memory was 44.4MB in the beginning and 42.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 40.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.25ms. Allocated memory is still 67.1MB. Free memory was 40.9MB in the beginning and 40.3MB in the end (delta: 683.8kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 779175.82ms. Allocated memory was 67.1MB in the beginning and 996.1MB in the end (delta: 929.0MB). Free memory was 39.6MB in the beginning and 408.8MB in the end (delta: -369.2MB). Peak memory consumption was 559.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 157 PlacesBefore, 32 PlacesAfterwards, 162 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 7 FixpointIterations, 75 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 22 ConcurrentYvCompositions, 9 ChoiceCompositions, 166 TotalNumberOfCompositions, 4092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3679, independent: 3638, independent conditional: 0, independent unconditional: 3638, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2053, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3679, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2053, unknown conditional: 0, unknown unconditional: 2053] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 03:34:57,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 03:34:57,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 03:34:57,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 03:34:57,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 03:34:57,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 03:34:57,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 03:34:57,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 03:34:57,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 03:34:57,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 03:34:57,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 03:34:57,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 03:34:57,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 03:34:57,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 03:34:57,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 03:34:57,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 03:34:57,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 03:34:57,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 03:34:57,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 03:34:57,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 03:34:57,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 03:34:57,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 03:34:57,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 03:34:57,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 03:34:57,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 03:34:57,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 03:34:57,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 03:34:57,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 03:34:57,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 03:34:57,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 03:34:57,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 03:34:57,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 03:34:57,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 03:34:57,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 03:34:57,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 03:34:57,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 03:34:57,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 03:34:57,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 03:34:57,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 03:34:57,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 03:34:57,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 03:34:57,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-08-31 03:34:57,221 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 03:34:57,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 03:34:57,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 03:34:57,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 03:34:57,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 03:34:57,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 03:34:57,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 03:34:57,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 03:34:57,223 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 03:34:57,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 03:34:57,224 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 03:34:57,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 03:34:57,225 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 03:34:57,226 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 03:34:57,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 03:34:57,226 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 03:34:57,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 03:34:57,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 03:34:57,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 03:34:57,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 03:34:57,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:34:57,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 03:34:57,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 03:34:57,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 03:34:57,227 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 03:34:57,228 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 03:34:57,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 03:34:57,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 03:34:57,228 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 03:34:57,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 03:34:57,229 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 03:34:57,229 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 03:34:57,229 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 -> 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 03:34:57,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 03:34:57,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 03:34:57,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 03:34:57,492 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 03:34:57,492 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 03:34:57,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-08-31 03:34:58,421 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 03:34:58,618 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 03:34:58,618 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-08-31 03:34:58,626 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84054f680/6ba024cdef1e410ebd26f9a286e0b18d/FLAGa79208547 [2023-08-31 03:34:58,637 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84054f680/6ba024cdef1e410ebd26f9a286e0b18d [2023-08-31 03:34:58,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 03:34:58,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 03:34:58,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 03:34:58,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 03:34:58,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 03:34:58,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79591f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58, skipping insertion in model container [2023-08-31 03:34:58,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 03:34:58,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 03:34:58,767 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-08-31 03:34:58,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:34:58,789 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-08-31 03:34:58,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 03:34:58,818 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-08-31 03:34:58,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:34:58,823 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 03:34:58,849 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2023-08-31 03:34:58,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 03:34:58,863 INFO L208 MainTranslator]: Completed translation [2023-08-31 03:34:58,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58 WrapperNode [2023-08-31 03:34:58,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 03:34:58,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 03:34:58,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 03:34:58,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 03:34:58,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,908 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-08-31 03:34:58,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 03:34:58,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 03:34:58,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 03:34:58,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 03:34:58,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,959 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 03:34:58,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 03:34:58,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 03:34:58,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 03:34:58,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (1/1) ... [2023-08-31 03:34:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 03:34:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 03:34:59,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 03:34:59,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 03:34:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 03:34:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 03:34:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 03:34:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 03:34:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 03:34:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 03:34:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 03:34:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 03:34:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 03:34:59,053 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 03:34:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 03:34:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 03:34:59,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 03:34:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 03:34:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 03:34:59,054 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 03:34:59,155 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 03:34:59,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 03:34:59,468 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 03:34:59,474 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 03:34:59,476 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-31 03:34:59,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:34:59 BoogieIcfgContainer [2023-08-31 03:34:59,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 03:34:59,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 03:34:59,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 03:34:59,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 03:34:59,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 03:34:58" (1/3) ... [2023-08-31 03:34:59,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443af4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:34:59, skipping insertion in model container [2023-08-31 03:34:59,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:34:58" (2/3) ... [2023-08-31 03:34:59,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443af4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 03:34:59, skipping insertion in model container [2023-08-31 03:34:59,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:34:59" (3/3) ... [2023-08-31 03:34:59,485 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-08-31 03:34:59,490 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 03:34:59,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 03:34:59,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 03:34:59,496 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 03:34:59,591 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-31 03:34:59,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 172 transitions, 368 flow [2023-08-31 03:34:59,668 INFO L130 PetriNetUnfolder]: 15/169 cut-off events. [2023-08-31 03:34:59,668 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:34:59,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 15/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-31 03:34:59,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 172 transitions, 368 flow [2023-08-31 03:34:59,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 159 transitions, 336 flow [2023-08-31 03:34:59,683 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 03:34:59,689 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 159 transitions, 336 flow [2023-08-31 03:34:59,690 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 159 transitions, 336 flow [2023-08-31 03:34:59,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 159 transitions, 336 flow [2023-08-31 03:34:59,731 INFO L130 PetriNetUnfolder]: 15/159 cut-off events. [2023-08-31 03:34:59,731 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:34:59,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 15/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 198 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-31 03:34:59,734 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2023-08-31 03:35:10,607 INFO L134 LiptonReduction]: Checked pairs total: 4053 [2023-08-31 03:35:10,607 INFO L136 LiptonReduction]: Total number of compositions: 160 [2023-08-31 03:35:10,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 03:35:10,620 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;@4cb60afc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 03:35:10,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-31 03:35:10,631 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-08-31 03:35:10,631 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 03:35:10,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:10,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:10,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:10,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 125169501, now seen corresponding path program 1 times [2023-08-31 03:35:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912313664] [2023-08-31 03:35:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:35:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:10,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:10,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:10,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 03:35:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:35:10,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 03:35:10,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:35:10,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 03:35:10,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912313664] [2023-08-31 03:35:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912313664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:35:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:35:10,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:35:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419244310] [2023-08-31 03:35:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:35:10,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:35:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:35:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:35:11,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 332 [2023-08-31 03:35:11,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:11,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 332 [2023-08-31 03:35:11,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:11,248 INFO L130 PetriNetUnfolder]: 753/1007 cut-off events. [2023-08-31 03:35:11,248 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2023-08-31 03:35:11,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 1007 events. 753/1007 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3499 event pairs, 95 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 1735. Up to 824 conditions per place. [2023-08-31 03:35:11,256 INFO L137 encePairwiseOnDemand]: 325/332 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2023-08-31 03:35:11,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 211 flow [2023-08-31 03:35:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:35:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:35:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-08-31 03:35:11,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501004016064257 [2023-08-31 03:35:11,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-08-31 03:35:11,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-08-31 03:35:11,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:11,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-08-31 03:35:11,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,288 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 499 transitions. [2023-08-31 03:35:11,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 211 flow [2023-08-31 03:35:11,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 03:35:11,294 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 92 flow [2023-08-31 03:35:11,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2023-08-31 03:35:11,298 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-08-31 03:35:11,298 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 92 flow [2023-08-31 03:35:11,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:11,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:11,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:11,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:11,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:11,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1936670208, now seen corresponding path program 1 times [2023-08-31 03:35:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089953845] [2023-08-31 03:35:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:35:11,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:11,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:11,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:11,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 03:35:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:35:11,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-31 03:35:11,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:35:11,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 03:35:11,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089953845] [2023-08-31 03:35:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089953845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:35:11,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:35:11,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 03:35:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804869977] [2023-08-31 03:35:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:35:11,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 03:35:11,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:11,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 03:35:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 03:35:11,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 332 [2023-08-31 03:35:11,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:11,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 332 [2023-08-31 03:35:11,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:11,863 INFO L130 PetriNetUnfolder]: 700/955 cut-off events. [2023-08-31 03:35:11,863 INFO L131 PetriNetUnfolder]: For 216/218 co-relation queries the response was YES. [2023-08-31 03:35:11,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 955 events. 700/955 cut-off events. For 216/218 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3455 event pairs, 318 based on Foata normal form. 1/780 useless extension candidates. Maximal degree in co-relation 366. Up to 933 conditions per place. [2023-08-31 03:35:11,867 INFO L137 encePairwiseOnDemand]: 329/332 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-31 03:35:11,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 152 flow [2023-08-31 03:35:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 03:35:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 03:35:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-31 03:35:11,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48493975903614456 [2023-08-31 03:35:11,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-31 03:35:11,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-31 03:35:11,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:11,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-31 03:35:11,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,872 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 92 flow. Second operand 3 states and 483 transitions. [2023-08-31 03:35:11,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 152 flow [2023-08-31 03:35:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 03:35:11,874 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 100 flow [2023-08-31 03:35:11,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2023-08-31 03:35:11,874 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-31 03:35:11,874 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 100 flow [2023-08-31 03:35:11,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:11,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:11,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:11,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:12,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:12,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:12,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash 568237024, now seen corresponding path program 1 times [2023-08-31 03:35:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997202710] [2023-08-31 03:35:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:35:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:12,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:12,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 03:35:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:35:12,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-31 03:35:12,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:12,397 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 03:35:12,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:12,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 03:35:12,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 179 treesize of output 37 [2023-08-31 03:35:12,621 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 03:35:12,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997202710] [2023-08-31 03:35:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997202710] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:12,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-08-31 03:35:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393829639] [2023-08-31 03:35:12,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:12,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 03:35:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 03:35:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 03:35:13,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 332 [2023-08-31 03:35:13,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 100 flow. Second operand has 10 states, 10 states have (on average 144.2) internal successors, (1442), 10 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:13,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:13,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 332 [2023-08-31 03:35:13,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:13,802 INFO L130 PetriNetUnfolder]: 1451/1990 cut-off events. [2023-08-31 03:35:13,802 INFO L131 PetriNetUnfolder]: For 463/465 co-relation queries the response was YES. [2023-08-31 03:35:13,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4634 conditions, 1990 events. 1451/1990 cut-off events. For 463/465 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8496 event pairs, 397 based on Foata normal form. 66/1680 useless extension candidates. Maximal degree in co-relation 4622. Up to 755 conditions per place. [2023-08-31 03:35:13,809 INFO L137 encePairwiseOnDemand]: 326/332 looper letters, 79 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2023-08-31 03:35:13,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 88 transitions, 438 flow [2023-08-31 03:35:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:35:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:35:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1206 transitions. [2023-08-31 03:35:13,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45406626506024095 [2023-08-31 03:35:13,812 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1206 transitions. [2023-08-31 03:35:13,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1206 transitions. [2023-08-31 03:35:13,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:13,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1206 transitions. [2023-08-31 03:35:13,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.75) internal successors, (1206), 8 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:13,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:13,819 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:13,819 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 100 flow. Second operand 8 states and 1206 transitions. [2023-08-31 03:35:13,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 88 transitions, 438 flow [2023-08-31 03:35:13,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 88 transitions, 434 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 03:35:13,821 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 142 flow [2023-08-31 03:35:13,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-31 03:35:13,822 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-31 03:35:13,822 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 142 flow [2023-08-31 03:35:13,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 144.2) internal successors, (1442), 10 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:13,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:13,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:13,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:14,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:14,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:14,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash -923273326, now seen corresponding path program 1 times [2023-08-31 03:35:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410616291] [2023-08-31 03:35:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:35:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:14,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:14,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 03:35:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:35:14,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 03:35:14,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:14,174 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 03:35:14,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:14,261 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 03:35:14,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:14,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410616291] [2023-08-31 03:35:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410616291] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:14,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-08-31 03:35:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610656647] [2023-08-31 03:35:14,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:14,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 03:35:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:14,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 03:35:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 03:35:14,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 332 [2023-08-31 03:35:14,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 142 flow. Second operand has 10 states, 10 states have (on average 147.7) internal successors, (1477), 10 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:14,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:14,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 332 [2023-08-31 03:35:14,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:14,967 INFO L130 PetriNetUnfolder]: 942/1371 cut-off events. [2023-08-31 03:35:14,967 INFO L131 PetriNetUnfolder]: For 621/674 co-relation queries the response was YES. [2023-08-31 03:35:14,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 1371 events. 942/1371 cut-off events. For 621/674 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6229 event pairs, 255 based on Foata normal form. 62/1210 useless extension candidates. Maximal degree in co-relation 2546. Up to 609 conditions per place. [2023-08-31 03:35:14,973 INFO L137 encePairwiseOnDemand]: 325/332 looper letters, 69 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2023-08-31 03:35:14,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 423 flow [2023-08-31 03:35:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:35:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:35:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1231 transitions. [2023-08-31 03:35:14,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634789156626506 [2023-08-31 03:35:14,976 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1231 transitions. [2023-08-31 03:35:14,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1231 transitions. [2023-08-31 03:35:14,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:14,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1231 transitions. [2023-08-31 03:35:14,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 153.875) internal successors, (1231), 8 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:14,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:14,982 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:14,982 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 142 flow. Second operand 8 states and 1231 transitions. [2023-08-31 03:35:14,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 423 flow [2023-08-31 03:35:14,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 415 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-31 03:35:14,991 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 165 flow [2023-08-31 03:35:14,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-31 03:35:14,991 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-08-31 03:35:14,992 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 165 flow [2023-08-31 03:35:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.7) internal successors, (1477), 10 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:14,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:14,992 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:14,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:15,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:15,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 487430474, now seen corresponding path program 2 times [2023-08-31 03:35:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083574041] [2023-08-31 03:35:15,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:35:15,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:15,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:15,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:15,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 03:35:15,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:35:15,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:15,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 03:35:15,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:35:15,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 03:35:15,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083574041] [2023-08-31 03:35:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083574041] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:15,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-08-31 03:35:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324595799] [2023-08-31 03:35:15,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:15,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 03:35:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 03:35:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-31 03:35:15,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 332 [2023-08-31 03:35:15,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 165 flow. Second operand has 11 states, 11 states have (on average 148.27272727272728) internal successors, (1631), 11 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:15,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:15,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 332 [2023-08-31 03:35:15,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:16,269 INFO L130 PetriNetUnfolder]: 1087/1535 cut-off events. [2023-08-31 03:35:16,270 INFO L131 PetriNetUnfolder]: For 1041/1079 co-relation queries the response was YES. [2023-08-31 03:35:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4431 conditions, 1535 events. 1087/1535 cut-off events. For 1041/1079 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6536 event pairs, 359 based on Foata normal form. 83/1432 useless extension candidates. Maximal degree in co-relation 3319. Up to 611 conditions per place. [2023-08-31 03:35:16,276 INFO L137 encePairwiseOnDemand]: 325/332 looper letters, 70 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-31 03:35:16,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 465 flow [2023-08-31 03:35:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 03:35:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 03:35:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2023-08-31 03:35:16,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46858864027538727 [2023-08-31 03:35:16,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2023-08-31 03:35:16,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2023-08-31 03:35:16,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:16,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2023-08-31 03:35:16,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:16,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:16,283 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:16,283 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 165 flow. Second operand 7 states and 1089 transitions. [2023-08-31 03:35:16,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 465 flow [2023-08-31 03:35:16,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 457 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 03:35:16,286 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 206 flow [2023-08-31 03:35:16,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-31 03:35:16,286 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-08-31 03:35:16,287 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 206 flow [2023-08-31 03:35:16,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 148.27272727272728) internal successors, (1631), 11 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:16,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:16,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:16,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:16,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:16,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:16,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 648224824, now seen corresponding path program 1 times [2023-08-31 03:35:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390634546] [2023-08-31 03:35:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 03:35:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:16,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:16,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:16,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 03:35:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:35:16,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 03:35:16,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:16,698 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 03:35:16,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:16,792 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 03:35:16,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:16,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390634546] [2023-08-31 03:35:16,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390634546] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:16,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:16,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2023-08-31 03:35:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726498670] [2023-08-31 03:35:16,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:16,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 03:35:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:16,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 03:35:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-31 03:35:17,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 332 [2023-08-31 03:35:17,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 206 flow. Second operand has 11 states, 11 states have (on average 145.72727272727272) internal successors, (1603), 11 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:17,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:17,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 332 [2023-08-31 03:35:17,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:18,058 INFO L130 PetriNetUnfolder]: 723/1035 cut-off events. [2023-08-31 03:35:18,058 INFO L131 PetriNetUnfolder]: For 1788/1955 co-relation queries the response was YES. [2023-08-31 03:35:18,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 1035 events. 723/1035 cut-off events. For 1788/1955 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4025 event pairs, 239 based on Foata normal form. 167/1115 useless extension candidates. Maximal degree in co-relation 3116. Up to 664 conditions per place. [2023-08-31 03:35:18,063 INFO L137 encePairwiseOnDemand]: 326/332 looper letters, 45 selfloop transitions, 5 changer transitions 25/77 dead transitions. [2023-08-31 03:35:18,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 494 flow [2023-08-31 03:35:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 03:35:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 03:35:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1207 transitions. [2023-08-31 03:35:18,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45444277108433734 [2023-08-31 03:35:18,066 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1207 transitions. [2023-08-31 03:35:18,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1207 transitions. [2023-08-31 03:35:18,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:18,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1207 transitions. [2023-08-31 03:35:18,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.875) internal successors, (1207), 8 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:18,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:18,071 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:18,071 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 206 flow. Second operand 8 states and 1207 transitions. [2023-08-31 03:35:18,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 494 flow [2023-08-31 03:35:18,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 481 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-31 03:35:18,075 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 181 flow [2023-08-31 03:35:18,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=181, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-08-31 03:35:18,077 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2023-08-31 03:35:18,077 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 181 flow [2023-08-31 03:35:18,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 145.72727272727272) internal successors, (1603), 11 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:18,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:18,078 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:18,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-08-31 03:35:18,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:18,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:18,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1168861496, now seen corresponding path program 2 times [2023-08-31 03:35:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087061971] [2023-08-31 03:35:18,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:35:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:18,287 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:18,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 03:35:18,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:35:18,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:18,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 03:35:18,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:35:18,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:19,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087061971] [2023-08-31 03:35:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087061971] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:19,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-08-31 03:35:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721686796] [2023-08-31 03:35:19,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:19,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:35:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:35:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:35:20,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 332 [2023-08-31 03:35:20,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 36 transitions, 181 flow. Second operand has 20 states, 20 states have (on average 138.15) internal successors, (2763), 20 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:20,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:20,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 332 [2023-08-31 03:35:20,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:23,598 INFO L130 PetriNetUnfolder]: 2526/3564 cut-off events. [2023-08-31 03:35:23,598 INFO L131 PetriNetUnfolder]: For 4265/4265 co-relation queries the response was YES. [2023-08-31 03:35:23,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11983 conditions, 3564 events. 2526/3564 cut-off events. For 4265/4265 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15598 event pairs, 131 based on Foata normal form. 160/3724 useless extension candidates. Maximal degree in co-relation 10115. Up to 1127 conditions per place. [2023-08-31 03:35:23,617 INFO L137 encePairwiseOnDemand]: 314/332 looper letters, 280 selfloop transitions, 110 changer transitions 0/390 dead transitions. [2023-08-31 03:35:23,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 390 transitions, 2377 flow [2023-08-31 03:35:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-31 03:35:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-31 03:35:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4866 transitions. [2023-08-31 03:35:23,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44414019715224534 [2023-08-31 03:35:23,629 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4866 transitions. [2023-08-31 03:35:23,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4866 transitions. [2023-08-31 03:35:23,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:23,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4866 transitions. [2023-08-31 03:35:23,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 147.45454545454547) internal successors, (4866), 33 states have internal predecessors, (4866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:23,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 332.0) internal successors, (11288), 34 states have internal predecessors, (11288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:23,649 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 332.0) internal successors, (11288), 34 states have internal predecessors, (11288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:23,649 INFO L175 Difference]: Start difference. First operand has 60 places, 36 transitions, 181 flow. Second operand 33 states and 4866 transitions. [2023-08-31 03:35:23,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 390 transitions, 2377 flow [2023-08-31 03:35:23,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 390 transitions, 2077 flow, removed 94 selfloop flow, removed 13 redundant places. [2023-08-31 03:35:23,665 INFO L231 Difference]: Finished difference. Result has 94 places, 145 transitions, 1100 flow [2023-08-31 03:35:23,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1100, PETRI_PLACES=94, PETRI_TRANSITIONS=145} [2023-08-31 03:35:23,665 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2023-08-31 03:35:23,665 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 145 transitions, 1100 flow [2023-08-31 03:35:23,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 138.15) internal successors, (2763), 20 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:23,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:23,667 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:23,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-31 03:35:23,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:23,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:23,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1731904008, now seen corresponding path program 3 times [2023-08-31 03:35:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:23,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416548952] [2023-08-31 03:35:23,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 03:35:23,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:23,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:23,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:23,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 03:35:23,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 03:35:23,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:23,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 03:35:23,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:24,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 03:35:24,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416548952] [2023-08-31 03:35:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416548952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 03:35:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 03:35:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 03:35:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501555399] [2023-08-31 03:35:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:35:24,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 03:35:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 03:35:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-31 03:35:24,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 332 [2023-08-31 03:35:24,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 145 transitions, 1100 flow. Second operand has 9 states, 9 states have (on average 146.55555555555554) internal successors, (1319), 9 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:24,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:24,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 332 [2023-08-31 03:35:24,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:25,403 INFO L130 PetriNetUnfolder]: 3547/5057 cut-off events. [2023-08-31 03:35:25,404 INFO L131 PetriNetUnfolder]: For 23288/23288 co-relation queries the response was YES. [2023-08-31 03:35:25,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24385 conditions, 5057 events. 3547/5057 cut-off events. For 23288/23288 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23660 event pairs, 730 based on Foata normal form. 4/5061 useless extension candidates. Maximal degree in co-relation 19604. Up to 2416 conditions per place. [2023-08-31 03:35:25,447 INFO L137 encePairwiseOnDemand]: 321/332 looper letters, 260 selfloop transitions, 58 changer transitions 3/321 dead transitions. [2023-08-31 03:35:25,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 321 transitions, 3114 flow [2023-08-31 03:35:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 03:35:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 03:35:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1384 transitions. [2023-08-31 03:35:25,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46318607764390896 [2023-08-31 03:35:25,450 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1384 transitions. [2023-08-31 03:35:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1384 transitions. [2023-08-31 03:35:25,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:25,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1384 transitions. [2023-08-31 03:35:25,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:25,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 332.0) internal successors, (3320), 10 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:25,466 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 332.0) internal successors, (3320), 10 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:25,467 INFO L175 Difference]: Start difference. First operand has 94 places, 145 transitions, 1100 flow. Second operand 9 states and 1384 transitions. [2023-08-31 03:35:25,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 321 transitions, 3114 flow [2023-08-31 03:35:25,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 321 transitions, 2968 flow, removed 71 selfloop flow, removed 2 redundant places. [2023-08-31 03:35:25,532 INFO L231 Difference]: Finished difference. Result has 105 places, 177 transitions, 1520 flow [2023-08-31 03:35:25,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1520, PETRI_PLACES=105, PETRI_TRANSITIONS=177} [2023-08-31 03:35:25,534 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2023-08-31 03:35:25,534 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 177 transitions, 1520 flow [2023-08-31 03:35:25,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 146.55555555555554) internal successors, (1319), 9 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:25,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:25,535 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:25,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:25,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:25,741 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:25,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2110810464, now seen corresponding path program 4 times [2023-08-31 03:35:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22163066] [2023-08-31 03:35:25,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 03:35:25,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:25,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:25,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:25,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 03:35:25,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 03:35:25,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:25,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 03:35:25,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:35:26,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:26,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22163066] [2023-08-31 03:35:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22163066] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:26,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-08-31 03:35:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453811849] [2023-08-31 03:35:26,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:26,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:35:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:35:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:35:27,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 332 [2023-08-31 03:35:27,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 177 transitions, 1520 flow. Second operand has 20 states, 20 states have (on average 138.15) internal successors, (2763), 20 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:27,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:27,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 332 [2023-08-31 03:35:27,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:31,357 INFO L130 PetriNetUnfolder]: 4958/7036 cut-off events. [2023-08-31 03:35:31,357 INFO L131 PetriNetUnfolder]: For 44799/44799 co-relation queries the response was YES. [2023-08-31 03:35:31,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37828 conditions, 7036 events. 4958/7036 cut-off events. For 44799/44799 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34341 event pairs, 695 based on Foata normal form. 50/7086 useless extension candidates. Maximal degree in co-relation 37775. Up to 2303 conditions per place. [2023-08-31 03:35:31,404 INFO L137 encePairwiseOnDemand]: 318/332 looper letters, 353 selfloop transitions, 247 changer transitions 1/601 dead transitions. [2023-08-31 03:35:31,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 601 transitions, 6202 flow [2023-08-31 03:35:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-31 03:35:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-31 03:35:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4635 transitions. [2023-08-31 03:35:31,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43627635542168675 [2023-08-31 03:35:31,414 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4635 transitions. [2023-08-31 03:35:31,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4635 transitions. [2023-08-31 03:35:31,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:31,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4635 transitions. [2023-08-31 03:35:31,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 144.84375) internal successors, (4635), 32 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:31,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 332.0) internal successors, (10956), 33 states have internal predecessors, (10956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:31,435 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 332.0) internal successors, (10956), 33 states have internal predecessors, (10956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:31,435 INFO L175 Difference]: Start difference. First operand has 105 places, 177 transitions, 1520 flow. Second operand 32 states and 4635 transitions. [2023-08-31 03:35:31,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 601 transitions, 6202 flow [2023-08-31 03:35:31,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 601 transitions, 6026 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 03:35:31,541 INFO L231 Difference]: Finished difference. Result has 147 places, 346 transitions, 3881 flow [2023-08-31 03:35:31,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3881, PETRI_PLACES=147, PETRI_TRANSITIONS=346} [2023-08-31 03:35:31,542 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 115 predicate places. [2023-08-31 03:35:31,542 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 346 transitions, 3881 flow [2023-08-31 03:35:31,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 138.15) internal successors, (2763), 20 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:31,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:31,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:31,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:31,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:31,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:31,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -94619640, now seen corresponding path program 5 times [2023-08-31 03:35:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970184934] [2023-08-31 03:35:31,751 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 03:35:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:31,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:31,753 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:31,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 03:35:31,852 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:35:31,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:31,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-31 03:35:31,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:35:32,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:32,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:32,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970184934] [2023-08-31 03:35:32,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970184934] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:32,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:32,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-08-31 03:35:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852202771] [2023-08-31 03:35:32,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:32,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:35:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:35:32,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:35:33,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 332 [2023-08-31 03:35:33,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 346 transitions, 3881 flow. Second operand has 20 states, 20 states have (on average 137.25) internal successors, (2745), 20 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:33,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:33,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 332 [2023-08-31 03:35:33,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:37,911 INFO L130 PetriNetUnfolder]: 5136/7340 cut-off events. [2023-08-31 03:35:37,911 INFO L131 PetriNetUnfolder]: For 110734/110734 co-relation queries the response was YES. [2023-08-31 03:35:37,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49335 conditions, 7340 events. 5136/7340 cut-off events. For 110734/110734 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 37019 event pairs, 363 based on Foata normal form. 80/7420 useless extension candidates. Maximal degree in co-relation 49265. Up to 2435 conditions per place. [2023-08-31 03:35:37,962 INFO L137 encePairwiseOnDemand]: 316/332 looper letters, 549 selfloop transitions, 206 changer transitions 0/755 dead transitions. [2023-08-31 03:35:37,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 755 transitions, 10206 flow [2023-08-31 03:35:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-31 03:35:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-31 03:35:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4070 transitions. [2023-08-31 03:35:37,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43782271944922546 [2023-08-31 03:35:37,967 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4070 transitions. [2023-08-31 03:35:37,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4070 transitions. [2023-08-31 03:35:37,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:37,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4070 transitions. [2023-08-31 03:35:37,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 145.35714285714286) internal successors, (4070), 28 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:37,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 332.0) internal successors, (9628), 29 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:37,979 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 332.0) internal successors, (9628), 29 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:37,979 INFO L175 Difference]: Start difference. First operand has 147 places, 346 transitions, 3881 flow. Second operand 28 states and 4070 transitions. [2023-08-31 03:35:37,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 755 transitions, 10206 flow [2023-08-31 03:35:38,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 755 transitions, 8926 flow, removed 522 selfloop flow, removed 6 redundant places. [2023-08-31 03:35:38,326 INFO L231 Difference]: Finished difference. Result has 182 places, 425 transitions, 5076 flow [2023-08-31 03:35:38,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=3359, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5076, PETRI_PLACES=182, PETRI_TRANSITIONS=425} [2023-08-31 03:35:38,327 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2023-08-31 03:35:38,327 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 425 transitions, 5076 flow [2023-08-31 03:35:38,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 137.25) internal successors, (2745), 20 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:38,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:38,327 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:38,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-08-31 03:35:38,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:38,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:38,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash -437903970, now seen corresponding path program 6 times [2023-08-31 03:35:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791434288] [2023-08-31 03:35:38,536 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 03:35:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:38,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:38,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 03:35:38,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 03:35:38,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:38,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 03:35:38,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:35:39,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:39,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791434288] [2023-08-31 03:35:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791434288] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:39,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-08-31 03:35:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618677843] [2023-08-31 03:35:39,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:35:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:39,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:35:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:35:40,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 332 [2023-08-31 03:35:40,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 425 transitions, 5076 flow. Second operand has 20 states, 20 states have (on average 138.15) internal successors, (2763), 20 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:40,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:40,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 332 [2023-08-31 03:35:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:45,296 INFO L130 PetriNetUnfolder]: 6281/8985 cut-off events. [2023-08-31 03:35:45,296 INFO L131 PetriNetUnfolder]: For 128618/128618 co-relation queries the response was YES. [2023-08-31 03:35:45,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60380 conditions, 8985 events. 6281/8985 cut-off events. For 128618/128618 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 46699 event pairs, 314 based on Foata normal form. 20/9005 useless extension candidates. Maximal degree in co-relation 60297. Up to 2935 conditions per place. [2023-08-31 03:35:45,359 INFO L137 encePairwiseOnDemand]: 314/332 looper letters, 429 selfloop transitions, 462 changer transitions 0/891 dead transitions. [2023-08-31 03:35:45,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 891 transitions, 11873 flow [2023-08-31 03:35:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-31 03:35:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-31 03:35:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5275 transitions. [2023-08-31 03:35:45,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413487282463186 [2023-08-31 03:35:45,365 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5275 transitions. [2023-08-31 03:35:45,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5275 transitions. [2023-08-31 03:35:45,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:45,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5275 transitions. [2023-08-31 03:35:45,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 146.52777777777777) internal successors, (5275), 36 states have internal predecessors, (5275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:45,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 332.0) internal successors, (12284), 37 states have internal predecessors, (12284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:45,380 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 332.0) internal successors, (12284), 37 states have internal predecessors, (12284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:45,380 INFO L175 Difference]: Start difference. First operand has 182 places, 425 transitions, 5076 flow. Second operand 36 states and 5275 transitions. [2023-08-31 03:35:45,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 891 transitions, 11873 flow [2023-08-31 03:35:45,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 891 transitions, 11130 flow, removed 253 selfloop flow, removed 10 redundant places. [2023-08-31 03:35:45,771 INFO L231 Difference]: Finished difference. Result has 229 places, 597 transitions, 8510 flow [2023-08-31 03:35:45,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=4768, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=8510, PETRI_PLACES=229, PETRI_TRANSITIONS=597} [2023-08-31 03:35:45,772 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 197 predicate places. [2023-08-31 03:35:45,772 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 597 transitions, 8510 flow [2023-08-31 03:35:45,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 138.15) internal successors, (2763), 20 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:45,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:45,773 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:45,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:45,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:45,974 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:45,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1030731116, now seen corresponding path program 7 times [2023-08-31 03:35:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406069404] [2023-08-31 03:35:45,975 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 03:35:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:45,976 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:45,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 03:35:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 03:35:46,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 03:35:46,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 03:35:46,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:46,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406069404] [2023-08-31 03:35:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406069404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 03:35:46,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 03:35:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2023-08-31 03:35:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577408457] [2023-08-31 03:35:46,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 03:35:46,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 03:35:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 03:35:46,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-08-31 03:35:47,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 332 [2023-08-31 03:35:47,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 597 transitions, 8510 flow. Second operand has 20 states, 20 states have (on average 138.25) internal successors, (2765), 20 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:47,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:47,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 332 [2023-08-31 03:35:47,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:50,846 INFO L130 PetriNetUnfolder]: 6173/8777 cut-off events. [2023-08-31 03:35:50,846 INFO L131 PetriNetUnfolder]: For 139328/139328 co-relation queries the response was YES. [2023-08-31 03:35:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63802 conditions, 8777 events. 6173/8777 cut-off events. For 139328/139328 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 45146 event pairs, 718 based on Foata normal form. 84/8861 useless extension candidates. Maximal degree in co-relation 63700. Up to 2907 conditions per place. [2023-08-31 03:35:50,920 INFO L137 encePairwiseOnDemand]: 318/332 looper letters, 497 selfloop transitions, 380 changer transitions 0/877 dead transitions. [2023-08-31 03:35:50,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 877 transitions, 13472 flow [2023-08-31 03:35:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-31 03:35:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-31 03:35:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3499 transitions. [2023-08-31 03:35:50,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391315261044177 [2023-08-31 03:35:50,925 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3499 transitions. [2023-08-31 03:35:50,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3499 transitions. [2023-08-31 03:35:50,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:50,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3499 transitions. [2023-08-31 03:35:50,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 145.79166666666666) internal successors, (3499), 24 states have internal predecessors, (3499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:50,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 332.0) internal successors, (8300), 25 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:50,933 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 332.0) internal successors, (8300), 25 states have internal predecessors, (8300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:50,933 INFO L175 Difference]: Start difference. First operand has 229 places, 597 transitions, 8510 flow. Second operand 24 states and 3499 transitions. [2023-08-31 03:35:50,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 877 transitions, 13472 flow [2023-08-31 03:35:51,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 877 transitions, 13052 flow, removed 85 selfloop flow, removed 13 redundant places. [2023-08-31 03:35:51,502 INFO L231 Difference]: Finished difference. Result has 239 places, 634 transitions, 9582 flow [2023-08-31 03:35:51,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=8136, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=9582, PETRI_PLACES=239, PETRI_TRANSITIONS=634} [2023-08-31 03:35:51,502 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2023-08-31 03:35:51,503 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 634 transitions, 9582 flow [2023-08-31 03:35:51,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 138.25) internal successors, (2765), 20 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:51,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 03:35:51,503 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 03:35:51,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 03:35:51,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:51,705 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-31 03:35:51,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 03:35:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1991563940, now seen corresponding path program 8 times [2023-08-31 03:35:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 03:35:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371340744] [2023-08-31 03:35:51,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 03:35:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 03:35:51,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 03:35:51,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 03:35:51,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 03:35:51,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 03:35:51,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 03:35:51,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 03:35:51,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 03:35:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:52,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 03:35:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 03:35:52,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 03:35:52,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371340744] [2023-08-31 03:35:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371340744] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 03:35:52,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-31 03:35:52,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2023-08-31 03:35:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645480898] [2023-08-31 03:35:52,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 03:35:52,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 03:35:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 03:35:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 03:35:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-08-31 03:35:52,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 332 [2023-08-31 03:35:52,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 634 transitions, 9582 flow. Second operand has 7 states, 7 states have (on average 144.28571428571428) internal successors, (1010), 7 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:52,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 03:35:52,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 332 [2023-08-31 03:35:52,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 03:35:54,920 INFO L130 PetriNetUnfolder]: 7872/11146 cut-off events. [2023-08-31 03:35:54,920 INFO L131 PetriNetUnfolder]: For 185662/185662 co-relation queries the response was YES. [2023-08-31 03:35:54,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82909 conditions, 11146 events. 7872/11146 cut-off events. For 185662/185662 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 58927 event pairs, 535 based on Foata normal form. 46/11192 useless extension candidates. Maximal degree in co-relation 82807. Up to 4987 conditions per place. [2023-08-31 03:35:55,010 INFO L137 encePairwiseOnDemand]: 320/332 looper letters, 448 selfloop transitions, 535 changer transitions 0/983 dead transitions. [2023-08-31 03:35:55,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 983 transitions, 15999 flow [2023-08-31 03:35:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 03:35:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 03:35:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1685 transitions. [2023-08-31 03:35:55,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46139101861993426 [2023-08-31 03:35:55,013 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1685 transitions. [2023-08-31 03:35:55,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1685 transitions. [2023-08-31 03:35:55,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 03:35:55,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1685 transitions. [2023-08-31 03:35:55,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 153.1818181818182) internal successors, (1685), 11 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:55,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 332.0) internal successors, (3984), 12 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:55,017 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 332.0) internal successors, (3984), 12 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 03:35:55,017 INFO L175 Difference]: Start difference. First operand has 239 places, 634 transitions, 9582 flow. Second operand 11 states and 1685 transitions. [2023-08-31 03:35:55,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 983 transitions, 15999 flow Killed by 15