/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-RepeatedSemanticLbeWithPredicates.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-8d0d62b [2022-12-06 05:01:14,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:01:14,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:01:14,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:01:14,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:01:14,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:01:14,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:01:14,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:01:14,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:01:14,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:01:14,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:01:14,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:01:14,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:01:14,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:01:14,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:01:14,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:01:14,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:01:14,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:01:14,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:01:14,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:01:14,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:01:14,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:01:14,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:01:14,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:01:14,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:01:14,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:01:14,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:01:15,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:01:15,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:01:15,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:01:15,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:01:15,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:01:15,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:01:15,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:01:15,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:01:15,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:01:15,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:01:15,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:01:15,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:01:15,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:01:15,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:01:15,007 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:01:15,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:01:15,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:01:15,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:01:15,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:01:15,033 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:01:15,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:01:15,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:01:15,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:01:15,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:01:15,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:01:15,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:01:15,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:01:15,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:01:15,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:01:15,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:01:15,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:01:15,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:01:15,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:01:15,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:01:15,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:01:15,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:01:15,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:01:15,037 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-06 05:01:15,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:01:15,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:01:15,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:01:15,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:01:15,317 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:01:15,317 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-06 05:01:16,242 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:01:16,408 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:01:16,409 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-06 05:01:16,415 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c6a0423/9870755a74284bdfa500b509a82cf056/FLAG407b977fd [2022-12-06 05:01:16,424 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c6a0423/9870755a74284bdfa500b509a82cf056 [2022-12-06 05:01:16,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:01:16,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:01:16,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:01:16,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:01:16,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:01:16,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6800062a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16, skipping insertion in model container [2022-12-06 05:01:16,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:01:16,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:01:16,617 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-06 05:01:16,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:01:16,631 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:01:16,660 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-06 05:01:16,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:01:16,685 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:01:16,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16 WrapperNode [2022-12-06 05:01:16,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:01:16,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:01:16,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:01:16,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:01:16,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,726 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-06 05:01:16,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:01:16,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:01:16,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:01:16,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:01:16,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,755 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:01:16,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:01:16,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:01:16,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:01:16,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (1/1) ... [2022-12-06 05:01:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:01:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:16,802 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-06 05:01:16,819 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-06 05:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:01:16,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:01:16,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:01:16,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:01:16,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:01:16,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:01:16,846 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:01:16,948 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:01:16,950 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:01:17,158 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:01:17,172 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:01:17,173 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:01:17,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:01:17 BoogieIcfgContainer [2022-12-06 05:01:17,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:01:17,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:01:17,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:01:17,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:01:17,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:01:16" (1/3) ... [2022-12-06 05:01:17,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d56b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:01:17, skipping insertion in model container [2022-12-06 05:01:17,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:16" (2/3) ... [2022-12-06 05:01:17,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d56b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:01:17, skipping insertion in model container [2022-12-06 05:01:17,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:01:17" (3/3) ... [2022-12-06 05:01:17,181 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2022-12-06 05:01:17,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:01:17,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:01:17,194 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:01:17,279 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 05:01:17,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 142 transitions, 316 flow [2022-12-06 05:01:17,370 INFO L130 PetriNetUnfolder]: 10/138 cut-off events. [2022-12-06 05:01:17,370 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:01:17,376 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-06 05:01:17,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 142 transitions, 316 flow [2022-12-06 05:01:17,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 126 transitions, 276 flow [2022-12-06 05:01:17,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:17,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-06 05:01:17,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 126 transitions, 276 flow [2022-12-06 05:01:17,425 INFO L130 PetriNetUnfolder]: 10/126 cut-off events. [2022-12-06 05:01:17,425 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:01:17,426 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-06 05:01:17,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-06 05:01:17,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 3312 [2022-12-06 05:01:22,248 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 05:01:22,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:01:22,280 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;@e3d876, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:01:22,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 05:01:22,286 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 05:01:22,286 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:01:22,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:22,287 INFO L213 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-06 05:01:22,312 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-06 05:01:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1738926514, now seen corresponding path program 1 times [2022-12-06 05:01:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120011901] [2022-12-06 05:01:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:22,823 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-06 05:01:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120011901] [2022-12-06 05:01:22,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120011901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:22,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:22,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:01:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530584192] [2022-12-06 05:01:22,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:22,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:01:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:01:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:01:22,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:22,868 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-06 05:01:22,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:22,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:22,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:23,011 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-06 05:01:23,011 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-06 05:01:23,014 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-06 05:01:23,019 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-06 05:01:23,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-06 05:01:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:01:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:01:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 05:01:23,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 05:01:23,030 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-06 05:01:23,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-06 05:01:23,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 05:01:23,038 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-06 05:01:23,039 INFO L276 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-06 05:01:23,042 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 05:01:23,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:23,043 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 05:01:23,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:23,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:23,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 05:01:23,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 05:01:23,049 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-06 05:01:23,049 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 05:01:23,049 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:01:23,049 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:01:23,049 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:01:23,051 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-06 05:01:23,051 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:01:23,051 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-06 05:01:23,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 05:01:23,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 05:01:23,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:23,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:01:23,054 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-06 05:01:23,054 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-06 05:01:23,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:23,054 INFO L213 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-06 05:01:23,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:01:23,054 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-06 05:01:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1759079634, now seen corresponding path program 1 times [2022-12-06 05:01:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:23,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046567444] [2022-12-06 05:01:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:23,160 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-06 05:01:23,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:23,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046567444] [2022-12-06 05:01:23,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046567444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:23,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:23,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035049850] [2022-12-06 05:01:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:23,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:23,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:23,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:23,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:23,163 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-06 05:01:23,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:23,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:23,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:23,364 INFO L130 PetriNetUnfolder]: 699/957 cut-off events. [2022-12-06 05:01:23,364 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-12-06 05:01:23,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 957 events. 699/957 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2889 event pairs, 35 based on Foata normal form. 26/983 useless extension candidates. Maximal degree in co-relation 838. Up to 461 conditions per place. [2022-12-06 05:01:23,368 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-06 05:01:23,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 82 transitions, 405 flow [2022-12-06 05:01:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:01:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:01:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 05:01:23,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.608 [2022-12-06 05:01:23,369 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 5 states and 76 transitions. [2022-12-06 05:01:23,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 82 transitions, 405 flow [2022-12-06 05:01:23,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 82 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:23,371 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 151 flow [2022-12-06 05:01:23,371 INFO L276 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-06 05:01:23,372 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 05:01:23,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:23,372 INFO L89 Accepts]: Start accepts. Operand has 34 places, 36 transitions, 151 flow [2022-12-06 05:01:23,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:23,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:23,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 151 flow [2022-12-06 05:01:23,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 151 flow [2022-12-06 05:01:23,377 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][27], [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)))), 19#L38-1true, 117#L66-1true, 152#true, Black: 154#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 157#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-12-06 05:01:23,377 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:01:23,377 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:01:23,377 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:01:23,377 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:01:23,381 INFO L130 PetriNetUnfolder]: 47/104 cut-off events. [2022-12-06 05:01:23,381 INFO L131 PetriNetUnfolder]: For 50/71 co-relation queries the response was YES. [2022-12-06 05:01:23,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 104 events. 47/104 cut-off events. For 50/71 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 228 event pairs, 0 based on Foata normal form. 6/95 useless extension candidates. Maximal degree in co-relation 180. Up to 52 conditions per place. [2022-12-06 05:01:23,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 151 flow [2022-12-06 05:01:23,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 05:01:23,382 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:23,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:01:23,383 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 151 flow [2022-12-06 05:01:23,384 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-06 05:01:23,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:23,384 INFO L213 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-06 05:01:23,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:01:23,384 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-06 05:01:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash -151813910, now seen corresponding path program 2 times [2022-12-06 05:01:23,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:23,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477877764] [2022-12-06 05:01:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:23,486 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-06 05:01:23,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:23,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477877764] [2022-12-06 05:01:23,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477877764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:23,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:23,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454382149] [2022-12-06 05:01:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:23,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:23,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:23,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:23,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 151 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-06 05:01:23,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:23,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:23,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:23,646 INFO L130 PetriNetUnfolder]: 811/1105 cut-off events. [2022-12-06 05:01:23,646 INFO L131 PetriNetUnfolder]: For 909/909 co-relation queries the response was YES. [2022-12-06 05:01:23,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1105 events. 811/1105 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3354 event pairs, 233 based on Foata normal form. 36/1141 useless extension candidates. Maximal degree in co-relation 955. Up to 523 conditions per place. [2022-12-06 05:01:23,652 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-06 05:01:23,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 82 transitions, 456 flow [2022-12-06 05:01:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:01:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:01:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 05:01:23,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.608 [2022-12-06 05:01:23,655 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 151 flow. Second operand 5 states and 76 transitions. [2022-12-06 05:01:23,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 82 transitions, 456 flow [2022-12-06 05:01:23,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 82 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:01:23,660 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 205 flow [2022-12-06 05:01:23,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 05:01:23,661 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 05:01:23,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:23,661 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 205 flow [2022-12-06 05:01:23,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:23,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:23,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 205 flow [2022-12-06 05:01:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 205 flow [2022-12-06 05:01:23,669 INFO L130 PetriNetUnfolder]: 55/116 cut-off events. [2022-12-06 05:01:23,670 INFO L131 PetriNetUnfolder]: For 147/165 co-relation queries the response was YES. [2022-12-06 05:01:23,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 116 events. 55/116 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 257 event pairs, 0 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 257. Up to 63 conditions per place. [2022-12-06 05:01:23,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 205 flow [2022-12-06 05:01:23,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 05:01:23,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:23,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:01:23,675 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 205 flow [2022-12-06 05:01:23,675 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-06 05:01:23,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:23,676 INFO L213 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-06 05:01:23,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:01:23,676 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-06 05:01:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 43416820, now seen corresponding path program 1 times [2022-12-06 05:01:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:23,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710011704] [2022-12-06 05:01:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:23,839 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-06 05:01:23,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:23,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710011704] [2022-12-06 05:01:23,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710011704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:23,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114250284] [2022-12-06 05:01:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:23,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:23,863 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-06 05:01:23,926 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-06 05:01:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:23,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:23,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:24,428 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-06 05:01:24,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:24,483 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-06 05:01:24,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114250284] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:24,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:24,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:01:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756675692] [2022-12-06 05:01:24,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:24,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:01:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:01:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:01:24,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:24,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 05:01:24,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:24,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:24,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:24,785 INFO L130 PetriNetUnfolder]: 1503/2055 cut-off events. [2022-12-06 05:01:24,785 INFO L131 PetriNetUnfolder]: For 3695/3695 co-relation queries the response was YES. [2022-12-06 05:01:24,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 2055 events. 1503/2055 cut-off events. For 3695/3695 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7511 event pairs, 103 based on Foata normal form. 72/2127 useless extension candidates. Maximal degree in co-relation 3855. Up to 882 conditions per place. [2022-12-06 05:01:24,799 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 115 selfloop transitions, 11 changer transitions 1/127 dead transitions. [2022-12-06 05:01:24,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 127 transitions, 892 flow [2022-12-06 05:01:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:01:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:01:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 05:01:24,800 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 05:01:24,800 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 205 flow. Second operand 6 states and 96 transitions. [2022-12-06 05:01:24,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 127 transitions, 892 flow [2022-12-06 05:01:24,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 127 transitions, 863 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:24,807 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 255 flow [2022-12-06 05:01:24,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-06 05:01:24,808 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-06 05:01:24,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:24,808 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 255 flow [2022-12-06 05:01:24,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:24,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:24,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 255 flow [2022-12-06 05:01:24,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 255 flow [2022-12-06 05:01:24,833 INFO L130 PetriNetUnfolder]: 94/212 cut-off events. [2022-12-06 05:01:24,833 INFO L131 PetriNetUnfolder]: For 277/360 co-relation queries the response was YES. [2022-12-06 05:01:24,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 212 events. 94/212 cut-off events. For 277/360 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 742 event pairs, 6 based on Foata normal form. 7/191 useless extension candidates. Maximal degree in co-relation 534. Up to 107 conditions per place. [2022-12-06 05:01:24,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 255 flow [2022-12-06 05:01:24,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-06 05:01:24,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:24,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:01:24,837 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 255 flow [2022-12-06 05:01:24,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 05:01:24,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:24,837 INFO L213 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-06 05:01:24,851 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-06 05:01:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:25,049 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-06 05:01:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -444036910, now seen corresponding path program 1 times [2022-12-06 05:01:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864565493] [2022-12-06 05:01:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:25,163 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-06 05:01:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:25,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864565493] [2022-12-06 05:01:25,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864565493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:25,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:25,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:25,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226422237] [2022-12-06 05:01:25,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:25,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:25,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:25,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:25,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 255 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-06 05:01:25,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:25,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:25,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:25,370 INFO L130 PetriNetUnfolder]: 1445/1997 cut-off events. [2022-12-06 05:01:25,370 INFO L131 PetriNetUnfolder]: For 5290/5290 co-relation queries the response was YES. [2022-12-06 05:01:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 1997 events. 1445/1997 cut-off events. For 5290/5290 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7476 event pairs, 119 based on Foata normal form. 58/2055 useless extension candidates. Maximal degree in co-relation 4487. Up to 831 conditions per place. [2022-12-06 05:01:25,381 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 91 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2022-12-06 05:01:25,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 683 flow [2022-12-06 05:01:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:01:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:01:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 05:01:25,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 05:01:25,382 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 255 flow. Second operand 5 states and 75 transitions. [2022-12-06 05:01:25,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 683 flow [2022-12-06 05:01:25,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:25,391 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 263 flow [2022-12-06 05:01:25,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-06 05:01:25,393 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-06 05:01:25,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:25,393 INFO L89 Accepts]: Start accepts. Operand has 51 places, 43 transitions, 263 flow [2022-12-06 05:01:25,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:25,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:25,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 263 flow [2022-12-06 05:01:25,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 263 flow [2022-12-06 05:01:25,406 INFO L130 PetriNetUnfolder]: 87/197 cut-off events. [2022-12-06 05:01:25,406 INFO L131 PetriNetUnfolder]: For 299/365 co-relation queries the response was YES. [2022-12-06 05:01:25,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 197 events. 87/197 cut-off events. For 299/365 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 677 event pairs, 7 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 515. Up to 98 conditions per place. [2022-12-06 05:01:25,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 263 flow [2022-12-06 05:01:25,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 05:01:25,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:25,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:01:25,412 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 263 flow [2022-12-06 05:01:25,412 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-06 05:01:25,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:25,412 INFO L213 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-06 05:01:25,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:01:25,413 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-06 05:01:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash 236007172, now seen corresponding path program 2 times [2022-12-06 05:01:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:25,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166638537] [2022-12-06 05:01:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:25,548 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-06 05:01:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:25,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166638537] [2022-12-06 05:01:25,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166638537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:25,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:25,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288373200] [2022-12-06 05:01:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:25,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:25,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:25,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 263 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-06 05:01:25,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:25,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:25,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:25,716 INFO L130 PetriNetUnfolder]: 1275/1751 cut-off events. [2022-12-06 05:01:25,716 INFO L131 PetriNetUnfolder]: For 5366/5366 co-relation queries the response was YES. [2022-12-06 05:01:25,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 1751 events. 1275/1751 cut-off events. For 5366/5366 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6131 event pairs, 65 based on Foata normal form. 34/1785 useless extension candidates. Maximal degree in co-relation 4225. Up to 710 conditions per place. [2022-12-06 05:01:25,726 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 102 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2022-12-06 05:01:25,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 919 flow [2022-12-06 05:01:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:01:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:01:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 05:01:25,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 05:01:25,728 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 263 flow. Second operand 5 states and 72 transitions. [2022-12-06 05:01:25,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 919 flow [2022-12-06 05:01:25,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 894 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:25,733 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 313 flow [2022-12-06 05:01:25,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-06 05:01:25,734 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-06 05:01:25,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:25,734 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 313 flow [2022-12-06 05:01:25,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:25,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:25,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 313 flow [2022-12-06 05:01:25,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 313 flow [2022-12-06 05:01:25,744 INFO L130 PetriNetUnfolder]: 74/155 cut-off events. [2022-12-06 05:01:25,744 INFO L131 PetriNetUnfolder]: For 259/340 co-relation queries the response was YES. [2022-12-06 05:01:25,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 155 events. 74/155 cut-off events. For 259/340 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 434 event pairs, 1 based on Foata normal form. 6/146 useless extension candidates. Maximal degree in co-relation 466. Up to 81 conditions per place. [2022-12-06 05:01:25,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 313 flow [2022-12-06 05:01:25,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 05:01:25,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:25,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:01:25,747 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 313 flow [2022-12-06 05:01:25,747 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-06 05:01:25,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:25,747 INFO L213 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-06 05:01:25,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:01:25,747 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-06 05:01:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 636522545, now seen corresponding path program 1 times [2022-12-06 05:01:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:25,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463291095] [2022-12-06 05:01:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:25,857 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-06 05:01:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:25,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463291095] [2022-12-06 05:01:25,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463291095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:25,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:25,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734282448] [2022-12-06 05:01:25,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:25,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:25,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:25,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 313 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-06 05:01:25,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:25,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:25,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:26,040 INFO L130 PetriNetUnfolder]: 1259/1735 cut-off events. [2022-12-06 05:01:26,040 INFO L131 PetriNetUnfolder]: For 5392/5392 co-relation queries the response was YES. [2022-12-06 05:01:26,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7856 conditions, 1735 events. 1259/1735 cut-off events. For 5392/5392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5988 event pairs, 261 based on Foata normal form. 16/1751 useless extension candidates. Maximal degree in co-relation 5018. Up to 1529 conditions per place. [2022-12-06 05:01:26,049 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 62 selfloop transitions, 9 changer transitions 11/82 dead transitions. [2022-12-06 05:01:26,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 629 flow [2022-12-06 05:01:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 05:01:26,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 05:01:26,051 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 313 flow. Second operand 4 states and 61 transitions. [2022-12-06 05:01:26,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 629 flow [2022-12-06 05:01:26,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 617 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 05:01:26,055 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 364 flow [2022-12-06 05:01:26,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-06 05:01:26,056 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-12-06 05:01:26,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:26,056 INFO L89 Accepts]: Start accepts. Operand has 59 places, 51 transitions, 364 flow [2022-12-06 05:01:26,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:26,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:26,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 364 flow [2022-12-06 05:01:26,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 364 flow [2022-12-06 05:01:26,066 INFO L130 PetriNetUnfolder]: 76/167 cut-off events. [2022-12-06 05:01:26,066 INFO L131 PetriNetUnfolder]: For 330/415 co-relation queries the response was YES. [2022-12-06 05:01:26,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 167 events. 76/167 cut-off events. For 330/415 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 526 event pairs, 2 based on Foata normal form. 5/152 useless extension candidates. Maximal degree in co-relation 518. Up to 81 conditions per place. [2022-12-06 05:01:26,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 364 flow [2022-12-06 05:01:26,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 05:01:26,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:26,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:01:26,069 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 364 flow [2022-12-06 05:01:26,069 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-06 05:01:26,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:26,069 INFO L213 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-06 05:01:26,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:01:26,069 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-06 05:01:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash 441524475, now seen corresponding path program 2 times [2022-12-06 05:01:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:26,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162988410] [2022-12-06 05:01:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:26,164 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-06 05:01:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:26,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162988410] [2022-12-06 05:01:26,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162988410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:26,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427031900] [2022-12-06 05:01:26,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:01:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:26,178 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-06 05:01:26,214 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-06 05:01:26,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:01:26,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:26,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:26,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:26,342 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-06 05:01:26,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:26,385 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-06 05:01:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427031900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:26,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:26,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:01:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350804299] [2022-12-06 05:01:26,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:01:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:01:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:01:26,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:01:26,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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-06 05:01:26,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:26,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:01:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:26,690 INFO L130 PetriNetUnfolder]: 1555/2145 cut-off events. [2022-12-06 05:01:26,690 INFO L131 PetriNetUnfolder]: For 6492/6492 co-relation queries the response was YES. [2022-12-06 05:01:26,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9738 conditions, 2145 events. 1555/2145 cut-off events. For 6492/6492 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7790 event pairs, 187 based on Foata normal form. 68/2213 useless extension candidates. Maximal degree in co-relation 6135. Up to 1119 conditions per place. [2022-12-06 05:01:26,704 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 120 selfloop transitions, 13 changer transitions 3/136 dead transitions. [2022-12-06 05:01:26,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 1092 flow [2022-12-06 05:01:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:01:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:01:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 05:01:26,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 05:01:26,705 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 364 flow. Second operand 6 states and 96 transitions. [2022-12-06 05:01:26,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 1092 flow [2022-12-06 05:01:26,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 136 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:01:26,712 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 411 flow [2022-12-06 05:01:26,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-12-06 05:01:26,713 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-06 05:01:26,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:26,713 INFO L89 Accepts]: Start accepts. Operand has 64 places, 54 transitions, 411 flow [2022-12-06 05:01:26,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:26,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:26,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 411 flow [2022-12-06 05:01:26,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 411 flow [2022-12-06 05:01:26,727 INFO L130 PetriNetUnfolder]: 113/230 cut-off events. [2022-12-06 05:01:26,727 INFO L131 PetriNetUnfolder]: For 608/716 co-relation queries the response was YES. [2022-12-06 05:01:26,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 230 events. 113/230 cut-off events. For 608/716 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 779 event pairs, 5 based on Foata normal form. 6/216 useless extension candidates. Maximal degree in co-relation 806. Up to 126 conditions per place. [2022-12-06 05:01:26,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 411 flow [2022-12-06 05:01:26,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 05:01:26,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L80-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork2_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_12 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_12} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_12, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:01:26,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:01:26,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 05:01:26,782 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 421 flow [2022-12-06 05:01:26,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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-06 05:01:26,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:26,782 INFO L213 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-06 05:01:26,792 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-06 05:01:26,986 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,SelfDestructingSolverStorable7 [2022-12-06 05:01:26,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:01:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1119399486, now seen corresponding path program 2 times [2022-12-06 05:01:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:26,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087399088] [2022-12-06 05:01:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:27,074 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-06 05:01:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:27,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087399088] [2022-12-06 05:01:27,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087399088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:27,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:27,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207671451] [2022-12-06 05:01:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:27,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:27,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:27,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:27,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:01:27,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 421 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-06 05:01:27,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:27,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:01:27,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:27,336 INFO L130 PetriNetUnfolder]: 1795/2461 cut-off events. [2022-12-06 05:01:27,336 INFO L131 PetriNetUnfolder]: For 10192/10192 co-relation queries the response was YES. [2022-12-06 05:01:27,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12248 conditions, 2461 events. 1795/2461 cut-off events. For 10192/10192 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9038 event pairs, 419 based on Foata normal form. 76/2537 useless extension candidates. Maximal degree in co-relation 9423. Up to 2001 conditions per place. [2022-12-06 05:01:27,348 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 87 selfloop transitions, 8 changer transitions 3/98 dead transitions. [2022-12-06 05:01:27,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 889 flow [2022-12-06 05:01:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 05:01:27,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-06 05:01:27,350 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 421 flow. Second operand 4 states and 62 transitions. [2022-12-06 05:01:27,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 889 flow [2022-12-06 05:01:27,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 822 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 05:01:27,362 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 411 flow [2022-12-06 05:01:27,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-06 05:01:27,362 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 05:01:27,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:27,362 INFO L89 Accepts]: Start accepts. Operand has 65 places, 55 transitions, 411 flow [2022-12-06 05:01:27,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:27,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:27,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 55 transitions, 411 flow [2022-12-06 05:01:27,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 55 transitions, 411 flow [2022-12-06 05:01:27,378 INFO L130 PetriNetUnfolder]: 136/279 cut-off events. [2022-12-06 05:01:27,378 INFO L131 PetriNetUnfolder]: For 703/825 co-relation queries the response was YES. [2022-12-06 05:01:27,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 279 events. 136/279 cut-off events. For 703/825 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1044 event pairs, 11 based on Foata normal form. 7/259 useless extension candidates. Maximal degree in co-relation 1017. Up to 148 conditions per place. [2022-12-06 05:01:27,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 55 transitions, 411 flow [2022-12-06 05:01:27,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-06 05:01:27,385 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-06 05:01:27,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:01:27,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 05:01:27,409 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 416 flow [2022-12-06 05:01:27,409 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-06 05:01:27,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:27,409 INFO L213 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-06 05:01:27,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:01:27,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:01:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash 498782777, now seen corresponding path program 1 times [2022-12-06 05:01:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:27,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212681199] [2022-12-06 05:01:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:27,771 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-06 05:01:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212681199] [2022-12-06 05:01:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212681199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:27,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081057336] [2022-12-06 05:01:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:27,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:27,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:27,784 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-06 05:01:27,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:02:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:14,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:02:14,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:28,385 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-06 05:02:28,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:35,144 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-06 05:02:35,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081057336] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:35,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:35,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:02:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139966719] [2022-12-06 05:02:35,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:35,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:02:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:02:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=106, Unknown=8, NotChecked=0, Total=156 [2022-12-06 05:02:35,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:02:35,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 416 flow. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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-06 05:02:35,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:35,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:02:35,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:37,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:24,029 WARN L233 SmtUtils]: Spent 44.10s on a formula simplification. DAG size of input: 78 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:03:26,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:28,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:30,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:32,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:34,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:36,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:38,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:46,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:48,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:50,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:52,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:55,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:57,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:00,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:01,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:03,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:05,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:07,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:09,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:11,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:13,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:15,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:17,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:33,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:35,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:37,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:39,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:41,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:43,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:45,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:48,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:50,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:52,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:54,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:56,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:58,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:00,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:02,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:03,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:05,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:07,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:09,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:05:30,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:06,363 WARN L233 SmtUtils]: Spent 13.82s on a formula simplification. DAG size of input: 56 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:06:08,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:10,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:12,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:14,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:16,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:19,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:21,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:23,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:25,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:27,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:36,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:37,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:39,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:41,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:51,882 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:06:54,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:56,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:06:58,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:00,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:02,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:04,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:07,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:09,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:11,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:12,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:14,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:16,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:19,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:20,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:22,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:25,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:27,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:29,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:32,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:34,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:36,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:38,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:40,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:42,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:44,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:46,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:48,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:50,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:52,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:54,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:57,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:59,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:01,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:03,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:05,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:13,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:16,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:18,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:20,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:22,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:24,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:26,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:28,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:30,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:32,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:34,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:37,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:39,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:41,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:43,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:47,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:49,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:50,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:52,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:54,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:56,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:59,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:01,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:03,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:06,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:09,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:11,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:14,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:17,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:19,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:21,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:23,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:25,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:28,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:30,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:32,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:34,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:37,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:39,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:43,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:45,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:48,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:50,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:52,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:54,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:57,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:09:59,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:01,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:02,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:16,827 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 50 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:10:19,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:21,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:23,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:26,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:28,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:30,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:32,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:33,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:36,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:38,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:40,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:42,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:46,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:46,080 INFO L130 PetriNetUnfolder]: 2881/4009 cut-off events. [2022-12-06 05:10:46,080 INFO L131 PetriNetUnfolder]: For 13729/13729 co-relation queries the response was YES. [2022-12-06 05:10:46,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18822 conditions, 4009 events. 2881/4009 cut-off events. For 13729/13729 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16666 event pairs, 398 based on Foata normal form. 4/4013 useless extension candidates. Maximal degree in co-relation 13475. Up to 2433 conditions per place. [2022-12-06 05:10:46,099 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 184 selfloop transitions, 106 changer transitions 14/304 dead transitions. [2022-12-06 05:10:46,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 304 transitions, 2381 flow [2022-12-06 05:10:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:10:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:10:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 248 transitions. [2022-12-06 05:10:46,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5102880658436214 [2022-12-06 05:10:46,102 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 416 flow. Second operand 18 states and 248 transitions. [2022-12-06 05:10:46,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 304 transitions, 2381 flow [2022-12-06 05:10:46,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 304 transitions, 2361 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:10:46,119 INFO L231 Difference]: Finished difference. Result has 92 places, 156 transitions, 1583 flow [2022-12-06 05:10:46,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1583, PETRI_PLACES=92, PETRI_TRANSITIONS=156} [2022-12-06 05:10:46,120 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2022-12-06 05:10:46,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:10:46,120 INFO L89 Accepts]: Start accepts. Operand has 92 places, 156 transitions, 1583 flow [2022-12-06 05:10:46,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:10:46,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:46,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 156 transitions, 1583 flow [2022-12-06 05:10:46,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 156 transitions, 1583 flow [2022-12-06 05:10:46,217 INFO L130 PetriNetUnfolder]: 865/1479 cut-off events. [2022-12-06 05:10:46,217 INFO L131 PetriNetUnfolder]: For 20153/23470 co-relation queries the response was YES. [2022-12-06 05:10:46,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9443 conditions, 1479 events. 865/1479 cut-off events. For 20153/23470 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 8263 event pairs, 190 based on Foata normal form. 60/1306 useless extension candidates. Maximal degree in co-relation 8648. Up to 748 conditions per place. [2022-12-06 05:10:46,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 156 transitions, 1583 flow [2022-12-06 05:10:46,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-06 05:10:46,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [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] [2022-12-06 05:10:46,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [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] [2022-12-06 05:10:46,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [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] [2022-12-06 05:10:46,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] L111-2-->L112-1: Formula: (= (select (select |v_#memory_int_35| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) |v_ULTIMATE.start_main_~#t3~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem16#1_22|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] and [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] [2022-12-06 05:10:46,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:10:46,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [458] L110-2-->L111-1: Formula: (= (select (select |v_#memory_int_37| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem15#1_24|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_24|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1] [2022-12-06 05:10:46,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 05:10:46,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] 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-06 05:10:46,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 05:10:46,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [446] L109-4-->L110-1: Formula: (= (select (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_25|) |v_ULTIMATE.start_main_#t~mem14#1_22|) InVars {#memory_int=|v_#memory_int_33|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_25|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_22|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:10:46,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [451] L111-2-->L112-1: Formula: (= (select (select |v_#memory_int_35| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) |v_ULTIMATE.start_main_~#t3~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem16#1_22|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 05:10:46,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:10:46,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [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] [2022-12-06 05:10:47,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [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] [2022-12-06 05:10:47,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 05:10:47,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:10:47,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~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-06 05:10:47,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:10:47,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [495] L80-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork2_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_12 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_12} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_12, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] [2022-12-06 05:10:47,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 05:10:47,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [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] [2022-12-06 05:10:47,627 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:10:47,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1507 [2022-12-06 05:10:47,627 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 156 transitions, 1776 flow [2022-12-06 05:10:47,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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-06 05:10:47,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:10:47,628 INFO L213 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-06 05:10:47,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:10:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:10:47,828 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:10:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:10:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash 300119684, now seen corresponding path program 1 times [2022-12-06 05:10:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:10:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796841330] [2022-12-06 05:10:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:10:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:10:48,215 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-06 05:10:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:10:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796841330] [2022-12-06 05:10:48,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796841330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:10:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269495664] [2022-12-06 05:10:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:10:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:10:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:10:48,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:10:48,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Received shutdown request... [2022-12-06 05:15:57,557 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-06 05:15:57,578 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:15:58,567 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-06 05:15:58,779 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forcibly destroying the process [2022-12-06 05:15:58,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 137 [2022-12-06 05:15:58,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-06 05:15:58,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:15:58,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2022-12-06 05:15:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664708140] [2022-12-06 05:15:58,789 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:58,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:15:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:15:58,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:15:58,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:15:58,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 156 transitions, 1776 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-06 05:15:58,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:58,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:15:58,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:58,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 05:15:58,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:15:58,792 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 05:15:58,793 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 05:15:58,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 05:15:58,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 05:15:58,794 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 05:15:58,794 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2022-12-06 05:15:58,796 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:15:58,796 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:15:58,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:15:58 BasicIcfg [2022-12-06 05:15:58,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:15:58,798 INFO L158 Benchmark]: Toolchain (without parser) took 882371.23ms. Allocated memory was 212.9MB in the beginning and 375.4MB in the end (delta: 162.5MB). Free memory was 189.0MB in the beginning and 204.9MB in the end (delta: -15.9MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. [2022-12-06 05:15:58,798 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory is still 190.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:15:58,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.14ms. Allocated memory is still 212.9MB. Free memory was 189.0MB in the beginning and 177.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:15:58,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.69ms. Allocated memory is still 212.9MB. Free memory was 177.2MB in the beginning and 175.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:15:58,798 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 212.9MB. Free memory was 175.6MB in the beginning and 174.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:15:58,799 INFO L158 Benchmark]: RCFGBuilder took 416.48ms. Allocated memory is still 212.9MB. Free memory was 174.1MB in the beginning and 158.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 05:15:58,799 INFO L158 Benchmark]: TraceAbstraction took 881621.83ms. Allocated memory was 212.9MB in the beginning and 375.4MB in the end (delta: 162.5MB). Free memory was 157.3MB in the beginning and 204.9MB in the end (delta: -47.6MB). Peak memory consumption was 116.5MB. Max. memory is 8.0GB. [2022-12-06 05:15:58,800 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.09ms. Allocated memory is still 212.9MB. Free memory is still 190.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.14ms. Allocated memory is still 212.9MB. Free memory was 189.0MB in the beginning and 177.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.69ms. Allocated memory is still 212.9MB. Free memory was 177.2MB in the beginning and 175.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 212.9MB. Free memory was 175.6MB in the beginning and 174.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 416.48ms. Allocated memory is still 212.9MB. Free memory was 174.1MB in the beginning and 158.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 881621.83ms. Allocated memory was 212.9MB in the beginning and 375.4MB in the end (delta: 162.5MB). Free memory was 157.3MB in the beginning and 204.9MB in the end (delta: -47.6MB). Peak memory consumption was 116.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 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, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 336 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, 40 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 384 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, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 510 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, 43 TransitionsBefore, 43 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, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 638 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, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 644 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.1s, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 20, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 19, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 92 PlacesBefore, 92 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 69, independent conditional: 69, 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: 69, independent: 69, independent conditional: 69, 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: 69, independent: 69, independent conditional: 69, 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: 69, independent: 69, independent conditional: 69, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 69, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 881.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 493.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 133 mSolverCounterUnknown, 520 SdHoareTripleChecker+Valid, 336.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 334.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1923 IncrementalHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 0 mSDtfsCounter, 1923 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 175.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1776occurred in iteration=10, InterpolantAutomatonStates: 61, 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.1s SsaConstructionTime, 47.0s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 9079 SizeOfPredicates, 16 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 6/16 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