/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-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:01:56,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:01:56,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:01:56,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:01:56,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:01:56,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:01:56,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:01:56,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:01:56,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:01:56,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:01:56,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:01:56,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:01:56,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:01:56,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:01:56,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:01:56,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:01:56,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:01:56,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:01:56,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:01:56,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:01:56,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:01:56,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:01:56,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:01:56,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:01:56,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:01:56,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:01:56,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:01:56,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:01:56,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:01:56,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:01:56,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:01:56,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:01:56,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:01:56,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:01:56,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:01:56,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:01:56,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:01:56,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:01:56,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:01:56,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:01:56,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:01:56,245 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:56,275 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:01:56,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:01:56,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:01:56,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:01:56,278 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:01:56,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:01:56,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:01:56,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:01:56,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:01:56,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:01:56,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:01:56,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:01:56,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:01:56,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:01:56,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:01:56,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:01:56,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:01:56,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:01:56,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:01:56,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:01:56,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:01:56,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:01:56,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:01:56,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:01:56,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:01:56,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:01:56,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:01:56,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:01:56,282 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:56,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:01:56,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:01:56,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:01:56,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:01:56,564 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:01:56,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-12-06 05:01:57,673 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:01:57,828 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:01:57,829 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-12-06 05:01:57,837 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b709762/6f7434da41f942d4a6b5e47b8e8ed0af/FLAG7ade9dd55 [2022-12-06 05:01:57,850 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b709762/6f7434da41f942d4a6b5e47b8e8ed0af [2022-12-06 05:01:57,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:01:57,853 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:01:57,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:01:57,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:01:57,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:01:57,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:01:57" (1/1) ... [2022-12-06 05:01:57,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e254c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:57, skipping insertion in model container [2022-12-06 05:01:57,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:01:57" (1/1) ... [2022-12-06 05:01:57,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:01:57,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:01:58,082 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-exp3x3.wvr.c[2625,2638] [2022-12-06 05:01:58,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:01:58,108 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:01:58,153 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-exp3x3.wvr.c[2625,2638] [2022-12-06 05:01:58,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:01:58,169 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:01:58,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:58 WrapperNode [2022-12-06 05:01:58,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:01:58,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:01:58,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:01:58,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:01:58,177 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:58" (1/1) ... [2022-12-06 05:01:58,192 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:58" (1/1) ... [2022-12-06 05:01:58,218 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-12-06 05:01:58,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:01:58,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:01:58,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:01:58,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:01:58,225 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:58" (1/1) ... [2022-12-06 05:01:58,225 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:58" (1/1) ... [2022-12-06 05:01:58,236 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:58" (1/1) ... [2022-12-06 05:01:58,236 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:58" (1/1) ... [2022-12-06 05:01:58,245 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:58" (1/1) ... [2022-12-06 05:01:58,248 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:58" (1/1) ... [2022-12-06 05:01:58,249 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:58" (1/1) ... [2022-12-06 05:01:58,249 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:58" (1/1) ... [2022-12-06 05:01:58,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:01:58,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:01:58,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:01:58,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:01:58,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:58" (1/1) ... [2022-12-06 05:01:58,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:01:58,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:58,297 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:58,330 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:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:01:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:01:58,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:01:58,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:01:58,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:01:58,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:01:58,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 05:01:58,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 05:01:58,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:01:58,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:01:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:01:58,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:01:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:01:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:01:58,349 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:58,496 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:01:58,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:01:58,767 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:01:58,773 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:01:58,773 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:01:58,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:01:58 BoogieIcfgContainer [2022-12-06 05:01:58,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:01:58,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:01:58,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:01:58,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:01:58,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:01:57" (1/3) ... [2022-12-06 05:01:58,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d891f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:01:58, skipping insertion in model container [2022-12-06 05:01:58,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:58" (2/3) ... [2022-12-06 05:01:58,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d891f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:01:58, skipping insertion in model container [2022-12-06 05:01:58,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:01:58" (3/3) ... [2022-12-06 05:01:58,797 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2022-12-06 05:01:58,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:01:58,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:01:58,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:01:58,899 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-06 05:01:58,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 05:01:59,019 INFO L130 PetriNetUnfolder]: 14/156 cut-off events. [2022-12-06 05:01:59,019 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:01:59,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 156 events. 14/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 05:01:59,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 05:01:59,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:59,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:59,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:59,130 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-06 05:01:59,130 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:01:59,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 140 events. 14/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 05:01:59,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:59,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-06 05:02:04,585 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 05:02:04,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:02:04,618 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;@19a3d86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:02:04,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 05:02:04,652 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 05:02:04,653 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:02:04,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:04,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:04,654 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 4 more)] === [2022-12-06 05:02:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash -54134606, now seen corresponding path program 1 times [2022-12-06 05:02:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:04,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974766258] [2022-12-06 05:02:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:05,410 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:02:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:05,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974766258] [2022-12-06 05:02:05,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974766258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:05,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:05,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:02:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741630124] [2022-12-06 05:02:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:05,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:02:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:05,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:02:05,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:02:05,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:05,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 110 flow. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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:05,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:05,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:05,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:05,884 INFO L130 PetriNetUnfolder]: 3473/4229 cut-off events. [2022-12-06 05:02:05,884 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-06 05:02:05,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 4229 events. 3473/4229 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11636 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 6136. Up to 3015 conditions per place. [2022-12-06 05:02:05,908 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 63 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2022-12-06 05:02:05,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 353 flow [2022-12-06 05:02:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:02:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:02:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 05:02:05,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 05:02:05,920 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 72 transitions. [2022-12-06 05:02:05,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 353 flow [2022-12-06 05:02:05,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 307 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 05:02:05,933 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 133 flow [2022-12-06 05:02:05,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2022-12-06 05:02:05,937 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2022-12-06 05:02:05,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:05,939 INFO L89 Accepts]: Start accepts. Operand has 41 places, 43 transitions, 133 flow [2022-12-06 05:02:05,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:05,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:05,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 43 transitions, 133 flow [2022-12-06 05:02:05,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 133 flow [2022-12-06 05:02:05,961 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0][20], [40#L38-1true, 170#true, 67#L54-1true, 46#L103-4true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:05,961 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 05:02:05,961 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:05,961 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:05,961 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:05,962 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][24], [40#L38-1true, 170#true, 20#L104-4true, 61#L70-1true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:05,963 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,963 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,963 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,964 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,964 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][24], [40#L38-1true, 170#true, 20#L104-4true, 61#L70-1true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:05,964 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,965 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,965 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,965 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,965 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:05,966 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][28], [40#L38-1true, 170#true, 114#L78-1true, 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:05,966 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,967 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,967 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,969 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,973 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][28], [40#L38-1true, 170#true, 114#L78-1true, 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:05,974 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,974 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,974 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,974 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,974 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,975 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][28], [40#L38-1true, 114#L78-1true, 170#true, 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:05,975 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,975 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,975 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,975 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,975 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,975 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:05,982 INFO L130 PetriNetUnfolder]: 41/95 cut-off events. [2022-12-06 05:02:05,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:02:05,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 95 events. 41/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 102. Up to 44 conditions per place. [2022-12-06 05:02:05,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 43 transitions, 133 flow [2022-12-06 05:02:05,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 05:02:05,986 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:05,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 05:02:05,988 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 133 flow [2022-12-06 05:02:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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:05,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:05,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:02:05,991 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 4 more)] === [2022-12-06 05:02:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -685639153, now seen corresponding path program 1 times [2022-12-06 05:02:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079750409] [2022-12-06 05:02:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:06,286 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:02:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079750409] [2022-12-06 05:02:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079750409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:06,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468957140] [2022-12-06 05:02:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:06,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:06,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:06,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:06,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:06,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:06,749 INFO L130 PetriNetUnfolder]: 5067/6189 cut-off events. [2022-12-06 05:02:06,749 INFO L131 PetriNetUnfolder]: For 2240/2240 co-relation queries the response was YES. [2022-12-06 05:02:06,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15972 conditions, 6189 events. 5067/6189 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19168 event pairs, 259 based on Foata normal form. 122/6311 useless extension candidates. Maximal degree in co-relation 4985. Up to 3157 conditions per place. [2022-12-06 05:02:06,786 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 116 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2022-12-06 05:02:06,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 126 transitions, 621 flow [2022-12-06 05:02:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 05:02:06,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2022-12-06 05:02:06,788 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 133 flow. Second operand 5 states and 116 transitions. [2022-12-06 05:02:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 126 transitions, 621 flow [2022-12-06 05:02:06,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 126 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:06,792 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 191 flow [2022-12-06 05:02:06,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-12-06 05:02:06,792 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2022-12-06 05:02:06,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:06,793 INFO L89 Accepts]: Start accepts. Operand has 46 places, 50 transitions, 191 flow [2022-12-06 05:02:06,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:06,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:06,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 50 transitions, 191 flow [2022-12-06 05:02:06,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 50 transitions, 191 flow [2022-12-06 05:02:06,798 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0][27], [40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 46#L103-4true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 92#L46-1true]) [2022-12-06 05:02:06,798 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:02:06,798 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:02:06,799 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:06,799 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:06,800 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][32], [40#L38-1true, Black: 179#(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)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 92#L46-1true]) [2022-12-06 05:02:06,801 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:02:06,801 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][32], [40#L38-1true, Black: 179#(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)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 92#L46-1true]) [2022-12-06 05:02:06,801 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:06,801 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:06,802 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 92#L46-1true]) [2022-12-06 05:02:06,802 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,802 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,803 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,803 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,807 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][32], [177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 20#L104-4true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true, 94#thread1EXITtrue]) [2022-12-06 05:02:06,807 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,807 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,807 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,807 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:06,808 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(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)))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:06,808 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,808 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,808 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,808 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,809 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:06,809 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 05:02:06,809 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:06,809 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2022-12-06 05:02:06,809 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:06,810 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:06,810 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:06,810 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,810 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,810 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,810 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:06,810 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,810 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,811 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true, 94#thread1EXITtrue]) [2022-12-06 05:02:06,811 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2022-12-06 05:02:06,811 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 05:02:06,811 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 05:02:06,811 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 05:02:06,811 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true, 94#thread1EXITtrue]) [2022-12-06 05:02:06,811 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 05:02:06,811 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:02:06,811 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:02:06,812 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:02:06,812 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:06,813 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 43#thread2EXITtrue, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true]) [2022-12-06 05:02:06,813 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:02:06,813 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:06,813 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:06,813 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:06,814 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] thread1EXIT-->L106-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][38], [65#L106-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 43#thread2EXITtrue, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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))))]) [2022-12-06 05:02:06,814 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:06,814 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:06,814 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:06,814 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:06,818 INFO L130 PetriNetUnfolder]: 117/208 cut-off events. [2022-12-06 05:02:06,818 INFO L131 PetriNetUnfolder]: For 80/119 co-relation queries the response was YES. [2022-12-06 05:02:06,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 208 events. 117/208 cut-off events. For 80/119 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 459 event pairs, 0 based on Foata normal form. 10/175 useless extension candidates. Maximal degree in co-relation 368. Up to 124 conditions per place. [2022-12-06 05:02:06,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 50 transitions, 191 flow [2022-12-06 05:02:06,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-06 05:02:06,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:06,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:02:06,822 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 191 flow [2022-12-06 05:02:06,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:06,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:06,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:06,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:02:06,823 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 4 more)] === [2022-12-06 05:02:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1491440014, now seen corresponding path program 1 times [2022-12-06 05:02:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:06,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277183231] [2022-12-06 05:02:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:06,998 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:02:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:06,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277183231] [2022-12-06 05:02:06,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277183231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:06,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:06,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117141064] [2022-12-06 05:02:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:06,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:07,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:07,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:07,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:07,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:07,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:07,432 INFO L130 PetriNetUnfolder]: 4881/6003 cut-off events. [2022-12-06 05:02:07,432 INFO L131 PetriNetUnfolder]: For 4584/4584 co-relation queries the response was YES. [2022-12-06 05:02:07,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16717 conditions, 6003 events. 4881/6003 cut-off events. For 4584/4584 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18795 event pairs, 259 based on Foata normal form. 186/6189 useless extension candidates. Maximal degree in co-relation 7058. Up to 3157 conditions per place. [2022-12-06 05:02:07,462 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 116 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2022-12-06 05:02:07,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 642 flow [2022-12-06 05:02:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-06 05:02:07,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 05:02:07,464 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 191 flow. Second operand 5 states and 115 transitions. [2022-12-06 05:02:07,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 642 flow [2022-12-06 05:02:07,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:02:07,471 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 205 flow [2022-12-06 05:02:07,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-06 05:02:07,472 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2022-12-06 05:02:07,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:07,472 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 205 flow [2022-12-06 05:02:07,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:07,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:07,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 205 flow [2022-12-06 05:02:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 205 flow [2022-12-06 05:02:07,477 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0][26], [182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 46#L103-4true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:07,477 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:02:07,477 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:07,477 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:02:07,477 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:02:07,479 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][31], [182#true, 40#L38-1true, Black: 179#(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)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 92#L46-1true]) [2022-12-06 05:02:07,479 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2022-12-06 05:02:07,479 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:02:07,479 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:02:07,479 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:02:07,479 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][31], [182#true, 40#L38-1true, Black: 179#(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)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:07,479 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:02:07,480 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:07,480 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:07,480 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:07,480 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:07,480 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [182#true, 40#L38-1true, 114#L78-1true, Black: 179#(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)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 63#L105-4true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:07,480 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,481 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,481 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,481 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,481 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [40#L38-1true, 114#L78-1true, Black: 179#(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)))), 61#L70-1true, 67#L54-1true, 63#L105-4true, 82#L62-1true, 184#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 182#true, 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:07,481 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,481 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,482 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,482 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,483 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [182#true, 40#L38-1true, 114#L78-1true, Black: 179#(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)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 63#L105-4true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 92#L46-1true]) [2022-12-06 05:02:07,483 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:07,483 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [182#true, 40#L38-1true, 114#L78-1true, Black: 179#(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)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 63#L105-4true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 92#L46-1true]) [2022-12-06 05:02:07,483 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,483 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,484 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:07,484 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:07,484 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [114#L78-1true, 63#L105-4true, 43#thread2EXITtrue, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 40#L38-1true, 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 182#true]) [2022-12-06 05:02:07,484 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:02:07,485 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:07,485 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:07,485 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:07,485 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] thread1EXIT-->L106-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][37], [65#L106-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 43#thread2EXITtrue, 82#L62-1true, Black: 182#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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))))]) [2022-12-06 05:02:07,485 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:07,486 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:07,486 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:07,486 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:07,490 INFO L130 PetriNetUnfolder]: 91/173 cut-off events. [2022-12-06 05:02:07,491 INFO L131 PetriNetUnfolder]: For 119/159 co-relation queries the response was YES. [2022-12-06 05:02:07,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 173 events. 91/173 cut-off events. For 119/159 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 349 event pairs, 0 based on Foata normal form. 9/147 useless extension candidates. Maximal degree in co-relation 299. Up to 94 conditions per place. [2022-12-06 05:02:07,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 205 flow [2022-12-06 05:02:07,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 05:02:07,494 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:07,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:02:07,495 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 205 flow [2022-12-06 05:02:07,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:07,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:07,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:07,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:02:07,496 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 4 more)] === [2022-12-06 05:02:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1579273175, now seen corresponding path program 2 times [2022-12-06 05:02:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:07,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079072818] [2022-12-06 05:02:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:07,653 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:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:07,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079072818] [2022-12-06 05:02:07,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079072818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:07,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052932315] [2022-12-06 05:02:07,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:02:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:07,657 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:02:07,691 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:02:07,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:02:07,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:02:07,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:07,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:08,160 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:08,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:08,218 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:08,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052932315] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:08,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:08,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:02:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913536773] [2022-12-06 05:02:08,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:08,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:02:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:08,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:02:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:08,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:08,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:08,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:08,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:08,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:08,875 INFO L130 PetriNetUnfolder]: 5649/6927 cut-off events. [2022-12-06 05:02:08,875 INFO L131 PetriNetUnfolder]: For 8469/8469 co-relation queries the response was YES. [2022-12-06 05:02:08,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20564 conditions, 6927 events. 5649/6927 cut-off events. For 8469/8469 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21270 event pairs, 1803 based on Foata normal form. 156/7083 useless extension candidates. Maximal degree in co-relation 9382. Up to 3643 conditions per place. [2022-12-06 05:02:08,916 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 114 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2022-12-06 05:02:08,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 662 flow [2022-12-06 05:02:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 05:02:08,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2022-12-06 05:02:08,918 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 205 flow. Second operand 5 states and 116 transitions. [2022-12-06 05:02:08,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 662 flow [2022-12-06 05:02:08,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:08,924 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 248 flow [2022-12-06 05:02:08,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 05:02:08,924 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2022-12-06 05:02:08,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:08,924 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 248 flow [2022-12-06 05:02:08,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:08,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:08,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 248 flow [2022-12-06 05:02:08,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 248 flow [2022-12-06 05:02:08,932 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][34], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 20#L104-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true]) [2022-12-06 05:02:08,932 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:02:08,932 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:08,932 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:08,932 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:08,933 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][34], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 20#L104-4true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,933 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:02:08,933 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:08,933 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:02:08,933 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:02:08,935 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 40#L38-1true, Black: 179#(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)))), 61#L70-1true, 67#L54-1true, Black: 182#true, 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 82#L62-1true, 196#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,935 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:02:08,935 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:08,935 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:08,935 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:08,936 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true]) [2022-12-06 05:02:08,936 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:08,937 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true]) [2022-12-06 05:02:08,937 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,937 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,938 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 174#true, 182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,938 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 05:02:08,938 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:08,938 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:08,938 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:02:08,939 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, 63#L105-4true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 182#true, 40#L38-1true, Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,939 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,939 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:02:08,939 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,939 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,939 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:02:08,940 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 94#thread1EXITtrue, 182#true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,940 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,940 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,940 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,940 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,941 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, 63#L105-4true, 43#thread2EXITtrue, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 40#L38-1true, 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, Black: 182#true, 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,941 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,941 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,941 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,941 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:02:08,941 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] thread2EXIT-->L107-2: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork4_thidvar2_4 0) (= v_thread2Thread1of1ForFork4_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} AuxVars[] AssignedVars[][42], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 81#L107-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, Black: 182#true, 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,942 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:08,942 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] thread2EXIT-->L107-2: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork4_thidvar2_4 0) (= v_thread2Thread1of1ForFork4_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} AuxVars[] AssignedVars[][42], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 81#L107-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, Black: 182#true, 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:08,942 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:08,942 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:08,945 INFO L130 PetriNetUnfolder]: 135/230 cut-off events. [2022-12-06 05:02:08,945 INFO L131 PetriNetUnfolder]: For 240/280 co-relation queries the response was YES. [2022-12-06 05:02:08,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 230 events. 135/230 cut-off events. For 240/280 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 505 event pairs, 1 based on Foata normal form. 6/191 useless extension candidates. Maximal degree in co-relation 512. Up to 143 conditions per place. [2022-12-06 05:02:08,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 248 flow [2022-12-06 05:02:08,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 05:02:08,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:08,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 05:02:08,950 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 248 flow [2022-12-06 05:02:08,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:08,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:08,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:08,965 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:02:09,155 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:02:09,155 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 4 more)] === [2022-12-06 05:02:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash 873411309, now seen corresponding path program 1 times [2022-12-06 05:02:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:09,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473062932] [2022-12-06 05:02:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:09,261 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:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:09,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473062932] [2022-12-06 05:02:09,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473062932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:09,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785071206] [2022-12-06 05:02:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:09,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:09,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:09,263 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:02:09,265 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:02:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:09,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:09,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:09,470 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:09,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:09,513 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:09,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785071206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:09,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:09,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:02:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284049571] [2022-12-06 05:02:09,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:09,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:02:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:02:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:09,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:09,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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:09,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:09,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:09,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:10,616 INFO L130 PetriNetUnfolder]: 13057/16015 cut-off events. [2022-12-06 05:02:10,617 INFO L131 PetriNetUnfolder]: For 28062/28062 co-relation queries the response was YES. [2022-12-06 05:02:10,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51297 conditions, 16015 events. 13057/16015 cut-off events. For 28062/28062 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 57652 event pairs, 2873 based on Foata normal form. 408/16423 useless extension candidates. Maximal degree in co-relation 34546. Up to 6947 conditions per place. [2022-12-06 05:02:10,704 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 150 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2022-12-06 05:02:10,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 158 transitions, 1082 flow [2022-12-06 05:02:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-06 05:02:10,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2022-12-06 05:02:10,706 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 248 flow. Second operand 5 states and 118 transitions. [2022-12-06 05:02:10,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 158 transitions, 1082 flow [2022-12-06 05:02:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 158 transitions, 1055 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:10,723 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 294 flow [2022-12-06 05:02:10,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-12-06 05:02:10,726 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2022-12-06 05:02:10,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:10,726 INFO L89 Accepts]: Start accepts. Operand has 62 places, 57 transitions, 294 flow [2022-12-06 05:02:10,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:10,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:10,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 57 transitions, 294 flow [2022-12-06 05:02:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 57 transitions, 294 flow [2022-12-06 05:02:10,769 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][49], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 82#L62-1true, Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:10,770 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 05:02:10,770 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:10,770 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:10,770 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:10,771 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][49], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, 2#thread4EXITtrue, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:10,771 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 05:02:10,771 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:10,771 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:10,771 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:10,772 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][49], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 2#thread4EXITtrue, 385#true, 107#L108-2true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, Black: 182#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:10,772 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 05:02:10,772 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:10,772 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:10,772 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:10,779 INFO L130 PetriNetUnfolder]: 418/658 cut-off events. [2022-12-06 05:02:10,779 INFO L131 PetriNetUnfolder]: For 765/932 co-relation queries the response was YES. [2022-12-06 05:02:10,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 658 events. 418/658 cut-off events. For 765/932 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2306 event pairs, 65 based on Foata normal form. 16/570 useless extension candidates. Maximal degree in co-relation 1810. Up to 445 conditions per place. [2022-12-06 05:02:10,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 57 transitions, 294 flow [2022-12-06 05:02:10,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-06 05:02:10,793 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:10,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 05:02:10,795 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 294 flow [2022-12-06 05:02:10,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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:10,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:10,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:10,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:11,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:11,001 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 4 more)] === [2022-12-06 05:02:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1274253357, now seen corresponding path program 2 times [2022-12-06 05:02:11,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:11,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872363779] [2022-12-06 05:02:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:11,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:11,186 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:02:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:11,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872363779] [2022-12-06 05:02:11,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872363779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:11,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:11,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497220767] [2022-12-06 05:02:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:11,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:11,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:11,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:11,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:11,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:11,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:11,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:12,243 INFO L130 PetriNetUnfolder]: 11213/13735 cut-off events. [2022-12-06 05:02:12,244 INFO L131 PetriNetUnfolder]: For 26978/26978 co-relation queries the response was YES. [2022-12-06 05:02:12,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50231 conditions, 13735 events. 11213/13735 cut-off events. For 26978/26978 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49331 event pairs, 471 based on Foata normal form. 268/14003 useless extension candidates. Maximal degree in co-relation 34555. Up to 5849 conditions per place. [2022-12-06 05:02:12,326 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 150 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2022-12-06 05:02:12,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 161 transitions, 1148 flow [2022-12-06 05:02:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 05:02:12,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2022-12-06 05:02:12,328 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 294 flow. Second operand 5 states and 112 transitions. [2022-12-06 05:02:12,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 161 transitions, 1148 flow [2022-12-06 05:02:12,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 161 transitions, 1148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:02:12,379 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 355 flow [2022-12-06 05:02:12,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2022-12-06 05:02:12,380 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2022-12-06 05:02:12,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:12,380 INFO L89 Accepts]: Start accepts. Operand has 67 places, 62 transitions, 355 flow [2022-12-06 05:02:12,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:12,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:12,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 62 transitions, 355 flow [2022-12-06 05:02:12,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 355 flow [2022-12-06 05:02:12,406 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][54], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 385#true, 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), 82#L62-1true, Black: 182#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:12,407 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 05:02:12,407 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:12,407 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:12,407 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:12,407 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][54], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:12,407 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 05:02:12,407 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:12,407 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:12,408 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:12,412 INFO L130 PetriNetUnfolder]: 293/479 cut-off events. [2022-12-06 05:02:12,412 INFO L131 PetriNetUnfolder]: For 699/851 co-relation queries the response was YES. [2022-12-06 05:02:12,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 479 events. 293/479 cut-off events. For 699/851 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1588 event pairs, 36 based on Foata normal form. 12/432 useless extension candidates. Maximal degree in co-relation 1445. Up to 311 conditions per place. [2022-12-06 05:02:12,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 355 flow [2022-12-06 05:02:12,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-06 05:02:12,422 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:12,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 05:02:12,423 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 355 flow [2022-12-06 05:02:12,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:12,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:12,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:12,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:02:12,423 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 4 more)] === [2022-12-06 05:02:12,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash -427571439, now seen corresponding path program 1 times [2022-12-06 05:02:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:12,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665838683] [2022-12-06 05:02:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:12,585 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:02:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:12,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665838683] [2022-12-06 05:02:12,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665838683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:12,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:12,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:12,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271683834] [2022-12-06 05:02:12,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:12,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:12,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:12,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:12,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:12,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:13,602 INFO L130 PetriNetUnfolder]: 10921/13443 cut-off events. [2022-12-06 05:02:13,602 INFO L131 PetriNetUnfolder]: For 31534/31534 co-relation queries the response was YES. [2022-12-06 05:02:13,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52574 conditions, 13443 events. 10921/13443 cut-off events. For 31534/31534 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49085 event pairs, 471 based on Foata normal form. 292/13735 useless extension candidates. Maximal degree in co-relation 36230. Up to 5557 conditions per place. [2022-12-06 05:02:13,667 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 151 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2022-12-06 05:02:13,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 159 transitions, 1161 flow [2022-12-06 05:02:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 05:02:13,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 05:02:13,669 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 355 flow. Second operand 5 states and 111 transitions. [2022-12-06 05:02:13,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 159 transitions, 1161 flow [2022-12-06 05:02:13,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1150 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:13,721 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 358 flow [2022-12-06 05:02:13,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2022-12-06 05:02:13,722 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2022-12-06 05:02:13,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:13,722 INFO L89 Accepts]: Start accepts. Operand has 71 places, 61 transitions, 358 flow [2022-12-06 05:02:13,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:13,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:13,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 61 transitions, 358 flow [2022-12-06 05:02:13,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 358 flow [2022-12-06 05:02:13,742 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][53], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), 82#L62-1true, Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 589#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:13,742 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 05:02:13,742 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,742 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,742 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][53], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 385#true, 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 182#true, 82#L62-1true, 589#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:13,743 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][53], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 114#L78-1true, 189#true, 592#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 2#thread4EXITtrue, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 385#true, 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~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)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 589#true, Black: 179#(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)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 182#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:13,743 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:13,743 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 05:02:13,747 INFO L130 PetriNetUnfolder]: 283/473 cut-off events. [2022-12-06 05:02:13,747 INFO L131 PetriNetUnfolder]: For 761/915 co-relation queries the response was YES. [2022-12-06 05:02:13,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 473 events. 283/473 cut-off events. For 761/915 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1581 event pairs, 36 based on Foata normal form. 13/424 useless extension candidates. Maximal degree in co-relation 1458. Up to 298 conditions per place. [2022-12-06 05:02:13,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 61 transitions, 358 flow [2022-12-06 05:02:13,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-06 05:02:13,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:13,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 05:02:13,772 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 358 flow [2022-12-06 05:02:13,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:13,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:13,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:13,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:02:13,773 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 4 more)] === [2022-12-06 05:02:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash -614309630, now seen corresponding path program 1 times [2022-12-06 05:02:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:13,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237396558] [2022-12-06 05:02:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:13,908 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:13,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:13,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237396558] [2022-12-06 05:02:13,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237396558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:13,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976005666] [2022-12-06 05:02:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:13,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:13,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:13,912 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:02:13,952 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,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:14,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:14,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:14,147 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:14,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:14,186 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:14,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976005666] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:14,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:14,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:02:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920216576] [2022-12-06 05:02:14,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:02:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:02:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:14,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:14,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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:14,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:14,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:16,158 INFO L130 PetriNetUnfolder]: 24421/30017 cut-off events. [2022-12-06 05:02:16,158 INFO L131 PetriNetUnfolder]: For 90165/90165 co-relation queries the response was YES. [2022-12-06 05:02:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120109 conditions, 30017 events. 24421/30017 cut-off events. For 90165/90165 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 118167 event pairs, 4823 based on Foata normal form. 744/30761 useless extension candidates. Maximal degree in co-relation 77250. Up to 13194 conditions per place. [2022-12-06 05:02:16,368 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 178 selfloop transitions, 8 changer transitions 0/186 dead transitions. [2022-12-06 05:02:16,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 186 transitions, 1492 flow [2022-12-06 05:02:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-06 05:02:16,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2022-12-06 05:02:16,370 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 358 flow. Second operand 5 states and 110 transitions. [2022-12-06 05:02:16,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 186 transitions, 1492 flow [2022-12-06 05:02:16,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 186 transitions, 1457 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:16,403 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 402 flow [2022-12-06 05:02:16,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2022-12-06 05:02:16,404 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2022-12-06 05:02:16,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:16,404 INFO L89 Accepts]: Start accepts. Operand has 77 places, 66 transitions, 402 flow [2022-12-06 05:02:16,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:16,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:16,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 66 transitions, 402 flow [2022-12-06 05:02:16,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 402 flow [2022-12-06 05:02:16,457 INFO L130 PetriNetUnfolder]: 477/860 cut-off events. [2022-12-06 05:02:16,457 INFO L131 PetriNetUnfolder]: For 1239/1557 co-relation queries the response was YES. [2022-12-06 05:02:16,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 860 events. 477/860 cut-off events. For 1239/1557 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3872 event pairs, 77 based on Foata normal form. 21/761 useless extension candidates. Maximal degree in co-relation 2690. Up to 504 conditions per place. [2022-12-06 05:02:16,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 66 transitions, 402 flow [2022-12-06 05:02:16,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 1522 [2022-12-06 05:02:16,474 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:16,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 05:02:16,475 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 402 flow [2022-12-06 05:02:16,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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:16,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:16,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:16,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:02:16,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:16,680 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 4 more)] === [2022-12-06 05:02:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1599300327, now seen corresponding path program 1 times [2022-12-06 05:02:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:16,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907738387] [2022-12-06 05:02:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:16,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:16,907 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:02:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:16,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907738387] [2022-12-06 05:02:16,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907738387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:16,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:16,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976033766] [2022-12-06 05:02:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:16,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:16,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:16,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:16,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:16,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:18,982 INFO L130 PetriNetUnfolder]: 24045/29641 cut-off events. [2022-12-06 05:02:18,982 INFO L131 PetriNetUnfolder]: For 88745/88745 co-relation queries the response was YES. [2022-12-06 05:02:19,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130397 conditions, 29641 events. 24045/29641 cut-off events. For 88745/88745 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 119375 event pairs, 1383 based on Foata normal form. 376/30017 useless extension candidates. Maximal degree in co-relation 89224. Up to 12818 conditions per place. [2022-12-06 05:02:19,168 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 184 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2022-12-06 05:02:19,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 194 transitions, 1591 flow [2022-12-06 05:02:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-06 05:02:19,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2022-12-06 05:02:19,169 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 402 flow. Second operand 5 states and 108 transitions. [2022-12-06 05:02:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 194 transitions, 1591 flow [2022-12-06 05:02:19,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 194 transitions, 1591 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:02:19,385 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 465 flow [2022-12-06 05:02:19,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2022-12-06 05:02:19,386 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2022-12-06 05:02:19,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:19,386 INFO L89 Accepts]: Start accepts. Operand has 82 places, 71 transitions, 465 flow [2022-12-06 05:02:19,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:19,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:19,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 71 transitions, 465 flow [2022-12-06 05:02:19,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 71 transitions, 465 flow [2022-12-06 05:02:19,434 INFO L130 PetriNetUnfolder]: 452/808 cut-off events. [2022-12-06 05:02:19,434 INFO L131 PetriNetUnfolder]: For 1303/1650 co-relation queries the response was YES. [2022-12-06 05:02:19,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 808 events. 452/808 cut-off events. For 1303/1650 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3493 event pairs, 67 based on Foata normal form. 21/731 useless extension candidates. Maximal degree in co-relation 2679. Up to 492 conditions per place. [2022-12-06 05:02:19,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 71 transitions, 465 flow [2022-12-06 05:02:19,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 1820 [2022-12-06 05:02:19,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:19,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 05:02:19,450 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 465 flow [2022-12-06 05:02:19,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:19,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:19,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:02:19,450 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 4 more)] === [2022-12-06 05:02:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1571483643, now seen corresponding path program 2 times [2022-12-06 05:02:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:19,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365227092] [2022-12-06 05:02:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:19,714 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:02:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:19,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365227092] [2022-12-06 05:02:19,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365227092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:19,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:19,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887657145] [2022-12-06 05:02:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:19,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:19,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:19,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:19,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:19,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:22,050 INFO L130 PetriNetUnfolder]: 27453/33785 cut-off events. [2022-12-06 05:02:22,051 INFO L131 PetriNetUnfolder]: For 105497/105497 co-relation queries the response was YES. [2022-12-06 05:02:22,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155104 conditions, 33785 events. 27453/33785 cut-off events. For 105497/105497 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 135511 event pairs, 4471 based on Foata normal form. 736/34521 useless extension candidates. Maximal degree in co-relation 106141. Up to 19825 conditions per place. [2022-12-06 05:02:22,241 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 177 selfloop transitions, 10 changer transitions 0/187 dead transitions. [2022-12-06 05:02:22,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 187 transitions, 1566 flow [2022-12-06 05:02:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 05:02:22,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2022-12-06 05:02:22,242 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 465 flow. Second operand 5 states and 104 transitions. [2022-12-06 05:02:22,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 187 transitions, 1566 flow [2022-12-06 05:02:22,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 187 transitions, 1551 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:22,622 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 504 flow [2022-12-06 05:02:22,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2022-12-06 05:02:22,622 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2022-12-06 05:02:22,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:22,622 INFO L89 Accepts]: Start accepts. Operand has 87 places, 74 transitions, 504 flow [2022-12-06 05:02:22,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:22,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:22,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 74 transitions, 504 flow [2022-12-06 05:02:22,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 74 transitions, 504 flow [2022-12-06 05:02:22,779 INFO L130 PetriNetUnfolder]: 643/1103 cut-off events. [2022-12-06 05:02:22,779 INFO L131 PetriNetUnfolder]: For 2092/2507 co-relation queries the response was YES. [2022-12-06 05:02:22,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 1103 events. 643/1103 cut-off events. For 2092/2507 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5010 event pairs, 100 based on Foata normal form. 29/1013 useless extension candidates. Maximal degree in co-relation 3928. Up to 692 conditions per place. [2022-12-06 05:02:22,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 74 transitions, 504 flow [2022-12-06 05:02:22,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 1982 [2022-12-06 05:02:22,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:02:22,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:22,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 05:02:22,855 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 514 flow [2022-12-06 05:02:22,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:22,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:22,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:22,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:02:22,856 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 4 more)] === [2022-12-06 05:02:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2042265612, now seen corresponding path program 2 times [2022-12-06 05:02:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:22,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504873167] [2022-12-06 05:02:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:22,990 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:02:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504873167] [2022-12-06 05:02:22,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504873167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:22,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:22,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118833095] [2022-12-06 05:02:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:22,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:22,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:02:22,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:22,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:22,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:02:22,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:24,871 INFO L130 PetriNetUnfolder]: 24413/29993 cut-off events. [2022-12-06 05:02:24,871 INFO L131 PetriNetUnfolder]: For 97517/97517 co-relation queries the response was YES. [2022-12-06 05:02:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145367 conditions, 29993 events. 24413/29993 cut-off events. For 97517/97517 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 119188 event pairs, 1391 based on Foata normal form. 368/30361 useless extension candidates. Maximal degree in co-relation 112049. Up to 13182 conditions per place. [2022-12-06 05:02:25,034 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 184 selfloop transitions, 9 changer transitions 1/194 dead transitions. [2022-12-06 05:02:25,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 194 transitions, 1655 flow [2022-12-06 05:02:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-06 05:02:25,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2022-12-06 05:02:25,035 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 514 flow. Second operand 5 states and 108 transitions. [2022-12-06 05:02:25,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 194 transitions, 1655 flow [2022-12-06 05:02:25,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 194 transitions, 1625 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:25,671 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 491 flow [2022-12-06 05:02:25,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2022-12-06 05:02:25,673 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2022-12-06 05:02:25,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:25,673 INFO L89 Accepts]: Start accepts. Operand has 90 places, 72 transitions, 491 flow [2022-12-06 05:02:25,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:25,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:25,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 72 transitions, 491 flow [2022-12-06 05:02:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 72 transitions, 491 flow [2022-12-06 05:02:25,743 INFO L130 PetriNetUnfolder]: 575/961 cut-off events. [2022-12-06 05:02:25,744 INFO L131 PetriNetUnfolder]: For 1968/2378 co-relation queries the response was YES. [2022-12-06 05:02:25,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 961 events. 575/961 cut-off events. For 1968/2378 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4004 event pairs, 91 based on Foata normal form. 26/892 useless extension candidates. Maximal degree in co-relation 3461. Up to 617 conditions per place. [2022-12-06 05:02:25,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 72 transitions, 491 flow [2022-12-06 05:02:25,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 1902 [2022-12-06 05:02:25,769 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:25,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 05:02:25,769 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 491 flow [2022-12-06 05:02:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:25,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:25,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:02:25,770 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:02:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1879020941, now seen corresponding path program 1 times [2022-12-06 05:02:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:25,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306301958] [2022-12-06 05:02:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:26,505 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:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:26,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306301958] [2022-12-06 05:02:26,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306301958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:26,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649974260] [2022-12-06 05:02:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:26,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:26,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:26,508 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:02:26,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:02:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:27,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:02:27,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:31,620 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:31,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:35,892 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,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649974260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:35,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:35,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:02:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768602839] [2022-12-06 05:02:35,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:35,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:02:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:02:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=102, Unknown=1, NotChecked=0, Total=156 [2022-12-06 05:02:35,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:02:35,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 491 flow. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:35,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:02:35,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:42,854 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:02:44,917 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:02:50,028 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:02:51,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:02:53,566 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:02:55,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:02:57,622 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:02:59,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:13,016 INFO L130 PetriNetUnfolder]: 33895/41894 cut-off events. [2022-12-06 05:03:13,017 INFO L131 PetriNetUnfolder]: For 141681/141681 co-relation queries the response was YES. [2022-12-06 05:03:13,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202300 conditions, 41894 events. 33895/41894 cut-off events. For 141681/141681 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 176048 event pairs, 5285 based on Foata normal form. 65/41959 useless extension candidates. Maximal degree in co-relation 156089. Up to 30871 conditions per place. [2022-12-06 05:03:13,455 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 318 selfloop transitions, 117 changer transitions 12/447 dead transitions. [2022-12-06 05:03:13,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 447 transitions, 3589 flow [2022-12-06 05:03:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:03:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:03:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 306 transitions. [2022-12-06 05:03:13,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6194331983805668 [2022-12-06 05:03:13,457 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 491 flow. Second operand 13 states and 306 transitions. [2022-12-06 05:03:13,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 447 transitions, 3589 flow [2022-12-06 05:03:14,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 447 transitions, 3544 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 05:03:14,577 INFO L231 Difference]: Finished difference. Result has 106 places, 183 transitions, 1829 flow [2022-12-06 05:03:14,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1829, PETRI_PLACES=106, PETRI_TRANSITIONS=183} [2022-12-06 05:03:14,577 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2022-12-06 05:03:14,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:14,577 INFO L89 Accepts]: Start accepts. Operand has 106 places, 183 transitions, 1829 flow [2022-12-06 05:03:14,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:14,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:14,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 183 transitions, 1829 flow [2022-12-06 05:03:14,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 183 transitions, 1829 flow [2022-12-06 05:03:14,678 INFO L130 PetriNetUnfolder]: 798/1347 cut-off events. [2022-12-06 05:03:14,679 INFO L131 PetriNetUnfolder]: For 3979/4701 co-relation queries the response was YES. [2022-12-06 05:03:14,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 1347 events. 798/1347 cut-off events. For 3979/4701 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6133 event pairs, 89 based on Foata normal form. 51/1291 useless extension candidates. Maximal degree in co-relation 6281. Up to 861 conditions per place. [2022-12-06 05:03:14,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 183 transitions, 1829 flow [2022-12-06 05:03:14,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 4388 [2022-12-06 05:03:14,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:03:14,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:03:14,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:03:14,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 05:03:14,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:03:14,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:03:14,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:03:15,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:03:15,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 05:03:15,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:03:15,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 05:03:15,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:03:15,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 05:03:15,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:03:15,371 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:03:15,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 795 [2022-12-06 05:03:15,372 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 183 transitions, 1986 flow [2022-12-06 05:03:15,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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:03:15,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:15,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:15,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:03:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:15,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:03:15,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 889327381, now seen corresponding path program 2 times [2022-12-06 05:03:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:15,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452707440] [2022-12-06 05:03:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:15,710 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:03:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:15,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452707440] [2022-12-06 05:03:15,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452707440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:15,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159220722] [2022-12-06 05:03:15,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:03:15,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:15,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:15,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:03:15,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:03:15,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:03:15,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:03:15,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:15,971 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:03:15,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:16,020 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:03:16,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159220722] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:16,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:16,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:03:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493189279] [2022-12-06 05:03:16,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:16,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:03:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:03:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:03:16,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 05:03:16,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 183 transitions, 1986 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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:03:16,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:16,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 05:03:16,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:20,314 INFO L130 PetriNetUnfolder]: 37993/46794 cut-off events. [2022-12-06 05:03:20,314 INFO L131 PetriNetUnfolder]: For 229515/229515 co-relation queries the response was YES. [2022-12-06 05:03:20,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256720 conditions, 46794 events. 37993/46794 cut-off events. For 229515/229515 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 199427 event pairs, 8955 based on Foata normal form. 1060/47854 useless extension candidates. Maximal degree in co-relation 243985. Up to 21034 conditions per place. [2022-12-06 05:03:20,671 INFO L137 encePairwiseOnDemand]: 46/54 looper letters, 324 selfloop transitions, 34 changer transitions 1/359 dead transitions. [2022-12-06 05:03:20,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 359 transitions, 4211 flow [2022-12-06 05:03:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:03:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:03:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-12-06 05:03:20,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-06 05:03:20,672 INFO L175 Difference]: Start difference. First operand has 106 places, 183 transitions, 1986 flow. Second operand 5 states and 130 transitions. [2022-12-06 05:03:20,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 359 transitions, 4211 flow [2022-12-06 05:03:21,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 359 transitions, 4033 flow, removed 82 selfloop flow, removed 1 redundant places. [2022-12-06 05:03:21,528 INFO L231 Difference]: Finished difference. Result has 111 places, 191 transitions, 2032 flow [2022-12-06 05:03:21,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2032, PETRI_PLACES=111, PETRI_TRANSITIONS=191} [2022-12-06 05:03:21,529 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2022-12-06 05:03:21,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:21,529 INFO L89 Accepts]: Start accepts. Operand has 111 places, 191 transitions, 2032 flow [2022-12-06 05:03:21,530 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:21,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:21,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 191 transitions, 2032 flow [2022-12-06 05:03:21,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 191 transitions, 2032 flow [2022-12-06 05:03:21,644 INFO L130 PetriNetUnfolder]: 1108/1831 cut-off events. [2022-12-06 05:03:21,644 INFO L131 PetriNetUnfolder]: For 6946/9831 co-relation queries the response was YES. [2022-12-06 05:03:21,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8827 conditions, 1831 events. 1108/1831 cut-off events. For 6946/9831 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9025 event pairs, 87 based on Foata normal form. 69/1800 useless extension candidates. Maximal degree in co-relation 8411. Up to 1108 conditions per place. [2022-12-06 05:03:21,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 191 transitions, 2032 flow [2022-12-06 05:03:21,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 4582 [2022-12-06 05:03:21,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [556] L78-1-->L54-1: Formula: (let ((.cse0 (mod v_~n~0_91 4294967296))) (and (= 0 |v_thread6Thread1of1ForFork1_#res.offset_27|) (< (mod v_~x3~0_69 4294967296) .cse0) (= (* v_~x3~0_69 2) v_~x3~0_68) (not (< (mod v_~x6~0_97 4294967296) .cse0)) (= |v_thread6Thread1of1ForFork1_#res.base_27| 0))) InVars {~x3~0=v_~x3~0_69, ~x6~0=v_~x6~0_97, ~n~0=v_~n~0_91} OutVars{~x3~0=v_~x3~0_68, thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_27|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_27|, ~x6~0=v_~x6~0_97, ~n~0=v_~n~0_91} AuxVars[] AssignedVars[~x3~0, thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] [2022-12-06 05:03:21,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:03:21,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:03:21,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:03:21,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:03:21,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 353 [2022-12-06 05:03:21,882 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 191 transitions, 2076 flow [2022-12-06 05:03:21,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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:03:21,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:21,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:21,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:03:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 05:03:22,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:03:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1661654092, now seen corresponding path program 2 times [2022-12-06 05:03:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:22,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965584562] [2022-12-06 05:03:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:22,192 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:03:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:22,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965584562] [2022-12-06 05:03:22,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965584562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:03:22,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:03:22,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:03:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834596662] [2022-12-06 05:03:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:03:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:03:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:22,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:03:22,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:03:22,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:03:22,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 191 transitions, 2076 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:03:22,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:22,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:03:22,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:26,290 INFO L130 PetriNetUnfolder]: 41143/50476 cut-off events. [2022-12-06 05:03:26,290 INFO L131 PetriNetUnfolder]: For 303221/303221 co-relation queries the response was YES. [2022-12-06 05:03:26,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287673 conditions, 50476 events. 41143/50476 cut-off events. For 303221/303221 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 211853 event pairs, 12347 based on Foata normal form. 852/51328 useless extension candidates. Maximal degree in co-relation 282433. Up to 23145 conditions per place. [2022-12-06 05:03:26,800 INFO L137 encePairwiseOnDemand]: 50/58 looper letters, 342 selfloop transitions, 34 changer transitions 4/380 dead transitions. [2022-12-06 05:03:26,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 380 transitions, 4571 flow [2022-12-06 05:03:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:03:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:03:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2022-12-06 05:03:26,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2022-12-06 05:03:26,802 INFO L175 Difference]: Start difference. First operand has 110 places, 191 transitions, 2076 flow. Second operand 5 states and 141 transitions. [2022-12-06 05:03:26,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 380 transitions, 4571 flow [2022-12-06 05:03:28,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 380 transitions, 4404 flow, removed 57 selfloop flow, removed 1 redundant places. [2022-12-06 05:03:28,072 INFO L231 Difference]: Finished difference. Result has 115 places, 199 transitions, 2203 flow [2022-12-06 05:03:28,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2203, PETRI_PLACES=115, PETRI_TRANSITIONS=199} [2022-12-06 05:03:28,073 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 65 predicate places. [2022-12-06 05:03:28,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:28,073 INFO L89 Accepts]: Start accepts. Operand has 115 places, 199 transitions, 2203 flow [2022-12-06 05:03:28,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:28,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:28,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 199 transitions, 2203 flow [2022-12-06 05:03:28,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 199 transitions, 2203 flow [2022-12-06 05:03:28,326 INFO L130 PetriNetUnfolder]: 1519/2266 cut-off events. [2022-12-06 05:03:28,327 INFO L131 PetriNetUnfolder]: For 9580/14191 co-relation queries the response was YES. [2022-12-06 05:03:28,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11842 conditions, 2266 events. 1519/2266 cut-off events. For 9580/14191 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9973 event pairs, 121 based on Foata normal form. 26/2178 useless extension candidates. Maximal degree in co-relation 11440. Up to 1532 conditions per place. [2022-12-06 05:03:28,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 199 transitions, 2203 flow [2022-12-06 05:03:28,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 4676 [2022-12-06 05:03:28,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:03:28,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:03:28,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [558] L78-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_95 4294967296))) (and (not (< (mod v_~x6~0_101 4294967296) .cse0)) (= (* v_~x1~0_73 2) v_~x1~0_72) (< (mod v_~x1~0_73 4294967296) .cse0) (= |v_thread6Thread1of1ForFork1_#res.base_31| 0) (= 0 |v_thread6Thread1of1ForFork1_#res.offset_31|))) InVars {~x6~0=v_~x6~0_101, ~n~0=v_~n~0_95, ~x1~0=v_~x1~0_73} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_31|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_31|, ~x6~0=v_~x6~0_101, ~n~0=v_~n~0_95, ~x1~0=v_~x1~0_72} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset, ~x1~0] [2022-12-06 05:03:28,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:03:28,707 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:03:28,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 634 [2022-12-06 05:03:28,707 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 199 transitions, 2247 flow [2022-12-06 05:03:28,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:03:28,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:28,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:03:28,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:03:28,708 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:03:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1591836924, now seen corresponding path program 1 times [2022-12-06 05:03:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075299285] [2022-12-06 05:03:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:29,092 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:03:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:29,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075299285] [2022-12-06 05:03:29,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075299285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:29,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983845465] [2022-12-06 05:03:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:29,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:29,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:29,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:29,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:03:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:29,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:03:29,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:36,855 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:03:36,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:37,863 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:03:37,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983845465] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:37,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:37,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:03:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271716938] [2022-12-06 05:03:37,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:03:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:37,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:03:37,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=75, Unknown=2, NotChecked=0, Total=110 [2022-12-06 05:03:37,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 05:03:37,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 199 transitions, 2247 flow. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 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:03:37,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:37,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 05:03:37,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:40,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:03:42,986 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:44,998 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,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:50,252 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:53,437 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:54,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:56,565 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:59,285 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:04:01,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:03,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:04:05,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:08,844 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:04:13,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:16,302 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:19,067 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:24,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:27,067 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:28,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:30,638 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:04:32,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:33,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:37,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:04:38,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:41,928 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:04:46,460 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:49,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:51,257 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:04:54,055 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:56,684 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:04:57,494 INFO L130 PetriNetUnfolder]: 46969/57848 cut-off events. [2022-12-06 05:04:57,494 INFO L131 PetriNetUnfolder]: For 310774/310774 co-relation queries the response was YES. [2022-12-06 05:04:57,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331338 conditions, 57848 events. 46969/57848 cut-off events. For 310774/310774 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 255211 event pairs, 4775 based on Foata normal form. 5/57853 useless extension candidates. Maximal degree in co-relation 319803. Up to 48260 conditions per place. [2022-12-06 05:04:58,100 INFO L137 encePairwiseOnDemand]: 42/62 looper letters, 363 selfloop transitions, 84 changer transitions 9/456 dead transitions. [2022-12-06 05:04:58,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 456 transitions, 4779 flow [2022-12-06 05:04:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:04:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:04:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2022-12-06 05:04:58,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2022-12-06 05:04:58,103 INFO L175 Difference]: Start difference. First operand has 114 places, 199 transitions, 2247 flow. Second operand 10 states and 266 transitions. [2022-12-06 05:04:58,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 456 transitions, 4779 flow [2022-12-06 05:05:00,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 456 transitions, 4682 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-06 05:05:00,604 INFO L231 Difference]: Finished difference. Result has 127 places, 260 transitions, 3101 flow [2022-12-06 05:05:00,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3101, PETRI_PLACES=127, PETRI_TRANSITIONS=260} [2022-12-06 05:05:00,604 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 77 predicate places. [2022-12-06 05:05:00,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:05:00,604 INFO L89 Accepts]: Start accepts. Operand has 127 places, 260 transitions, 3101 flow [2022-12-06 05:05:00,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:05:00,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:05:00,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 260 transitions, 3101 flow [2022-12-06 05:05:00,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 260 transitions, 3101 flow [2022-12-06 05:05:00,830 INFO L130 PetriNetUnfolder]: 1762/2639 cut-off events. [2022-12-06 05:05:00,830 INFO L131 PetriNetUnfolder]: For 14183/27997 co-relation queries the response was YES. [2022-12-06 05:05:00,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14962 conditions, 2639 events. 1762/2639 cut-off events. For 14183/27997 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12011 event pairs, 134 based on Foata normal form. 30/2567 useless extension candidates. Maximal degree in co-relation 14701. Up to 1785 conditions per place. [2022-12-06 05:05:00,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 260 transitions, 3101 flow [2022-12-06 05:05:00,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 6096 [2022-12-06 05:05:00,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 05:05:01,028 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:05:01,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 425 [2022-12-06 05:05:01,029 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 260 transitions, 3120 flow [2022-12-06 05:05:01,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 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:05:01,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:05:01,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:05:01,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 05:05:01,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:05:01,234 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:05:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:05:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1556561123, now seen corresponding path program 1 times [2022-12-06 05:05:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:05:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845209928] [2022-12-06 05:05:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:05:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:02,269 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:05:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:05:02,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845209928] [2022-12-06 05:05:02,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845209928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:05:02,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385189950] [2022-12-06 05:05:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:05:02,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:05:02,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:05:02,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:05:02,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:05:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:05:24,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 05:05:24,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2022-12-06 05:16:20,389 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:16:20,390 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:16:21,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:16:21,438 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 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown