/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:56:34,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:56:34,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:56:34,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:56:34,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:56:34,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:56:34,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:56:34,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:56:34,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:56:34,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:56:34,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:56:34,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:56:34,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:56:34,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:56:34,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:56:34,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:56:34,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:56:34,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:56:34,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:56:34,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:56:34,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:56:34,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:56:34,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:56:34,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:56:34,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:56:34,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:56:34,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:56:34,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:56:34,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:56:34,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:56:34,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:56:34,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:56:34,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:56:34,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:56:34,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:56:34,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:56:34,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:56:34,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:56:34,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:56:34,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:56:34,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:56:34,418 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:56:34,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:56:34,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:56:34,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:56:34,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:56:34,450 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:56:34,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:56:34,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:56:34,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:56:34,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:56:34,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:56:34,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:56:34,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:56:34,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:56:34,452 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:56:34,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:56:34,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:56:34,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:56:34,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:56:34,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:56:34,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:56:34,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:56:34,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:56:34,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:56:34,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:56:34,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:56:34,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:56:34,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:56:34,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:56:34,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:56:34,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:56:34,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:56:34,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:56:34,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:56:34,774 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:56:34,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2022-12-13 12:56:35,848 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:56:36,084 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:56:36,085 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2022-12-13 12:56:36,093 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba806da9b/22d382eb20b84cc5b73e341e82ccfe5c/FLAG9862cb382 [2022-12-13 12:56:36,113 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba806da9b/22d382eb20b84cc5b73e341e82ccfe5c [2022-12-13 12:56:36,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:56:36,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:56:36,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:56:36,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:56:36,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:56:36,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a54413d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36, skipping insertion in model container [2022-12-13 12:56:36,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:56:36,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:56:36,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,339 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/parallel-misc-2.wvr.c[2554,2567] [2022-12-13 12:56:36,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:56:36,355 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:56:36,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:56:36,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:56:36,395 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/parallel-misc-2.wvr.c[2554,2567] [2022-12-13 12:56:36,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:56:36,408 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:56:36,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36 WrapperNode [2022-12-13 12:56:36,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:56:36,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:56:36,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:56:36,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:56:36,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,451 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-12-13 12:56:36,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:56:36,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:56:36,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:56:36,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:56:36,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:56:36,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:56:36,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:56:36,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:56:36,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (1/1) ... [2022-12-13 12:56:36,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:56:36,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:56:36,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:56:36,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:56:36,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:56:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:56:36,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:56:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:56:36,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:56:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:56:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:56:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:56:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:56:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:56:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:56:36,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:56:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:56:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:56:36,570 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:56:36,661 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:56:36,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:56:36,905 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:56:36,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:56:36,924 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 12:56:36,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:36 BoogieIcfgContainer [2022-12-13 12:56:36,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:56:36,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:56:36,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:56:36,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:56:36,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:56:36" (1/3) ... [2022-12-13 12:56:36,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68aa3c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:56:36, skipping insertion in model container [2022-12-13 12:56:36,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:36" (2/3) ... [2022-12-13 12:56:36,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68aa3c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:56:36, skipping insertion in model container [2022-12-13 12:56:36,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:36" (3/3) ... [2022-12-13 12:56:36,936 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2022-12-13 12:56:36,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:56:36,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:56:36,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:56:37,039 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 12:56:37,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 97 transitions, 210 flow [2022-12-13 12:56:37,163 INFO L130 PetriNetUnfolder]: 8/95 cut-off events. [2022-12-13 12:56:37,163 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:56:37,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 8/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2022-12-13 12:56:37,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 97 transitions, 210 flow [2022-12-13 12:56:37,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 87 transitions, 186 flow [2022-12-13 12:56:37,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:37,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 87 transitions, 186 flow [2022-12-13 12:56:37,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 186 flow [2022-12-13 12:56:37,228 INFO L130 PetriNetUnfolder]: 8/87 cut-off events. [2022-12-13 12:56:37,228 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:56:37,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 8/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2022-12-13 12:56:37,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 87 transitions, 186 flow [2022-12-13 12:56:37,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-13 12:56:40,340 INFO L241 LiptonReduction]: Total number of compositions: 74 [2022-12-13 12:56:40,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:56:40,359 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;@71c25e4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:56:40,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 12:56:40,363 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-13 12:56:40,364 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:56:40,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:40,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:40,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1885800598, now seen corresponding path program 1 times [2022-12-13 12:56:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857196131] [2022-12-13 12:56:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:40,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857196131] [2022-12-13 12:56:40,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857196131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:40,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:40,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:56:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317575642] [2022-12-13 12:56:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:40,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:56:40,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:56:40,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:40,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:56:40,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:40,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:40,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:56:40,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:40,847 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2022-12-13 12:56:40,847 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 12:56:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2022-12-13 12:56:40,849 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2022-12-13 12:56:40,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2022-12-13 12:56:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:56:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-13 12:56:40,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-13 12:56:40,859 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 24 transitions. [2022-12-13 12:56:40,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2022-12-13 12:56:40,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:56:40,863 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2022-12-13 12:56:40,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2022-12-13 12:56:40,868 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-13 12:56:40,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:40,869 INFO L89 Accepts]: Start accepts. Operand has 17 places, 15 transitions, 49 flow [2022-12-13 12:56:40,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:40,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:40,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-13 12:56:40,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 15 transitions, 49 flow [2022-12-13 12:56:40,886 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-13 12:56:40,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:56:40,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 8 conditions per place. [2022-12-13 12:56:40,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-13 12:56:40,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-13 12:56:40,890 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:56:40,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 12:56:40,893 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2022-12-13 12:56:40,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:40,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:40,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:40,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:56:40,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -291346094, now seen corresponding path program 1 times [2022-12-13 12:56:40,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:40,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467727169] [2022-12-13 12:56:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:40,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:41,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467727169] [2022-12-13 12:56:41,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467727169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:41,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:41,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:56:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981673006] [2022-12-13 12:56:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:41,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:41,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:56:41,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:41,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:41,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:56:41,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:41,184 INFO L130 PetriNetUnfolder]: 53/103 cut-off events. [2022-12-13 12:56:41,184 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 12:56:41,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 103 events. 53/103 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 252 event pairs, 7 based on Foata normal form. 4/107 useless extension candidates. Maximal degree in co-relation 76. Up to 57 conditions per place. [2022-12-13 12:56:41,187 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-12-13 12:56:41,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 34 transitions, 171 flow [2022-12-13 12:56:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:56:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-13 12:56:41,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2022-12-13 12:56:41,189 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 5 states and 32 transitions. [2022-12-13 12:56:41,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 34 transitions, 171 flow [2022-12-13 12:56:41,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 34 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:56:41,190 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 102 flow [2022-12-13 12:56:41,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2022-12-13 12:56:41,191 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-13 12:56:41,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:41,191 INFO L89 Accepts]: Start accepts. Operand has 23 places, 21 transitions, 102 flow [2022-12-13 12:56:41,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:41,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:41,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 21 transitions, 102 flow [2022-12-13 12:56:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 21 transitions, 102 flow [2022-12-13 12:56:41,200 INFO L130 PetriNetUnfolder]: 10/37 cut-off events. [2022-12-13 12:56:41,201 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-12-13 12:56:41,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 37 events. 10/37 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 62. Up to 15 conditions per place. [2022-12-13 12:56:41,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 21 transitions, 102 flow [2022-12-13 12:56:41,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 12:56:41,203 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:56:41,204 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:56:41,205 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 102 flow [2022-12-13 12:56:41,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:41,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:41,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:41,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:56:41,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1866870150, now seen corresponding path program 2 times [2022-12-13 12:56:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:41,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722915938] [2022-12-13 12:56:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:41,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722915938] [2022-12-13 12:56:41,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722915938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:41,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069267387] [2022-12-13 12:56:41,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:56:41,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:56:41,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:56:41,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:56:41,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:56:41,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:56:41,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:56:41,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:41,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069267387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:56:42,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:56:42,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 12:56:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952491596] [2022-12-13 12:56:42,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:42,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:56:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:56:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:42,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:56:42,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:42,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:42,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:56:42,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:42,189 INFO L130 PetriNetUnfolder]: 69/133 cut-off events. [2022-12-13 12:56:42,189 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-12-13 12:56:42,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 133 events. 69/133 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 366 event pairs, 11 based on Foata normal form. 18/151 useless extension candidates. Maximal degree in co-relation 205. Up to 59 conditions per place. [2022-12-13 12:56:42,191 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 32 selfloop transitions, 11 changer transitions 4/47 dead transitions. [2022-12-13 12:56:42,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 47 transitions, 302 flow [2022-12-13 12:56:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:56:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-13 12:56:42,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-13 12:56:42,194 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 102 flow. Second operand 6 states and 44 transitions. [2022-12-13 12:56:42,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 47 transitions, 302 flow [2022-12-13 12:56:42,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:56:42,196 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 185 flow [2022-12-13 12:56:42,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-13 12:56:42,197 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 13 predicate places. [2022-12-13 12:56:42,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:42,197 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 185 flow [2022-12-13 12:56:42,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:42,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:42,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 185 flow [2022-12-13 12:56:42,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 185 flow [2022-12-13 12:56:42,204 INFO L130 PetriNetUnfolder]: 13/47 cut-off events. [2022-12-13 12:56:42,205 INFO L131 PetriNetUnfolder]: For 81/84 co-relation queries the response was YES. [2022-12-13 12:56:42,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 47 events. 13/47 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 124. Up to 20 conditions per place. [2022-12-13 12:56:42,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 185 flow [2022-12-13 12:56:42,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 12:56:42,206 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:56:42,207 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 12:56:42,207 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 185 flow [2022-12-13 12:56:42,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:42,208 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:42,208 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:42,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:56:42,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:42,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -219994634, now seen corresponding path program 1 times [2022-12-13 12:56:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285095314] [2022-12-13 12:56:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:42,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285095314] [2022-12-13 12:56:42,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285095314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:42,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:56:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109957852] [2022-12-13 12:56:42,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:42,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:42,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:42,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 12:56:42,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:42,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:42,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 12:56:42,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:42,652 INFO L130 PetriNetUnfolder]: 78/160 cut-off events. [2022-12-13 12:56:42,652 INFO L131 PetriNetUnfolder]: For 498/498 co-relation queries the response was YES. [2022-12-13 12:56:42,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 160 events. 78/160 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 507 event pairs, 10 based on Foata normal form. 12/172 useless extension candidates. Maximal degree in co-relation 342. Up to 80 conditions per place. [2022-12-13 12:56:42,656 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 38 selfloop transitions, 8 changer transitions 4/50 dead transitions. [2022-12-13 12:56:42,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 420 flow [2022-12-13 12:56:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:56:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 12:56:42,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2022-12-13 12:56:42,658 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 185 flow. Second operand 5 states and 36 transitions. [2022-12-13 12:56:42,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 420 flow [2022-12-13 12:56:42,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 371 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:42,665 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 236 flow [2022-12-13 12:56:42,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 12:56:42,666 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 18 predicate places. [2022-12-13 12:56:42,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:42,666 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 236 flow [2022-12-13 12:56:42,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:42,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:42,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 236 flow [2022-12-13 12:56:42,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 236 flow [2022-12-13 12:56:42,677 INFO L130 PetriNetUnfolder]: 16/56 cut-off events. [2022-12-13 12:56:42,677 INFO L131 PetriNetUnfolder]: For 169/171 co-relation queries the response was YES. [2022-12-13 12:56:42,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 56 events. 16/56 cut-off events. For 169/171 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 1 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 158. Up to 23 conditions per place. [2022-12-13 12:56:42,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 236 flow [2022-12-13 12:56:42,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 12:56:42,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L61-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (not (< (mod v_~i2~0_In_3 4294967296) (* (mod v_~N~0_In_7 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~i2~0=v_~i2~0_In_3, ~N~0=v_~N~0_In_7} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, ~i2~0=v_~i2~0_In_3, ~N~0=v_~N~0_In_7, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-13 12:56:42,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:56:42,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 12:56:42,914 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 245 flow [2022-12-13 12:56:42,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:42,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:42,914 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:42,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:56:42,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:42,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1211042950, now seen corresponding path program 2 times [2022-12-13 12:56:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:42,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478189227] [2022-12-13 12:56:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478189227] [2022-12-13 12:56:43,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478189227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213942057] [2022-12-13 12:56:43,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:56:43,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:43,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:56:43,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:56:43,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:56:43,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:56:43,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:56:43,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:56:43,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:43,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:43,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213942057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:56:43,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:56:43,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 7 [2022-12-13 12:56:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344051302] [2022-12-13 12:56:43,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:43,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:56:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:56:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:43,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-13 12:56:43,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 245 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:43,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:43,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-13 12:56:43,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:43,806 INFO L130 PetriNetUnfolder]: 93/184 cut-off events. [2022-12-13 12:56:43,807 INFO L131 PetriNetUnfolder]: For 732/732 co-relation queries the response was YES. [2022-12-13 12:56:43,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 184 events. 93/184 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 572 event pairs, 10 based on Foata normal form. 22/206 useless extension candidates. Maximal degree in co-relation 616. Up to 119 conditions per place. [2022-12-13 12:56:43,809 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 41 selfloop transitions, 16 changer transitions 1/58 dead transitions. [2022-12-13 12:56:43,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 536 flow [2022-12-13 12:56:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:56:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:56:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-13 12:56:43,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2022-12-13 12:56:43,810 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 245 flow. Second operand 7 states and 44 transitions. [2022-12-13 12:56:43,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 536 flow [2022-12-13 12:56:43,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 522 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 12:56:43,814 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 386 flow [2022-12-13 12:56:43,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 12:56:43,815 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-13 12:56:43,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:43,816 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 386 flow [2022-12-13 12:56:43,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:43,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:43,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 386 flow [2022-12-13 12:56:43,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 386 flow [2022-12-13 12:56:43,840 INFO L130 PetriNetUnfolder]: 22/74 cut-off events. [2022-12-13 12:56:43,840 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-12-13 12:56:43,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 74 events. 22/74 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 301. Up to 35 conditions per place. [2022-12-13 12:56:43,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 386 flow [2022-12-13 12:56:43,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-13 12:56:44,694 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:56:44,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 880 [2022-12-13 12:56:44,695 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 400 flow [2022-12-13 12:56:44,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:44,696 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,703 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-13 12:56:44,900 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-13 12:56:44,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 511785357, now seen corresponding path program 1 times [2022-12-13 12:56:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10342864] [2022-12-13 12:56:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:56:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:45,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10342864] [2022-12-13 12:56:45,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10342864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:45,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937779515] [2022-12-13 12:56:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:45,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:56:45,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:56:45,936 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-13 12:56:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:46,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:56:46,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:46,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937779515] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:56:47,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:56:47,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2022-12-13 12:56:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571714120] [2022-12-13 12:56:47,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:56:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:56:47,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:56:47,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 12:56:47,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 400 flow. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-13 12:56:47,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:47,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 12:56:47,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:49,977 INFO L130 PetriNetUnfolder]: 212/430 cut-off events. [2022-12-13 12:56:49,978 INFO L131 PetriNetUnfolder]: For 2729/2729 co-relation queries the response was YES. [2022-12-13 12:56:49,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 430 events. 212/430 cut-off events. For 2729/2729 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1899 event pairs, 6 based on Foata normal form. 3/433 useless extension candidates. Maximal degree in co-relation 1615. Up to 189 conditions per place. [2022-12-13 12:56:49,982 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 63 selfloop transitions, 63 changer transitions 8/134 dead transitions. [2022-12-13 12:56:49,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 134 transitions, 1568 flow [2022-12-13 12:56:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:56:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 12:56:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 102 transitions. [2022-12-13 12:56:49,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 12:56:49,985 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 400 flow. Second operand 18 states and 102 transitions. [2022-12-13 12:56:49,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 134 transitions, 1568 flow [2022-12-13 12:56:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 1448 flow, removed 52 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:49,993 INFO L231 Difference]: Finished difference. Result has 67 places, 89 transitions, 1206 flow [2022-12-13 12:56:49,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1206, PETRI_PLACES=67, PETRI_TRANSITIONS=89} [2022-12-13 12:56:49,994 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-13 12:56:49,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:49,994 INFO L89 Accepts]: Start accepts. Operand has 67 places, 89 transitions, 1206 flow [2022-12-13 12:56:49,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:49,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:49,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 89 transitions, 1206 flow [2022-12-13 12:56:49,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 89 transitions, 1206 flow [2022-12-13 12:56:50,016 INFO L130 PetriNetUnfolder]: 46/157 cut-off events. [2022-12-13 12:56:50,016 INFO L131 PetriNetUnfolder]: For 1160/1160 co-relation queries the response was YES. [2022-12-13 12:56:50,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 157 events. 46/157 cut-off events. For 1160/1160 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 729 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 817. Up to 76 conditions per place. [2022-12-13 12:56:50,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 89 transitions, 1206 flow [2022-12-13 12:56:50,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 12:56:51,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] and [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-13 12:56:52,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 12:56:54,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L42-1-->L61-1: Formula: (let ((.cse4 (* 2 (mod v_~N~0_119 2147483648)))) (and (let ((.cse2 (= (mod v_~d2~0_159 256) 0))) (let ((.cse0 (< (mod v_~i2~0_144 4294967296) .cse4)) (.cse1 (= v_~i2~0_143 (+ v_~i2~0_144 1))) (.cse3 (= v_~d2~0_158 (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 (= v_~pos~0_325 (+ v_~pos~0_324 2)) .cse1 .cse2 .cse3) (and .cse0 (not .cse2) .cse1 (= v_~pos~0_324 (+ v_~pos~0_325 2)) .cse3)))) (let ((.cse6 (= (mod v_~d1~0_186 256) 0))) (let ((.cse5 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d1~0_185)) (.cse7 (= v_~i1~0_182 (+ v_~i1~0_183 1))) (.cse8 (< (mod v_~i1~0_183 4294967296) .cse4))) (or (and .cse5 (not .cse6) (= |v_thread1Thread1of1ForFork0_#t~post2_91| |v_thread1Thread1of1ForFork0_#t~post2_90|) .cse7 (= v_~pos~0_325 (+ v_~pos~0_326 1)) .cse8) (and (= v_~pos~0_326 (+ v_~pos~0_325 1)) .cse5 .cse7 .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_91| |v_thread1Thread1of1ForFork0_#t~post1_90|) .cse8)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_91|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_91|, ~i2~0=v_~i2~0_144, ~pos~0=v_~pos~0_326, ~N~0=v_~N~0_119, ~i1~0=v_~i1~0_183, ~d2~0=v_~d2~0_159, ~d1~0=v_~d1~0_186} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_76|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_90|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_90|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_73|, ~i2~0=v_~i2~0_143, ~pos~0=v_~pos~0_324, ~N~0=v_~N~0_119, ~i1~0=v_~i1~0_182, ~d2~0=v_~d2~0_158, ~d1~0=v_~d1~0_185} AuxVars[v_~pos~0_325] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~pos~0, ~i1~0, ~d2~0, ~d1~0] and [354] L42-1-->L42-1: Formula: (let ((.cse1 (= (mod v_~d1~0_In_1 256) 0))) (let ((.cse0 (= v_~d1~0_Out_6 (ite (= (ite .cse1 1 0) 0) 0 1))) (.cse2 (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_6)) (.cse3 (< (mod v_~i1~0_In_3 4294967296) (* 2 (mod v_~N~0_In_3 2147483648))))) (or (and (= (+ v_~pos~0_Out_6 1) v_~pos~0_In_3) .cse0 .cse1 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post1_Out_2| |v_thread1Thread1of1ForFork0_#t~post1_In_1|) .cse3) (and (not .cse1) .cse0 .cse2 (= |v_thread1Thread1of1ForFork0_#t~post2_In_1| |v_thread1Thread1of1ForFork0_#t~post2_Out_2|) .cse3 (= v_~pos~0_Out_6 (+ v_~pos~0_In_3 1)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_In_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_In_1|, ~i1~0=v_~i1~0_In_3, ~pos~0=v_~pos~0_In_3, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_In_1} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_Out_2|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_Out_2|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_2|, ~i1~0=v_~i1~0_Out_6, ~pos~0=v_~pos~0_Out_6, ~N~0=v_~N~0_In_3, ~d1~0=v_~d1~0_Out_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] [2022-12-13 12:56:57,282 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:56:57,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7288 [2022-12-13 12:56:57,283 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 88 transitions, 1272 flow [2022-12-13 12:56:57,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-13 12:56:57,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:57,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:57,289 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-13 12:56:57,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:57,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:57,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1102993440, now seen corresponding path program 1 times [2022-12-13 12:56:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:57,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791009509] [2022-12-13 12:56:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:57,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791009509] [2022-12-13 12:56:57,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791009509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:57,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:57,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:56:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133951091] [2022-12-13 12:56:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:57,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:56:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:56:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:57,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 12:56:57,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 88 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:57,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:57,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 12:56:57,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:58,035 INFO L130 PetriNetUnfolder]: 233/464 cut-off events. [2022-12-13 12:56:58,035 INFO L131 PetriNetUnfolder]: For 5074/5074 co-relation queries the response was YES. [2022-12-13 12:56:58,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 464 events. 233/464 cut-off events. For 5074/5074 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2139 event pairs, 29 based on Foata normal form. 6/466 useless extension candidates. Maximal degree in co-relation 2711. Up to 364 conditions per place. [2022-12-13 12:56:58,040 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 91 selfloop transitions, 13 changer transitions 3/107 dead transitions. [2022-12-13 12:56:58,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 1698 flow [2022-12-13 12:56:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:56:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-13 12:56:58,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 12:56:58,042 INFO L175 Difference]: Start difference. First operand has 65 places, 88 transitions, 1272 flow. Second operand 3 states and 36 transitions. [2022-12-13 12:56:58,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 1698 flow [2022-12-13 12:56:58,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 107 transitions, 1275 flow, removed 207 selfloop flow, removed 1 redundant places. [2022-12-13 12:56:58,059 INFO L231 Difference]: Finished difference. Result has 67 places, 90 transitions, 951 flow [2022-12-13 12:56:58,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=67, PETRI_TRANSITIONS=90} [2022-12-13 12:56:58,059 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-13 12:56:58,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:58,060 INFO L89 Accepts]: Start accepts. Operand has 67 places, 90 transitions, 951 flow [2022-12-13 12:56:58,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:58,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:58,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 90 transitions, 951 flow [2022-12-13 12:56:58,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 90 transitions, 951 flow [2022-12-13 12:56:58,087 INFO L130 PetriNetUnfolder]: 52/181 cut-off events. [2022-12-13 12:56:58,087 INFO L131 PetriNetUnfolder]: For 1090/1093 co-relation queries the response was YES. [2022-12-13 12:56:58,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 181 events. 52/181 cut-off events. For 1090/1093 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 948 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 724. Up to 51 conditions per place. [2022-12-13 12:56:58,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 90 transitions, 951 flow [2022-12-13 12:56:58,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-13 12:56:58,091 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:56:58,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 12:56:58,092 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 90 transitions, 951 flow [2022-12-13 12:56:58,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:58,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:58,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:58,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:56:58,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1452058887, now seen corresponding path program 1 times [2022-12-13 12:56:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:58,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967116777] [2022-12-13 12:56:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:58,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967116777] [2022-12-13 12:56:58,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967116777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:58,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:58,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:56:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553737221] [2022-12-13 12:56:58,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:58,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:58,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:58,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 12:56:58,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 90 transitions, 951 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:58,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:56:58,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 12:56:58,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:56:58,517 INFO L130 PetriNetUnfolder]: 267/520 cut-off events. [2022-12-13 12:56:58,518 INFO L131 PetriNetUnfolder]: For 4181/4181 co-relation queries the response was YES. [2022-12-13 12:56:58,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 520 events. 267/520 cut-off events. For 4181/4181 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2440 event pairs, 22 based on Foata normal form. 12/528 useless extension candidates. Maximal degree in co-relation 2366. Up to 411 conditions per place. [2022-12-13 12:56:58,523 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 97 selfloop transitions, 23 changer transitions 0/120 dead transitions. [2022-12-13 12:56:58,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 1408 flow [2022-12-13 12:56:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:56:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 12:56:58,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 12:56:58,525 INFO L175 Difference]: Start difference. First operand has 64 places, 90 transitions, 951 flow. Second operand 5 states and 44 transitions. [2022-12-13 12:56:58,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 1408 flow [2022-12-13 12:56:58,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 1375 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 12:56:58,542 INFO L231 Difference]: Finished difference. Result has 68 places, 100 transitions, 1116 flow [2022-12-13 12:56:58,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1116, PETRI_PLACES=68, PETRI_TRANSITIONS=100} [2022-12-13 12:56:58,545 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 50 predicate places. [2022-12-13 12:56:58,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:56:58,545 INFO L89 Accepts]: Start accepts. Operand has 68 places, 100 transitions, 1116 flow [2022-12-13 12:56:58,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:56:58,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:56:58,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 100 transitions, 1116 flow [2022-12-13 12:56:58,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 100 transitions, 1116 flow [2022-12-13 12:56:58,570 INFO L130 PetriNetUnfolder]: 61/199 cut-off events. [2022-12-13 12:56:58,571 INFO L131 PetriNetUnfolder]: For 1312/1315 co-relation queries the response was YES. [2022-12-13 12:56:58,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 199 events. 61/199 cut-off events. For 1312/1315 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1056 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 869. Up to 60 conditions per place. [2022-12-13 12:56:58,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 100 transitions, 1116 flow [2022-12-13 12:56:58,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 12:56:59,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L42-1-->L42-1: Formula: (let ((.cse2 (+ v_~pos~0_319 1)) (.cse5 (* (mod v_~N~0_117 2147483648) 2))) (and (let ((.cse4 (= (mod v_~d1~0_180 256) 0))) (let ((.cse0 (= v_~i1~0_176 (+ v_~i1~0_177 1))) (.cse1 (< (mod v_~i1~0_177 4294967296) .cse5)) (.cse3 (= v_~d1~0_179 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 (= v_~pos~0_318 .cse2) .cse3 (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_85| |v_thread1Thread1of1ForFork0_#t~post2_84|)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_85| |v_thread1Thread1of1ForFork0_#t~post1_84|) .cse0 (= v_~pos~0_319 (+ v_~pos~0_318 1)) .cse1 .cse4 .cse3)))) (let ((.cse6 (= 0 (mod v_~d1~0_181 256)))) (let ((.cse7 (= v_~i1~0_177 (+ v_~i1~0_178 1))) (.cse8 (= v_~d1~0_180 (ite (= (ite .cse6 1 0) 0) 0 1))) (.cse9 (< (mod v_~i1~0_178 4294967296) .cse5))) (or (and .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_85| |v_thread1Thread1of1ForFork0_#t~post1_86|) .cse7 (= v_~pos~0_320 .cse2) .cse8 .cse9) (and (not .cse6) (= v_~pos~0_319 (+ v_~pos~0_320 1)) .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_#t~post2_86| |v_thread1Thread1of1ForFork0_#t~post2_85|) .cse9)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_86|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_86|, ~i1~0=v_~i1~0_178, ~pos~0=v_~pos~0_320, ~N~0=v_~N~0_117, ~d1~0=v_~d1~0_181} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_84|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_84|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_69|, ~i1~0=v_~i1~0_176, ~pos~0=v_~pos~0_318, ~N~0=v_~N~0_117, ~d1~0=v_~d1~0_179} AuxVars[|v_thread1Thread1of1ForFork0_#t~post1_85|, |v_thread1Thread1of1ForFork0_#t~post2_85|, v_~d1~0_180, v_~i1~0_177, v_~pos~0_319] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i1~0, ~pos~0, ~d1~0] and [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 12:56:59,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:56:59,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1323 [2022-12-13 12:56:59,868 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 100 transitions, 1136 flow [2022-12-13 12:56:59,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:59,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:56:59,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:59,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:56:59,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:56:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash -364194890, now seen corresponding path program 1 times [2022-12-13 12:56:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:59,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919456638] [2022-12-13 12:56:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919456638] [2022-12-13 12:57:00,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919456638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:57:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551728501] [2022-12-13 12:57:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:57:00,408 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-13 12:57:00,410 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-13 12:57:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:00,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 12:57:00,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:57:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:00,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:57:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551728501] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:57:20,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:57:20,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 12:57:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632703710] [2022-12-13 12:57:20,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:57:20,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:57:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:57:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:57:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:57:20,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 12:57:20,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 1136 flow. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:20,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:57:20,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 12:57:20,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:57:27,152 INFO L130 PetriNetUnfolder]: 412/818 cut-off events. [2022-12-13 12:57:27,153 INFO L131 PetriNetUnfolder]: For 9201/9201 co-relation queries the response was YES. [2022-12-13 12:57:27,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 818 events. 412/818 cut-off events. For 9201/9201 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4458 event pairs, 6 based on Foata normal form. 74/888 useless extension candidates. Maximal degree in co-relation 3928. Up to 225 conditions per place. [2022-12-13 12:57:27,166 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 134 selfloop transitions, 81 changer transitions 2/217 dead transitions. [2022-12-13 12:57:27,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 217 transitions, 2536 flow [2022-12-13 12:57:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:57:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 12:57:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 115 transitions. [2022-12-13 12:57:27,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-13 12:57:27,171 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 1136 flow. Second operand 15 states and 115 transitions. [2022-12-13 12:57:27,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 217 transitions, 2536 flow [2022-12-13 12:57:27,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 217 transitions, 2508 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 12:57:27,200 INFO L231 Difference]: Finished difference. Result has 90 places, 140 transitions, 1979 flow [2022-12-13 12:57:27,200 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1979, PETRI_PLACES=90, PETRI_TRANSITIONS=140} [2022-12-13 12:57:27,201 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 72 predicate places. [2022-12-13 12:57:27,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:57:27,201 INFO L89 Accepts]: Start accepts. Operand has 90 places, 140 transitions, 1979 flow [2022-12-13 12:57:27,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:57:27,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:27,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 140 transitions, 1979 flow [2022-12-13 12:57:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 140 transitions, 1979 flow [2022-12-13 12:57:27,245 INFO L130 PetriNetUnfolder]: 88/304 cut-off events. [2022-12-13 12:57:27,245 INFO L131 PetriNetUnfolder]: For 3209/3220 co-relation queries the response was YES. [2022-12-13 12:57:27,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 304 events. 88/304 cut-off events. For 3209/3220 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1917 event pairs, 0 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 1590. Up to 85 conditions per place. [2022-12-13 12:57:27,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 140 transitions, 1979 flow [2022-12-13 12:57:27,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-13 12:57:27,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L42-1-->L42-1: Formula: (let ((.cse4 (+ v_~pos~0_367 2)) (.cse5 (* 2 (mod v_~N~0_127 2147483648)))) (and (let ((.cse2 (= (mod v_~d2~0_181 256) 0))) (let ((.cse0 (= (+ v_~i2~0_166 1) v_~i2~0_165)) (.cse1 (< (mod v_~i2~0_166 4294967296) .cse5)) (.cse3 (= v_~d2~0_180 (ite (= (ite .cse2 1 0) 0) 0 1)))) (or (and .cse0 .cse1 (= v_~pos~0_367 (+ v_~pos~0_370 2)) (not .cse2) .cse3) (and .cse0 (= .cse4 v_~pos~0_370) .cse2 .cse1 .cse3)))) (let ((.cse7 (= (mod v_~d1~0_210 256) 0))) (let ((.cse6 (= (+ v_~i1~0_207 1) v_~i1~0_206)) (.cse8 (= v_~d1~0_209 (ite (= (ite .cse7 1 0) 0) 0 1))) (.cse9 (< (mod v_~i1~0_207 4294967296) .cse5))) (or (and (= (+ v_~pos~0_370 1) v_~pos~0_369) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_115| |v_thread1Thread1of1ForFork0_#t~post1_114|) .cse7 .cse8 .cse9) (and .cse6 (= v_~pos~0_370 (+ v_~pos~0_369 1)) (not .cse7) .cse8 (= |v_thread1Thread1of1ForFork0_#t~post2_115| |v_thread1Thread1of1ForFork0_#t~post2_114|) .cse9)))) (let ((.cse11 (= (mod v_~d1~0_209 256) 0))) (let ((.cse10 (= (+ v_~i1~0_206 1) v_~i1~0_205)) (.cse12 (< (mod v_~i1~0_206 4294967296) .cse5)) (.cse13 (= v_~d1~0_208 (ite (= (ite .cse11 1 0) 0) 0 1)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_114| |v_thread1Thread1of1ForFork0_#t~post2_113|) .cse10 (not .cse11) (= v_~pos~0_366 (+ v_~pos~0_368 1)) .cse12 .cse13) (and (= v_~pos~0_368 (+ v_~pos~0_366 1)) .cse10 (= |v_thread1Thread1of1ForFork0_#t~post1_114| |v_thread1Thread1of1ForFork0_#t~post1_113|) .cse11 .cse12 .cse13)))) (let ((.cse15 (= (mod v_~d2~0_180 256) 0))) (let ((.cse14 (< (mod v_~i2~0_165 4294967296) .cse5)) (.cse16 (= v_~i2~0_164 (+ v_~i2~0_165 1))) (.cse17 (= v_~d2~0_179 (ite (= (ite .cse15 1 0) 0) 0 1)))) (or (and .cse14 (= v_~pos~0_367 (+ v_~pos~0_368 2)) .cse15 .cse16 .cse17) (and .cse14 (= .cse4 v_~pos~0_368) .cse16 (not .cse15) .cse17)))))) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_115|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_115|, ~i2~0=v_~i2~0_166, ~i1~0=v_~i1~0_207, ~pos~0=v_~pos~0_369, ~N~0=v_~N~0_127, ~d1~0=v_~d1~0_210, ~d2~0=v_~d2~0_181} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_88|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_113|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_113|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_85|, ~i2~0=v_~i2~0_164, ~i1~0=v_~i1~0_205, ~pos~0=v_~pos~0_366, ~N~0=v_~N~0_127, ~d1~0=v_~d1~0_208, ~d2~0=v_~d2~0_179} AuxVars[v_~i2~0_165, v_~pos~0_367, v_~pos~0_368, |v_thread1Thread1of1ForFork0_#t~post2_114|, |v_thread1Thread1of1ForFork0_#t~post1_114|, v_~pos~0_370, v_~d2~0_180, v_~d1~0_209, v_~i1~0_206] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0, ~pos~0, ~d1~0, ~d2~0] and [355] L61-1-->L61-1: Formula: (let ((.cse3 (= (mod v_~d2~0_In_1 256) 0))) (let ((.cse0 (= v_~i2~0_Out_6 (+ v_~i2~0_In_1 1))) (.cse1 (< (mod v_~i2~0_In_1 4294967296) (* (mod v_~N~0_In_5 2147483648) 2))) (.cse2 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_Out_6))) (or (and .cse0 .cse1 (= (+ v_~pos~0_Out_10 2) v_~pos~0_In_5) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (+ 2 v_~pos~0_In_5) v_~pos~0_Out_10) (not .cse3))))) InVars {~i2~0=v_~i2~0_In_1, ~pos~0=v_~pos~0_In_5, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_In_1} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_Out_2|, ~i2~0=v_~i2~0_Out_6, ~pos~0=v_~pos~0_Out_10, ~N~0=v_~N~0_In_5, ~d2~0=v_~d2~0_Out_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~i2~0, ~pos~0, ~d2~0] [2022-12-13 12:57:31,048 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:57:31,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3848 [2022-12-13 12:57:31,049 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 140 transitions, 2005 flow [2022-12-13 12:57:31,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:31,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:57:31,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:31,056 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-13 12:57:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:31,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:57:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -611596776, now seen corresponding path program 1 times [2022-12-13 12:57:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:57:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105335257] [2022-12-13 12:57:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:57:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105335257] [2022-12-13 12:57:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105335257] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:57:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108239162] [2022-12-13 12:57:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:57:31,765 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-13 12:57:31,768 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-13 12:57:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:31,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 12:57:31,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:57:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:32,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:57:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:33,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108239162] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:57:33,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:57:33,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 6 [2022-12-13 12:57:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308135822] [2022-12-13 12:57:33,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:57:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:57:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:57:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:57:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:57:33,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 12:57:33,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 140 transitions, 2005 flow. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:33,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:57:33,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 12:57:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:57:33,683 INFO L130 PetriNetUnfolder]: 531/1088 cut-off events. [2022-12-13 12:57:33,683 INFO L131 PetriNetUnfolder]: For 15107/15107 co-relation queries the response was YES. [2022-12-13 12:57:33,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7306 conditions, 1088 events. 531/1088 cut-off events. For 15107/15107 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6596 event pairs, 34 based on Foata normal form. 7/1091 useless extension candidates. Maximal degree in co-relation 6224. Up to 528 conditions per place. [2022-12-13 12:57:33,695 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 130 selfloop transitions, 76 changer transitions 8/214 dead transitions. [2022-12-13 12:57:33,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 214 transitions, 3302 flow [2022-12-13 12:57:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:57:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 12:57:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 12:57:33,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33653846153846156 [2022-12-13 12:57:33,697 INFO L175 Difference]: Start difference. First operand has 90 places, 140 transitions, 2005 flow. Second operand 8 states and 70 transitions. [2022-12-13 12:57:33,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 214 transitions, 3302 flow [2022-12-13 12:57:33,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 214 transitions, 2965 flow, removed 154 selfloop flow, removed 4 redundant places. [2022-12-13 12:57:33,751 INFO L231 Difference]: Finished difference. Result has 99 places, 175 transitions, 2582 flow [2022-12-13 12:57:33,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2582, PETRI_PLACES=99, PETRI_TRANSITIONS=175} [2022-12-13 12:57:33,752 INFO L295 CegarLoopForPetriNet]: 18 programPoint places, 81 predicate places. [2022-12-13 12:57:33,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:57:33,752 INFO L89 Accepts]: Start accepts. Operand has 99 places, 175 transitions, 2582 flow [2022-12-13 12:57:33,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:57:33,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:57:33,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 175 transitions, 2582 flow [2022-12-13 12:57:33,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 175 transitions, 2582 flow [2022-12-13 12:57:33,805 INFO L130 PetriNetUnfolder]: 104/388 cut-off events. [2022-12-13 12:57:33,806 INFO L131 PetriNetUnfolder]: For 4320/4333 co-relation queries the response was YES. [2022-12-13 12:57:33,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2265 conditions, 388 events. 104/388 cut-off events. For 4320/4333 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2735 event pairs, 0 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 2174. Up to 96 conditions per place. [2022-12-13 12:57:33,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 175 transitions, 2582 flow [2022-12-13 12:57:33,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-13 12:57:33,812 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:57:33,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 12:57:33,813 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 175 transitions, 2582 flow [2022-12-13 12:57:33,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:57:33,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:57:33,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:57:33,821 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-13 12:57:34,018 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,SelfDestructingSolverStorable9 [2022-12-13 12:57:34,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 12:57:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:57:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1230799818, now seen corresponding path program 1 times [2022-12-13 12:57:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:57:34,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49612161] [2022-12-13 12:57:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:57:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:57:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49612161] [2022-12-13 12:57:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49612161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:57:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519252669] [2022-12-13 12:57:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:57:34,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:57:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:57:34,286 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-13 12:57:34,289 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-13 12:57:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:57:34,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:57:34,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:57:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:57:37,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:57:46,892 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 3067 DAG size of output: 3059 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)