/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:17:19,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:17:19,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:17:19,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:17:19,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:17:19,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:17:19,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:17:19,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:17:19,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:17:19,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:17:19,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:17:19,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:17:19,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:17:19,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:17:19,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:17:19,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:17:19,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:17:19,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:17:19,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:17:19,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:17:19,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:17:19,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:17:19,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:17:19,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:17:19,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:17:19,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:17:19,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:17:19,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:17:19,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:17:19,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:17:19,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:17:19,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:17:19,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:17:19,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:17:19,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:17:19,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:17:19,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:17:19,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:17:19,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:17:19,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:17:19,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:17:19,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:17:19,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:17:19,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:17:19,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:17:19,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:17:19,940 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:17:19,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:17:19,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:17:19,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:17:19,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:17:19,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:17:19,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:17:19,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:17:19,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:17:19,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:17:19,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:17:19,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:17:19,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:17:19,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:17:19,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:17:19,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:17:19,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:17:19,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:17:19,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 01:17:20,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:17:20,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:17:20,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:17:20,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:17:20,210 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:17:20,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-13 01:17:21,239 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:17:21,392 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:17:21,392 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-13 01:17:21,408 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d710cad/36b44a757e984103ad79ab434a62df73/FLAG50e6c6139 [2022-12-13 01:17:21,419 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d710cad/36b44a757e984103ad79ab434a62df73 [2022-12-13 01:17:21,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:17:21,422 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:17:21,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:17:21,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:17:21,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:17:21,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3d114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21, skipping insertion in model container [2022-12-13 01:17:21,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:17:21,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:17:21,545 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c[2669,2682] [2022-12-13 01:17:21,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:17:21,555 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:17:21,569 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c[2669,2682] [2022-12-13 01:17:21,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:17:21,578 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:17:21,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21 WrapperNode [2022-12-13 01:17:21,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:17:21,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:17:21,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:17:21,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:17:21,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,601 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-13 01:17:21,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:17:21,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:17:21,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:17:21,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:17:21,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,617 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:17:21,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:17:21,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:17:21,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:17:21,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (1/1) ... [2022-12-13 01:17:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:17:21,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:17:21,651 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) [2022-12-13 01:17:21,663 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 [2022-12-13 01:17:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:17:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:17:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:17:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:17:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:17:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:17:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 01:17:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:17:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:17:21,686 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:17:21,764 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:17:21,765 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:17:22,033 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:17:22,039 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:17:22,039 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 01:17:22,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:17:22 BoogieIcfgContainer [2022-12-13 01:17:22,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:17:22,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:17:22,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:17:22,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:17:22,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:17:21" (1/3) ... [2022-12-13 01:17:22,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7f1d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:17:22, skipping insertion in model container [2022-12-13 01:17:22,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:17:21" (2/3) ... [2022-12-13 01:17:22,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7f1d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:17:22, skipping insertion in model container [2022-12-13 01:17:22,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:17:22" (3/3) ... [2022-12-13 01:17:22,046 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2022-12-13 01:17:22,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:17:22,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:17:22,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:17:22,160 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 01:17:22,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 142 transitions, 316 flow [2022-12-13 01:17:22,266 INFO L130 PetriNetUnfolder]: 10/138 cut-off events. [2022-12-13 01:17:22,266 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:17:22,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 138 events. 10/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 01:17:22,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 142 transitions, 316 flow [2022-12-13 01:17:22,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 126 transitions, 276 flow [2022-12-13 01:17:22,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:22,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-13 01:17:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 126 transitions, 276 flow [2022-12-13 01:17:22,324 INFO L130 PetriNetUnfolder]: 10/126 cut-off events. [2022-12-13 01:17:22,324 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:17:22,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 10/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 01:17:22,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-13 01:17:22,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 3312 [2022-12-13 01:17:26,639 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 01:17:26,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:17:26,653 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@54b726bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:17:26,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 01:17:26,657 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 01:17:26,657 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:17:26,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:26,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:17:26,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1738926514, now seen corresponding path program 1 times [2022-12-13 01:17:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:26,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060382918] [2022-12-13 01:17:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:27,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060382918] [2022-12-13 01:17:27,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060382918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:17:27,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:17:27,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:17:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662302450] [2022-12-13 01:17:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:17:27,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:17:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:17:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:17:27,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:27,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:27,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:27,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:27,399 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-13 01:17:27,399 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 01:17:27,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1759 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-13 01:17:27,404 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-13 01:17:27,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-13 01:17:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:17:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:17:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 01:17:27,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 01:17:27,415 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-13 01:17:27,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-13 01:17:27,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 01:17:27,422 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-13 01:17:27,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-13 01:17:27,427 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-13 01:17:27,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:27,427 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-13 01:17:27,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:27,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:27,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-13 01:17:27,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-13 01:17:27,435 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0][19], [17#L80-1true, 26#L109-4true, 29#L52-1true, Black: 150#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 148#true, 19#L38-1true, 117#L66-1true]) [2022-12-13 01:17:27,435 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,435 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,435 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,435 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,437 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-13 01:17:27,438 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:17:27,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 55 events. 19/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-13 01:17:27,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-13 01:17:27,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 01:17:27,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:17:27,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 01:17:27,444 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-13 01:17:27,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:27,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:27,455 INFO L214 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] [2022-12-13 01:17:27,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:17:27,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1759079634, now seen corresponding path program 1 times [2022-12-13 01:17:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170509147] [2022-12-13 01:17:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:27,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:27,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170509147] [2022-12-13 01:17:27,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170509147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:17:27,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:17:27,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:17:27,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409084966] [2022-12-13 01:17:27,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:17:27,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:17:27,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:17:27,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:17:27,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:27,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:27,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:27,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:27,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:27,786 INFO L130 PetriNetUnfolder]: 461/641 cut-off events. [2022-12-13 01:17:27,787 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-13 01:17:27,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1784 event pairs, 37 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2022-12-13 01:17:27,789 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2022-12-13 01:17:27,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2022-12-13 01:17:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:17:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:17:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 01:17:27,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-13 01:17:27,790 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 62 transitions. [2022-12-13 01:17:27,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2022-12-13 01:17:27,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:17:27,792 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2022-12-13 01:17:27,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-13 01:17:27,792 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 01:17:27,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:27,792 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 127 flow [2022-12-13 01:17:27,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:27,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:27,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-13 01:17:27,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 127 flow [2022-12-13 01:17:27,796 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0][24], [17#L80-1true, 26#L109-4true, 29#L52-1true, Black: 150#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 117#L66-1true, 19#L38-1true, 152#true, Black: 154#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0))]) [2022-12-13 01:17:27,796 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,796 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,796 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,796 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:17:27,799 INFO L130 PetriNetUnfolder]: 39/88 cut-off events. [2022-12-13 01:17:27,799 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 01:17:27,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 88 events. 39/88 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 124. Up to 38 conditions per place. [2022-12-13 01:17:27,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-13 01:17:27,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 01:17:27,800 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:17:27,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 01:17:27,801 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-13 01:17:27,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:27,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:27,801 INFO L214 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] [2022-12-13 01:17:27,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:17:27,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:27,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1996982626, now seen corresponding path program 2 times [2022-12-13 01:17:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:27,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048204051] [2022-12-13 01:17:27,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:27,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:27,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048204051] [2022-12-13 01:17:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048204051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:17:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487079667] [2022-12-13 01:17:27,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:17:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:27,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:17:27,937 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) [2022-12-13 01:17:27,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:17:28,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:17:28,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:17:28,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:17:28,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:17:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:28,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:17:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:28,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487079667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:17:28,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:17:28,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-13 01:17:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554708426] [2022-12-13 01:17:28,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:17:28,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:17:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:17:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:17:28,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:28,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:28,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:28,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:28,642 INFO L130 PetriNetUnfolder]: 893/1233 cut-off events. [2022-12-13 01:17:28,642 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-13 01:17:28,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1233 events. 893/1233 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3908 event pairs, 231 based on Foata normal form. 36/1269 useless extension candidates. Maximal degree in co-relation 745. Up to 523 conditions per place. [2022-12-13 01:17:28,647 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 80 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2022-12-13 01:17:28,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 88 transitions, 461 flow [2022-12-13 01:17:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:17:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:17:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 01:17:28,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.656 [2022-12-13 01:17:28,648 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 5 states and 82 transitions. [2022-12-13 01:17:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 88 transitions, 461 flow [2022-12-13 01:17:28,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 88 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:17:28,650 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 170 flow [2022-12-13 01:17:28,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2022-12-13 01:17:28,651 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-13 01:17:28,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:28,651 INFO L89 Accepts]: Start accepts. Operand has 37 places, 38 transitions, 170 flow [2022-12-13 01:17:28,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:28,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:28,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 38 transitions, 170 flow [2022-12-13 01:17:28,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 38 transitions, 170 flow [2022-12-13 01:17:28,659 INFO L130 PetriNetUnfolder]: 63/140 cut-off events. [2022-12-13 01:17:28,659 INFO L131 PetriNetUnfolder]: For 56/58 co-relation queries the response was YES. [2022-12-13 01:17:28,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 140 events. 63/140 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 384 event pairs, 1 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 256. Up to 71 conditions per place. [2022-12-13 01:17:28,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 38 transitions, 170 flow [2022-12-13 01:17:28,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 01:17:28,661 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:17:28,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 01:17:28,662 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 170 flow [2022-12-13 01:17:28,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:28,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:28,662 INFO L214 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] [2022-12-13 01:17:28,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 01:17:28,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:28,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1421591896, now seen corresponding path program 1 times [2022-12-13 01:17:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000715441] [2022-12-13 01:17:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:28,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000715441] [2022-12-13 01:17:28,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000715441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:17:28,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752999115] [2022-12-13 01:17:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:28,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:28,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:17:28,971 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) [2022-12-13 01:17:29,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:17:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:29,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:17:29,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:17:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:29,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:17:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:29,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752999115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:17:29,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:17:29,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-13 01:17:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418396633] [2022-12-13 01:17:29,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:17:29,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:17:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:17:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:17:29,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:29,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:29,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:29,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:29,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:29,599 INFO L130 PetriNetUnfolder]: 1651/2287 cut-off events. [2022-12-13 01:17:29,599 INFO L131 PetriNetUnfolder]: For 2955/2955 co-relation queries the response was YES. [2022-12-13 01:17:29,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7290 conditions, 2287 events. 1651/2287 cut-off events. For 2955/2955 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8419 event pairs, 323 based on Foata normal form. 90/2377 useless extension candidates. Maximal degree in co-relation 3576. Up to 974 conditions per place. [2022-12-13 01:17:29,608 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 88 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2022-12-13 01:17:29,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 98 transitions, 636 flow [2022-12-13 01:17:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:17:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:17:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 01:17:29,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.592 [2022-12-13 01:17:29,610 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 170 flow. Second operand 5 states and 74 transitions. [2022-12-13 01:17:29,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 98 transitions, 636 flow [2022-12-13 01:17:29,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 98 transitions, 628 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 01:17:29,614 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 230 flow [2022-12-13 01:17:29,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2022-12-13 01:17:29,615 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-13 01:17:29,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:29,615 INFO L89 Accepts]: Start accepts. Operand has 44 places, 43 transitions, 230 flow [2022-12-13 01:17:29,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:29,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:29,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 43 transitions, 230 flow [2022-12-13 01:17:29,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 230 flow [2022-12-13 01:17:29,629 INFO L130 PetriNetUnfolder]: 109/267 cut-off events. [2022-12-13 01:17:29,629 INFO L131 PetriNetUnfolder]: For 159/203 co-relation queries the response was YES. [2022-12-13 01:17:29,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 267 events. 109/267 cut-off events. For 159/203 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1141 event pairs, 9 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 581. Up to 123 conditions per place. [2022-12-13 01:17:29,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 230 flow [2022-12-13 01:17:29,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-13 01:17:29,633 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:17:29,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 01:17:29,633 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 230 flow [2022-12-13 01:17:29,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:29,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:29,634 INFO L214 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] [2022-12-13 01:17:29,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 01:17:29,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-13 01:17:29,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:29,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1474215567, now seen corresponding path program 1 times [2022-12-13 01:17:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:29,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610441196] [2022-12-13 01:17:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:29,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610441196] [2022-12-13 01:17:29,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610441196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:17:29,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:17:29,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:17:29,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332287277] [2022-12-13 01:17:29,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:17:29,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:17:29,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:29,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:17:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:17:29,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:29,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:29,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:29,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:29,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:30,239 INFO L130 PetriNetUnfolder]: 1541/2125 cut-off events. [2022-12-13 01:17:30,239 INFO L131 PetriNetUnfolder]: For 4028/4028 co-relation queries the response was YES. [2022-12-13 01:17:30,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8097 conditions, 2125 events. 1541/2125 cut-off events. For 4028/4028 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7710 event pairs, 343 based on Foata normal form. 30/2155 useless extension candidates. Maximal degree in co-relation 4230. Up to 1919 conditions per place. [2022-12-13 01:17:30,248 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 54 selfloop transitions, 11 changer transitions 11/76 dead transitions. [2022-12-13 01:17:30,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 509 flow [2022-12-13 01:17:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:17:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:17:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 01:17:30,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-13 01:17:30,249 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 230 flow. Second operand 4 states and 62 transitions. [2022-12-13 01:17:30,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 509 flow [2022-12-13 01:17:30,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 509 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 01:17:30,255 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 292 flow [2022-12-13 01:17:30,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2022-12-13 01:17:30,256 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-13 01:17:30,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:30,256 INFO L89 Accepts]: Start accepts. Operand has 48 places, 47 transitions, 292 flow [2022-12-13 01:17:30,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:30,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:30,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 292 flow [2022-12-13 01:17:30,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 292 flow [2022-12-13 01:17:30,269 INFO L130 PetriNetUnfolder]: 98/232 cut-off events. [2022-12-13 01:17:30,269 INFO L131 PetriNetUnfolder]: For 233/306 co-relation queries the response was YES. [2022-12-13 01:17:30,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 232 events. 98/232 cut-off events. For 233/306 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 915 event pairs, 8 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 585. Up to 106 conditions per place. [2022-12-13 01:17:30,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 292 flow [2022-12-13 01:17:30,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 01:17:30,272 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:17:30,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 01:17:30,273 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 292 flow [2022-12-13 01:17:30,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:30,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:30,273 INFO L214 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] [2022-12-13 01:17:30,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:17:30,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 413818845, now seen corresponding path program 2 times [2022-12-13 01:17:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:30,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119886090] [2022-12-13 01:17:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119886090] [2022-12-13 01:17:30,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119886090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:17:30,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:17:30,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:17:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047474718] [2022-12-13 01:17:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:17:30,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:17:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:17:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:17:30,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:30,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:30,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:30,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:30,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:30,659 INFO L130 PetriNetUnfolder]: 1793/2461 cut-off events. [2022-12-13 01:17:30,659 INFO L131 PetriNetUnfolder]: For 5541/5541 co-relation queries the response was YES. [2022-12-13 01:17:30,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 2461 events. 1793/2461 cut-off events. For 5541/5541 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9025 event pairs, 485 based on Foata normal form. 84/2545 useless extension candidates. Maximal degree in co-relation 5097. Up to 1989 conditions per place. [2022-12-13 01:17:30,672 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 69 selfloop transitions, 10 changer transitions 3/82 dead transitions. [2022-12-13 01:17:30,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 612 flow [2022-12-13 01:17:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:17:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:17:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-13 01:17:30,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 01:17:30,675 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 292 flow. Second operand 4 states and 60 transitions. [2022-12-13 01:17:30,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 612 flow [2022-12-13 01:17:30,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 597 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 01:17:30,682 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 310 flow [2022-12-13 01:17:30,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-13 01:17:30,684 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-13 01:17:30,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:30,685 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 310 flow [2022-12-13 01:17:30,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:30,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:30,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 310 flow [2022-12-13 01:17:30,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 310 flow [2022-12-13 01:17:30,706 INFO L130 PetriNetUnfolder]: 117/273 cut-off events. [2022-12-13 01:17:30,707 INFO L131 PetriNetUnfolder]: For 342/421 co-relation queries the response was YES. [2022-12-13 01:17:30,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 273 events. 117/273 cut-off events. For 342/421 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1154 event pairs, 9 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 736. Up to 131 conditions per place. [2022-12-13 01:17:30,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 310 flow [2022-12-13 01:17:30,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 01:17:30,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:17:30,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 01:17:30,713 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 310 flow [2022-12-13 01:17:30,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:30,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:30,713 INFO L214 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] [2022-12-13 01:17:30,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:17:30,714 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:30,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1119399486, now seen corresponding path program 1 times [2022-12-13 01:17:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:30,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636020883] [2022-12-13 01:17:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:30,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:30,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636020883] [2022-12-13 01:17:30,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636020883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:17:30,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:17:30,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:17:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665510587] [2022-12-13 01:17:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:17:30,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:17:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:17:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:17:30,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:17:30,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:30,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:30,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:17:30,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:31,071 INFO L130 PetriNetUnfolder]: 2009/2745 cut-off events. [2022-12-13 01:17:31,071 INFO L131 PetriNetUnfolder]: For 7309/7309 co-relation queries the response was YES. [2022-12-13 01:17:31,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11524 conditions, 2745 events. 2009/2745 cut-off events. For 7309/7309 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10235 event pairs, 539 based on Foata normal form. 68/2813 useless extension candidates. Maximal degree in co-relation 6178. Up to 2309 conditions per place. [2022-12-13 01:17:31,088 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 70 selfloop transitions, 10 changer transitions 3/83 dead transitions. [2022-12-13 01:17:31,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 638 flow [2022-12-13 01:17:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:17:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:17:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-13 01:17:31,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 01:17:31,089 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 310 flow. Second operand 4 states and 60 transitions. [2022-12-13 01:17:31,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 638 flow [2022-12-13 01:17:31,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 617 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 01:17:31,101 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 322 flow [2022-12-13 01:17:31,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2022-12-13 01:17:31,102 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-13 01:17:31,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:31,102 INFO L89 Accepts]: Start accepts. Operand has 53 places, 49 transitions, 322 flow [2022-12-13 01:17:31,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:31,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:31,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 49 transitions, 322 flow [2022-12-13 01:17:31,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 322 flow [2022-12-13 01:17:31,119 INFO L130 PetriNetUnfolder]: 138/300 cut-off events. [2022-12-13 01:17:31,119 INFO L131 PetriNetUnfolder]: For 426/525 co-relation queries the response was YES. [2022-12-13 01:17:31,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 300 events. 138/300 cut-off events. For 426/525 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1230 event pairs, 13 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 873. Up to 155 conditions per place. [2022-12-13 01:17:31,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 49 transitions, 322 flow [2022-12-13 01:17:31,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-13 01:17:31,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:31,153 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:17:31,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 01:17:31,153 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 325 flow [2022-12-13 01:17:31,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:17:31,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:31,154 INFO L214 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] [2022-12-13 01:17:31,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:17:31,154 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash -583294836, now seen corresponding path program 1 times [2022-12-13 01:17:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:31,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833448272] [2022-12-13 01:17:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833448272] [2022-12-13 01:17:31,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833448272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:17:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533473536] [2022-12-13 01:17:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:31,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:31,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:17:31,548 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) [2022-12-13 01:17:31,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process Received shutdown request... [2022-12-13 01:32:09,325 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 01:32:09,328 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 01:32:10,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-13 01:32:10,526 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forcibly destroying the process [2022-12-13 01:32:10,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 01:32:10,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:32:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2022-12-13 01:32:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008442219] [2022-12-13 01:32:10,532 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-13 01:32:10,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:32:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:32:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:32:10,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 01:32:10,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 325 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:32:10,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:10,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 01:32:10,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:10,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 01:32:10,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 137 [2022-12-13 01:32:10,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:32:10,541 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 01:32:10,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 01:32:10,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 01:32:10,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 01:32:10,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 01:32:10,543 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-12-13 01:32:10,547 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:32:10,547 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:32:10,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:32:10 BasicIcfg [2022-12-13 01:32:10,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:32:10,549 INFO L158 Benchmark]: Toolchain (without parser) took 889127.15ms. Allocated memory was 198.2MB in the beginning and 368.1MB in the end (delta: 169.9MB). Free memory was 174.3MB in the beginning and 210.9MB in the end (delta: -36.6MB). Peak memory consumption was 134.3MB. Max. memory is 8.0GB. [2022-12-13 01:32:10,550 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 175.7MB in the beginning and 175.6MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:32:10,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.57ms. Allocated memory is still 198.2MB. Free memory was 174.3MB in the beginning and 162.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 01:32:10,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.71ms. Allocated memory is still 198.2MB. Free memory was 162.7MB in the beginning and 160.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:32:10,550 INFO L158 Benchmark]: Boogie Preprocessor took 17.06ms. Allocated memory is still 198.2MB. Free memory was 160.7MB in the beginning and 159.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:32:10,550 INFO L158 Benchmark]: RCFGBuilder took 421.23ms. Allocated memory is still 198.2MB. Free memory was 159.7MB in the beginning and 143.4MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 01:32:10,551 INFO L158 Benchmark]: TraceAbstraction took 888506.88ms. Allocated memory was 198.2MB in the beginning and 368.1MB in the end (delta: 169.9MB). Free memory was 142.4MB in the beginning and 210.9MB in the end (delta: -68.6MB). Peak memory consumption was 102.9MB. Max. memory is 8.0GB. [2022-12-13 01:32:10,552 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 175.7MB in the beginning and 175.6MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 155.57ms. Allocated memory is still 198.2MB. Free memory was 174.3MB in the beginning and 162.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.71ms. Allocated memory is still 198.2MB. Free memory was 162.7MB in the beginning and 160.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.06ms. Allocated memory is still 198.2MB. Free memory was 160.7MB in the beginning and 159.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 421.23ms. Allocated memory is still 198.2MB. Free memory was 159.7MB in the beginning and 143.4MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 888506.88ms. Allocated memory was 198.2MB in the beginning and 368.1MB in the end (delta: 169.9MB). Free memory was 142.4MB in the beginning and 210.9MB in the end (delta: -68.6MB). Peak memory consumption was 102.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 129 PlacesBefore, 34 PlacesAfterwards, 126 TransitionsBefore, 25 TransitionsAfterwards, 3312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 53 ConcurrentYvCompositions, 6 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 1721, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1721, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1721, unknown conditional: 0, unknown unconditional: 1721] , Statistics on independence cache: Total cache size (in pairs): 2951, Positive cache size: 2951, Positive conditional cache size: 0, Positive unconditional cache size: 2951, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 888.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 721 IncrementalHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 721 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 5731 SizeOfPredicates, 14 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown