./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.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/parallel-parallel-sum-1-dsl.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 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 01:57:17,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 01:57:17,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 01:57:17,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 01:57:17,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 01:57:17,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 01:57:17,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 01:57:17,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 01:57:17,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 01:57:17,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 01:57:17,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 01:57:17,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 01:57:17,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 01:57:17,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 01:57:17,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 01:57:17,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 01:57:17,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 01:57:17,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 01:57:17,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 01:57:17,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 01:57:17,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 01:57:17,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 01:57:17,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 01:57:17,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 01:57:17,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 01:57:17,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 01:57:17,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 01:57:17,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 01:57:17,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 01:57:17,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 01:57:17,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 01:57:17,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 01:57:17,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 01:57:17,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 01:57:17,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 01:57:17,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 01:57:17,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 01:57:17,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 01:57:17,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 01:57:17,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 01:57:17,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 01:57:17,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 01:57:17,967 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 01:57:17,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 01:57:17,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 01:57:17,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 01:57:17,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 01:57:17,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 01:57:17,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 01:57:17,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 01:57:17,970 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 01:57:17,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 01:57:17,971 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 01:57:17,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 01:57:17,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 01:57:17,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 01:57:17,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 01:57:17,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 01:57:17,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 01:57:17,972 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 01:57:17,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 01:57:17,972 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 01:57:17,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 01:57:17,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 01:57:17,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 01:57:17,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 01:57:17,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 01:57:17,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 01:57:17,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 01:57:17,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 01:57:17,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 01:57:17,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 01:57:17,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 01:57:17,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 01:57:17,974 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 01:57:17,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 01:57:17,974 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 01:57:17,975 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 -> 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 01:57:18,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 01:57:18,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 01:57:18,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 01:57:18,203 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 01:57:18,203 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 01:57:18,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-31 01:57:19,151 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 01:57:19,295 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 01:57:19,296 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-31 01:57:19,315 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5612adfc/38e1173cc637463ba1bd4a2b0601b137/FLAGf8e734c62 [2023-08-31 01:57:19,332 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5612adfc/38e1173cc637463ba1bd4a2b0601b137 [2023-08-31 01:57:19,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 01:57:19,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 01:57:19,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 01:57:19,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 01:57:19,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 01:57:19,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173671f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19, skipping insertion in model container [2023-08-31 01:57:19,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 01:57:19,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 01:57:19,528 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/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-31 01:57:19,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 01:57:19,549 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 01:57:19,579 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/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-31 01:57:19,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 01:57:19,593 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 01:57:19,594 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 01:57:19,599 INFO L208 MainTranslator]: Completed translation [2023-08-31 01:57:19,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19 WrapperNode [2023-08-31 01:57:19,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 01:57:19,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 01:57:19,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 01:57:19,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 01:57:19,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,650 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-08-31 01:57:19,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 01:57:19,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 01:57:19,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 01:57:19,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 01:57:19,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,685 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 01:57:19,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 01:57:19,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 01:57:19,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 01:57:19,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (1/1) ... [2023-08-31 01:57:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 01:57:19,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:57:19,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 01:57:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 01:57:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 01:57:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 01:57:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 01:57:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 01:57:19,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 01:57:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 01:57:19,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 01:57:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 01:57:19,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 01:57:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-31 01:57:19,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-31 01:57:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 01:57:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-31 01:57:19,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-31 01:57:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-31 01:57:19,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-31 01:57:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 01:57:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 01:57:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 01:57:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 01:57:19,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 01:57:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 01:57:19,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 01:57:19,745 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 01:57:19,880 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 01:57:19,881 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 01:57:20,192 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 01:57:20,343 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 01:57:20,343 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-31 01:57:20,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:57:20 BoogieIcfgContainer [2023-08-31 01:57:20,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 01:57:20,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 01:57:20,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 01:57:20,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 01:57:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 01:57:19" (1/3) ... [2023-08-31 01:57:20,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe475c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 01:57:20, skipping insertion in model container [2023-08-31 01:57:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:57:19" (2/3) ... [2023-08-31 01:57:20,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe475c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 01:57:20, skipping insertion in model container [2023-08-31 01:57:20,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:57:20" (3/3) ... [2023-08-31 01:57:20,352 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-08-31 01:57:20,357 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 01:57:20,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 01:57:20,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 01:57:20,363 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 01:57:20,451 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-31 01:57:20,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 596 flow [2023-08-31 01:57:20,565 INFO L130 PetriNetUnfolder]: 18/234 cut-off events. [2023-08-31 01:57:20,565 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 01:57:20,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 234 events. 18/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 313 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-08-31 01:57:20,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 596 flow [2023-08-31 01:57:20,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 226 transitions, 500 flow [2023-08-31 01:57:20,579 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 01:57:20,588 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 226 transitions, 500 flow [2023-08-31 01:57:20,590 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 226 transitions, 500 flow [2023-08-31 01:57:20,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 226 transitions, 500 flow [2023-08-31 01:57:20,646 INFO L130 PetriNetUnfolder]: 18/226 cut-off events. [2023-08-31 01:57:20,647 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 01:57:20,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 226 events. 18/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 312 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-08-31 01:57:20,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-08-31 01:57:25,632 INFO L134 LiptonReduction]: Checked pairs total: 33320 [2023-08-31 01:57:25,632 INFO L136 LiptonReduction]: Total number of compositions: 192 [2023-08-31 01:57:25,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 01:57:25,645 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;@524b1ca8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 01:57:25,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-31 01:57:25,652 INFO L130 PetriNetUnfolder]: 9/64 cut-off events. [2023-08-31 01:57:25,652 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 01:57:25,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:25,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:25,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:25,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash -266416520, now seen corresponding path program 1 times [2023-08-31 01:57:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904604483] [2023-08-31 01:57:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:26,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:26,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904604483] [2023-08-31 01:57:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904604483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:57:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:57:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 01:57:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151583185] [2023-08-31 01:57:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:57:26,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:57:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:57:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:57:26,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 458 [2023-08-31 01:57:26,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:26,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:26,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 458 [2023-08-31 01:57:26,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:28,730 INFO L130 PetriNetUnfolder]: 24447/32779 cut-off events. [2023-08-31 01:57:28,731 INFO L131 PetriNetUnfolder]: For 5201/5216 co-relation queries the response was YES. [2023-08-31 01:57:28,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69555 conditions, 32779 events. 24447/32779 cut-off events. For 5201/5216 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 171485 event pairs, 10465 based on Foata normal form. 4/25142 useless extension candidates. Maximal degree in co-relation 68091. Up to 12303 conditions per place. [2023-08-31 01:57:28,921 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-08-31 01:57:28,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-08-31 01:57:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 01:57:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 01:57:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2023-08-31 01:57:28,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322052401746725 [2023-08-31 01:57:28,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2023-08-31 01:57:28,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2023-08-31 01:57:28,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:28,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2023-08-31 01:57:28,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:28,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:28,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:28,952 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 975 transitions. [2023-08-31 01:57:28,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-08-31 01:57:29,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-31 01:57:29,057 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-08-31 01:57:29,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-08-31 01:57:29,061 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-08-31 01:57:29,061 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-08-31 01:57:29,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:29,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:29,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:29,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 01:57:29,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:29,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash -549139452, now seen corresponding path program 2 times [2023-08-31 01:57:29,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:29,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900024396] [2023-08-31 01:57:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900024396] [2023-08-31 01:57:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900024396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:57:29,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:57:29,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 01:57:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835320784] [2023-08-31 01:57:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:57:29,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:57:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:29,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:57:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:57:29,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 458 [2023-08-31 01:57:29,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:29,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:29,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 458 [2023-08-31 01:57:29,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:32,470 INFO L130 PetriNetUnfolder]: 40211/54287 cut-off events. [2023-08-31 01:57:32,471 INFO L131 PetriNetUnfolder]: For 11968/11968 co-relation queries the response was YES. [2023-08-31 01:57:32,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120541 conditions, 54287 events. 40211/54287 cut-off events. For 11968/11968 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 304734 event pairs, 15979 based on Foata normal form. 1/41699 useless extension candidates. Maximal degree in co-relation 43207. Up to 22845 conditions per place. [2023-08-31 01:57:32,736 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-08-31 01:57:32,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-08-31 01:57:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 01:57:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 01:57:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2023-08-31 01:57:32,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5332969432314411 [2023-08-31 01:57:32,742 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2023-08-31 01:57:32,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2023-08-31 01:57:32,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:32,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2023-08-31 01:57:32,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:32,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:32,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:32,748 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 977 transitions. [2023-08-31 01:57:32,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-08-31 01:57:32,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 01:57:32,756 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-08-31 01:57:32,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-08-31 01:57:32,757 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-08-31 01:57:32,757 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-08-31 01:57:32,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:32,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:32,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:32,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 01:57:32,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:32,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1731748126, now seen corresponding path program 1 times [2023-08-31 01:57:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:32,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497680792] [2023-08-31 01:57:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:33,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497680792] [2023-08-31 01:57:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497680792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:57:33,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:57:33,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 01:57:33,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677570777] [2023-08-31 01:57:33,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:57:33,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 01:57:33,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:33,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 01:57:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 01:57:33,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 458 [2023-08-31 01:57:33,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:33,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:33,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 458 [2023-08-31 01:57:33,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:37,366 INFO L130 PetriNetUnfolder]: 52244/70746 cut-off events. [2023-08-31 01:57:37,366 INFO L131 PetriNetUnfolder]: For 34959/34959 co-relation queries the response was YES. [2023-08-31 01:57:37,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169029 conditions, 70746 events. 52244/70746 cut-off events. For 34959/34959 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 414211 event pairs, 34723 based on Foata normal form. 0/54996 useless extension candidates. Maximal degree in co-relation 71207. Up to 50266 conditions per place. [2023-08-31 01:57:37,694 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-08-31 01:57:37,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-08-31 01:57:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:57:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:57:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1157 transitions. [2023-08-31 01:57:37,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505240174672489 [2023-08-31 01:57:37,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1157 transitions. [2023-08-31 01:57:37,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1157 transitions. [2023-08-31 01:57:37,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:37,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1157 transitions. [2023-08-31 01:57:37,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:37,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:37,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:37,712 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1157 transitions. [2023-08-31 01:57:37,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-08-31 01:57:37,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-31 01:57:37,734 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-08-31 01:57:37,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-08-31 01:57:37,735 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-08-31 01:57:37,738 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-08-31 01:57:37,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:37,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:37,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:37,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 01:57:37,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:37,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1011656969, now seen corresponding path program 1 times [2023-08-31 01:57:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341864455] [2023-08-31 01:57:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341864455] [2023-08-31 01:57:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341864455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:57:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:57:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 01:57:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289422114] [2023-08-31 01:57:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:57:38,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 01:57:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:38,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 01:57:38,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 01:57:38,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 458 [2023-08-31 01:57:38,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:38,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:38,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 458 [2023-08-31 01:57:38,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:41,955 INFO L130 PetriNetUnfolder]: 43919/59576 cut-off events. [2023-08-31 01:57:41,956 INFO L131 PetriNetUnfolder]: For 33750/33750 co-relation queries the response was YES. [2023-08-31 01:57:42,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146471 conditions, 59576 events. 43919/59576 cut-off events. For 33750/33750 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 341974 event pairs, 30832 based on Foata normal form. 0/50903 useless extension candidates. Maximal degree in co-relation 134447. Up to 50266 conditions per place. [2023-08-31 01:57:42,193 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-08-31 01:57:42,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-08-31 01:57:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:57:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:57:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2023-08-31 01:57:42,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013100436681223 [2023-08-31 01:57:42,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2023-08-31 01:57:42,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2023-08-31 01:57:42,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:42,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2023-08-31 01:57:42,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.6) internal successors, (1148), 5 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:42,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:42,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:42,202 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1148 transitions. [2023-08-31 01:57:42,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-08-31 01:57:42,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 01:57:42,213 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-08-31 01:57:42,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-08-31 01:57:42,214 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-08-31 01:57:42,214 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-08-31 01:57:42,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:42,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:42,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:42,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 01:57:42,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:42,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1272608977, now seen corresponding path program 1 times [2023-08-31 01:57:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647718232] [2023-08-31 01:57:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:42,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647718232] [2023-08-31 01:57:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647718232] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:57:42,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575913429] [2023-08-31 01:57:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:42,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:42,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:57:42,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:57:42,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 01:57:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:42,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 01:57:42,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:57:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:42,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:57:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575913429] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:57:42,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:57:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 01:57:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120634108] [2023-08-31 01:57:42,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:57:42,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 01:57:42,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 01:57:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-31 01:57:42,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-31 01:57:42,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:42,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:42,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-31 01:57:42,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:47,439 INFO L130 PetriNetUnfolder]: 50674/69621 cut-off events. [2023-08-31 01:57:47,439 INFO L131 PetriNetUnfolder]: For 48114/48114 co-relation queries the response was YES. [2023-08-31 01:57:47,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175548 conditions, 69621 events. 50674/69621 cut-off events. For 48114/48114 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 428541 event pairs, 15551 based on Foata normal form. 3638/69221 useless extension candidates. Maximal degree in co-relation 175527. Up to 28288 conditions per place. [2023-08-31 01:57:47,774 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-31 01:57:47,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-08-31 01:57:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 01:57:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 01:57:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1593 transitions. [2023-08-31 01:57:47,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968808484092327 [2023-08-31 01:57:47,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1593 transitions. [2023-08-31 01:57:47,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1593 transitions. [2023-08-31 01:57:47,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:47,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1593 transitions. [2023-08-31 01:57:47,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:47,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:47,784 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:47,784 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1593 transitions. [2023-08-31 01:57:47,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-08-31 01:57:47,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-31 01:57:47,808 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-08-31 01:57:47,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-31 01:57:47,808 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-08-31 01:57:47,809 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-08-31 01:57:47,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:47,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:47,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:47,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-31 01:57:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:48,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:48,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2079067074, now seen corresponding path program 1 times [2023-08-31 01:57:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507978122] [2023-08-31 01:57:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507978122] [2023-08-31 01:57:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507978122] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:57:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748130618] [2023-08-31 01:57:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:48,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:48,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:57:48,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:57:48,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 01:57:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:48,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 01:57:48,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:57:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:48,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:57:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:57:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748130618] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:57:48,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:57:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 01:57:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327427341] [2023-08-31 01:57:48,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:57:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 01:57:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 01:57:48,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-31 01:57:48,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-31 01:57:48,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:48,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:48,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-31 01:57:48,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:52,442 INFO L130 PetriNetUnfolder]: 40749/56313 cut-off events. [2023-08-31 01:57:52,443 INFO L131 PetriNetUnfolder]: For 64677/64677 co-relation queries the response was YES. [2023-08-31 01:57:52,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156646 conditions, 56313 events. 40749/56313 cut-off events. For 64677/64677 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 339564 event pairs, 12668 based on Foata normal form. 2458/55154 useless extension candidates. Maximal degree in co-relation 143767. Up to 26698 conditions per place. [2023-08-31 01:57:52,735 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-08-31 01:57:52,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-08-31 01:57:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 01:57:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 01:57:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1584 transitions. [2023-08-31 01:57:52,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940736119775421 [2023-08-31 01:57:52,739 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1584 transitions. [2023-08-31 01:57:52,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1584 transitions. [2023-08-31 01:57:52,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:52,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1584 transitions. [2023-08-31 01:57:52,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.28571428571428) internal successors, (1584), 7 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:52,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:52,745 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:52,745 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1584 transitions. [2023-08-31 01:57:52,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-08-31 01:57:52,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-31 01:57:52,761 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-08-31 01:57:52,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-08-31 01:57:52,762 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-08-31 01:57:52,762 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-08-31 01:57:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:52,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:52,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:52,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-31 01:57:52,968 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,SelfDestructingSolverStorable5 [2023-08-31 01:57:52,968 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:52,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -982059132, now seen corresponding path program 1 times [2023-08-31 01:57:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598258872] [2023-08-31 01:57:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:53,185 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 01:57:53,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:53,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598258872] [2023-08-31 01:57:53,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598258872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:57:53,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728672134] [2023-08-31 01:57:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:53,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:53,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:57:53,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:57:53,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 01:57:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:53,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 01:57:53,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:57:53,636 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 01:57:53,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:57:53,711 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 01:57:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728672134] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:57:53,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:57:53,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-08-31 01:57:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362253480] [2023-08-31 01:57:53,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:57:53,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 01:57:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 01:57:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-31 01:57:53,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-31 01:57:53,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 13 states, 13 states have (on average 213.6153846153846) internal successors, (2777), 13 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:53,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:53,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-31 01:57:53,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:56,498 INFO L130 PetriNetUnfolder]: 28494/38831 cut-off events. [2023-08-31 01:57:56,498 INFO L131 PetriNetUnfolder]: For 64304/64304 co-relation queries the response was YES. [2023-08-31 01:57:56,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122203 conditions, 38831 events. 28494/38831 cut-off events. For 64304/64304 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 213410 event pairs, 15424 based on Foata normal form. 1152/38010 useless extension candidates. Maximal degree in co-relation 122162. Up to 32677 conditions per place. [2023-08-31 01:57:56,688 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 89 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2023-08-31 01:57:56,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 693 flow [2023-08-31 01:57:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 01:57:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 01:57:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-08-31 01:57:56,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810771470160116 [2023-08-31 01:57:56,691 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-08-31 01:57:56,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-08-31 01:57:56,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:56,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-08-31 01:57:56,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:56,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:56,697 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:56,697 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 6 states and 1322 transitions. [2023-08-31 01:57:56,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 693 flow [2023-08-31 01:57:56,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-31 01:57:56,716 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 368 flow [2023-08-31 01:57:56,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2023-08-31 01:57:56,716 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 16 predicate places. [2023-08-31 01:57:56,716 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 368 flow [2023-08-31 01:57:56,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 213.6153846153846) internal successors, (2777), 13 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:56,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:56,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:56,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-31 01:57:56,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:56,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:56,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash -140044149, now seen corresponding path program 1 times [2023-08-31 01:57:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094512687] [2023-08-31 01:57:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:57:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:57,096 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 01:57:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:57:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094512687] [2023-08-31 01:57:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094512687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:57:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019125602] [2023-08-31 01:57:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:57,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:57,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:57:57,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:57:57,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 01:57:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:57:57,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 01:57:57,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:57:57,309 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 01:57:57,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:57:57,360 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 01:57:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019125602] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 01:57:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 01:57:57,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2023-08-31 01:57:57,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231913330] [2023-08-31 01:57:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:57:57,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 01:57:57,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:57:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 01:57:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-31 01:57:57,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-31 01:57:57,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:57,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:57:57,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-31 01:57:57,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:59,592 INFO L130 PetriNetUnfolder]: 21901/29265 cut-off events. [2023-08-31 01:57:59,593 INFO L131 PetriNetUnfolder]: For 41498/41498 co-relation queries the response was YES. [2023-08-31 01:57:59,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92241 conditions, 29265 events. 21901/29265 cut-off events. For 41498/41498 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 147207 event pairs, 10095 based on Foata normal form. 816/28638 useless extension candidates. Maximal degree in co-relation 92202. Up to 25062 conditions per place. [2023-08-31 01:57:59,721 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-08-31 01:57:59,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 714 flow [2023-08-31 01:57:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 01:57:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 01:57:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-08-31 01:57:59,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810771470160116 [2023-08-31 01:57:59,724 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-08-31 01:57:59,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-08-31 01:57:59,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:57:59,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-08-31 01:57:59,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:59,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:59,735 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:59,735 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 368 flow. Second operand 6 states and 1322 transitions. [2023-08-31 01:57:59,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 714 flow [2023-08-31 01:57:59,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 120 transitions, 689 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 01:57:59,753 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 384 flow [2023-08-31 01:57:59,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-08-31 01:57:59,755 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2023-08-31 01:57:59,756 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 384 flow [2023-08-31 01:57:59,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:57:59,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:57:59,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:57:59,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-31 01:57:59,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:57:59,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:57:59,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:57:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1310477910, now seen corresponding path program 1 times [2023-08-31 01:57:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:57:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145764061] [2023-08-31 01:57:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:57:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:58:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145764061] [2023-08-31 01:58:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145764061] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812332007] [2023-08-31 01:58:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:00,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:00,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:00,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 01:58:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:01,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-31 01:58:01,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:01,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:58:01,218 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 01:58:01,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:58:01,359 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 01:58:01,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:58:01,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 01:58:01,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-31 01:58:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:58:01,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:03,026 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-08-31 01:58:04,421 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-31 01:58:04,491 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-31 01:58:04,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:58:04,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 146 [2023-08-31 01:58:04,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2023-08-31 01:58:04,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-08-31 01:58:04,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-08-31 01:58:04,832 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 01:58:04,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 01:58:04,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 01:58:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:58:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812332007] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:58:04,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:58:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2023-08-31 01:58:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897932881] [2023-08-31 01:58:04,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:58:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-31 01:58:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:58:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-31 01:58:04,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=746, Unknown=25, NotChecked=174, Total=1056 [2023-08-31 01:58:05,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 458 [2023-08-31 01:58:05,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 384 flow. Second operand has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:05,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:58:05,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 458 [2023-08-31 01:58:05,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:58:14,818 INFO L130 PetriNetUnfolder]: 80622/105027 cut-off events. [2023-08-31 01:58:14,818 INFO L131 PetriNetUnfolder]: For 135851/135851 co-relation queries the response was YES. [2023-08-31 01:58:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327904 conditions, 105027 events. 80622/105027 cut-off events. For 135851/135851 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 573223 event pairs, 17446 based on Foata normal form. 1/101225 useless extension candidates. Maximal degree in co-relation 327864. Up to 45218 conditions per place. [2023-08-31 01:58:15,409 INFO L137 encePairwiseOnDemand]: 441/458 looper letters, 527 selfloop transitions, 117 changer transitions 1/655 dead transitions. [2023-08-31 01:58:15,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 655 transitions, 3884 flow [2023-08-31 01:58:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 01:58:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 01:58:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4427 transitions. [2023-08-31 01:58:15,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4202582115056009 [2023-08-31 01:58:15,416 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4427 transitions. [2023-08-31 01:58:15,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4427 transitions. [2023-08-31 01:58:15,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:58:15,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4427 transitions. [2023-08-31 01:58:15,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.47826086956522) internal successors, (4427), 23 states have internal predecessors, (4427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:15,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:15,431 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:15,432 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 384 flow. Second operand 23 states and 4427 transitions. [2023-08-31 01:58:15,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 655 transitions, 3884 flow [2023-08-31 01:58:15,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 655 transitions, 3864 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 01:58:15,512 INFO L231 Difference]: Finished difference. Result has 125 places, 217 transitions, 1483 flow [2023-08-31 01:58:15,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1483, PETRI_PLACES=125, PETRI_TRANSITIONS=217} [2023-08-31 01:58:15,512 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 50 predicate places. [2023-08-31 01:58:15,513 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 217 transitions, 1483 flow [2023-08-31 01:58:15,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:15,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:58:15,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:58:15,521 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 01:58:15,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:15,719 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 01:58:15,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:58:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 906209572, now seen corresponding path program 2 times [2023-08-31 01:58:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:58:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474243808] [2023-08-31 01:58:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:58:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474243808] [2023-08-31 01:58:16,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474243808] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174803018] [2023-08-31 01:58:16,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:58:16,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:16,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:16,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:16,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-31 01:58:16,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:58:16,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:58:16,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-31 01:58:16,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:16,806 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 01:58:16,834 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 01:58:16,873 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 01:58:16,982 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 01:58:17,040 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 01:58:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:58:17,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 01:58:17,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:58:17,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 01:58:17,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 01:58:17,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:58:17,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-08-31 01:58:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:58:17,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:17,628 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))))) is different from false [2023-08-31 01:58:29,922 WARN L222 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:58:43,280 WARN L222 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:00:51,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:51,079 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 71 treesize of output 60 [2023-08-31 02:00:51,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:51,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 758774 treesize of output 739326 [2023-08-31 02:00:51,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1306 [2023-08-31 02:00:51,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:51,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1306 treesize of output 1202 [2023-08-31 02:00:51,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1194 treesize of output 1130 [2023-08-31 02:00:51,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:51,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1130 treesize of output 914 [2023-08-31 02:00:51,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:51,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 420 [2023-08-31 02:00:51,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:51,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 466 treesize of output 419 [2023-08-31 02:00:53,208 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:00:53,213 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 73 treesize of output 1 [2023-08-31 02:00:55,380 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 02:00:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174803018] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:00:55,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:00:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 19] total 45 [2023-08-31 02:00:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968703293] [2023-08-31 02:00:55,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:00:55,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-08-31 02:00:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:00:55,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-08-31 02:00:55,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1739, Unknown=115, NotChecked=88, Total=2162 [2023-08-31 02:00:55,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 458 [2023-08-31 02:00:55,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 217 transitions, 1483 flow. Second operand has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:00:55,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:00:55,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 458 [2023-08-31 02:00:55,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:01:19,896 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:01:22,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:24,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:26,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:28,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:30,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:32,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:34,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:50,350 WARN L222 SmtUtils]: Spent 6.03s 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 02:01:52,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:54,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:56,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:01:58,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:00,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:24,140 WARN L222 SmtUtils]: Spent 19.08s on a formula simplification. DAG size of input: 68 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:02:26,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:28,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:30,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:32,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:34,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:36,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:38,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:40,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:42,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:44,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:02:46,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:03:02,826 WARN L222 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 96 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:03:22,065 WARN L222 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:03:44,568 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:04:05,090 WARN L222 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 83 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:04:07,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:09,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:11,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:13,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:15,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:17,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:19,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:22,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:04:34,112 WARN L222 SmtUtils]: Spent 10.65s on a formula simplification. DAG size of input: 73 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:04:53,149 WARN L222 SmtUtils]: Spent 18.50s on a formula simplification. DAG size of input: 104 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:04:57,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:05:13,677 WARN L222 SmtUtils]: Spent 14.28s on a formula simplification. DAG size of input: 71 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:05:16,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:05:19,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 02:05:19,860 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse0 (< c_~i_3~0 c_~n_1~0)) (.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2)))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-31 02:05:19,886 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2))) (.cse1 (+ c_~X_0~0.offset 4)) (.cse0 (< c_~i_3~0 c_~n_1~0))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (or (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|)))) .cse0) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-31 02:05:48,088 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:05:50,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:05:52,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:05:54,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:05:56,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:05:58,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:00,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:02,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:35,106 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:06:37,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:40,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:42,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:44,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:46,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:48,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:50,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:52,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:54,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:56,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:06:58,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:00,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:02,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:04,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:07,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:09,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:11,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:13,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:15,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:17,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:19,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:21,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:23,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:25,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:27,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:29,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:32,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:34,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:36,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:38,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:40,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:42,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:45,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:47,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:49,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:51,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:54,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:56,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:07:58,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:00,054 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 02:08:02,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:04,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:07,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:09,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:11,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:13,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:15,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:17,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:19,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:23,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:25,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:27,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:31,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:33,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:35,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:38,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:41,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:43,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:48,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 02:08:53,985 INFO L130 PetriNetUnfolder]: 151903/197867 cut-off events. [2023-08-31 02:08:53,986 INFO L131 PetriNetUnfolder]: For 595510/595808 co-relation queries the response was YES. [2023-08-31 02:08:54,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749039 conditions, 197867 events. 151903/197867 cut-off events. For 595510/595808 co-relation queries the response was YES. Maximal size of possible extension queue 4136. Compared 1168321 event pairs, 18815 based on Foata normal form. 292/190398 useless extension candidates. Maximal degree in co-relation 748987. Up to 94754 conditions per place. [2023-08-31 02:08:55,778 INFO L137 encePairwiseOnDemand]: 424/458 looper letters, 1026 selfloop transitions, 359 changer transitions 31/1426 dead transitions. [2023-08-31 02:08:55,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1426 transitions, 10576 flow [2023-08-31 02:08:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-31 02:08:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-31 02:08:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 9189 transitions. [2023-08-31 02:08:55,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715429403202329 [2023-08-31 02:08:55,791 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 9189 transitions. [2023-08-31 02:08:55,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 9189 transitions. [2023-08-31 02:08:55,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:08:55,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 9189 transitions. [2023-08-31 02:08:55,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 170.16666666666666) internal successors, (9189), 54 states have internal predecessors, (9189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:08:55,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 458.0) internal successors, (25190), 55 states have internal predecessors, (25190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:08:55,823 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 458.0) internal successors, (25190), 55 states have internal predecessors, (25190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:08:55,823 INFO L175 Difference]: Start difference. First operand has 125 places, 217 transitions, 1483 flow. Second operand 54 states and 9189 transitions. [2023-08-31 02:08:55,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 1426 transitions, 10576 flow [2023-08-31 02:09:02,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1426 transitions, 10483 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-08-31 02:09:02,981 INFO L231 Difference]: Finished difference. Result has 218 places, 562 transitions, 5583 flow [2023-08-31 02:09:02,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=5583, PETRI_PLACES=218, PETRI_TRANSITIONS=562} [2023-08-31 02:09:02,982 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 143 predicate places. [2023-08-31 02:09:02,982 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 562 transitions, 5583 flow [2023-08-31 02:09:02,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:09:02,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:09:02,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:09:02,988 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 02:09:03,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:09:03,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-31 02:09:03,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:09:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash 35489382, now seen corresponding path program 3 times [2023-08-31 02:09:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:09:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116165138] [2023-08-31 02:09:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:09:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:09:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:09:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:09:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:09:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116165138] [2023-08-31 02:09:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116165138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:09:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323239500] [2023-08-31 02:09:04,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:09:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:09:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:09:04,531 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 02:09:04,533 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 02:09:04,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 02:09:04,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:09:04,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-31 02:09:04,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:09:05,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:09:05,219 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 02:09:05,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:09:05,293 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 02:09:05,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:09:05,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-08-31 02:09:05,454 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 02:09:05,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:11:01,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:11:01,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 156 [2023-08-31 02:11:01,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-08-31 02:11:01,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-08-31 02:11:01,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 02:11:01,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 02:11:01,296 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-31 02:11:01,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2023-08-31 02:11:05,689 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 02:11:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323239500] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:11:05,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:11:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-08-31 02:11:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717611301] [2023-08-31 02:11:05,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:11:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-31 02:11:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:11:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-31 02:11:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1735, Unknown=86, NotChecked=0, Total=1980 [2023-08-31 02:11:07,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 458 [2023-08-31 02:11:07,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 562 transitions, 5583 flow. Second operand has 45 states, 45 states have (on average 148.73333333333332) internal successors, (6693), 45 states have internal predecessors, (6693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:11:07,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:11:07,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 458 [2023-08-31 02:11:07,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15