/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:03:42,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:03:42,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:03:42,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:03:42,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:03:42,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:03:42,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:03:42,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:03:42,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:03:42,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:03:42,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:03:42,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:03:42,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:03:42,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:03:42,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:03:42,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:03:42,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:03:42,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:03:42,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:03:42,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:03:42,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:03:42,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:03:42,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:03:42,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:03:42,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:03:42,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:03:42,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:03:42,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:03:42,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:03:42,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:03:42,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:03:42,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:03:42,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:03:42,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:03:42,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:03:42,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:03:42,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:03:42,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:03:42,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:03:42,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:03:42,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:03:42,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:03:42,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:03:42,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:03:42,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:03:42,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:03:42,525 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:03:42,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:03:42,526 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:03:42,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:03:42,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:03:42,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:03:42,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:03:42,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:03:42,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:03:42,527 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:03:42,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:03:42,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:03:42,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:03:42,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:03:42,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:03:42,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:03:42,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:03:42,529 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:03:42,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:03:42,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:03:42,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:03:42,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:03:42,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:03:42,842 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:03:42,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-06 00:03:43,985 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:03:44,162 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:03:44,163 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-06 00:03:44,167 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba1834d4d/300b601b4a7c45448b9f3c4798dcb62d/FLAG515f8bbff [2022-12-06 00:03:44,179 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba1834d4d/300b601b4a7c45448b9f3c4798dcb62d [2022-12-06 00:03:44,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:03:44,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:03:44,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:03:44,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:03:44,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:03:44,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150ca781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44, skipping insertion in model container [2022-12-06 00:03:44,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:03:44,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:03:44,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,309 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-3.wvr.c[2410,2423] [2022-12-06 00:03:44,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:03:44,323 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:03:44,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:44,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:44,338 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-3.wvr.c[2410,2423] [2022-12-06 00:03:44,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:03:44,350 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:03:44,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44 WrapperNode [2022-12-06 00:03:44,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:03:44,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:03:44,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:03:44,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:03:44,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,372 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-12-06 00:03:44,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:03:44,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:03:44,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:03:44,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:03:44,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,387 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:03:44,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:03:44,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:03:44,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:03:44,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (1/1) ... [2022-12-06 00:03:44,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:03:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:03:44,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:03:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:03:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:03:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:03:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:03:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:03:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:03:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:03:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:03:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:03:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:03:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:03:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:03:44,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:03:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:03:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:03:44,473 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:03:44,554 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:03:44,555 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:03:44,751 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:03:44,772 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:03:44,772 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 00:03:44,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:03:44 BoogieIcfgContainer [2022-12-06 00:03:44,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:03:44,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:03:44,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:03:44,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:03:44,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:03:44" (1/3) ... [2022-12-06 00:03:44,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f6fffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:03:44, skipping insertion in model container [2022-12-06 00:03:44,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:44" (2/3) ... [2022-12-06 00:03:44,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f6fffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:03:44, skipping insertion in model container [2022-12-06 00:03:44,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:03:44" (3/3) ... [2022-12-06 00:03:44,783 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2022-12-06 00:03:44,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:03:44,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:03:44,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:03:44,869 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:03:44,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 196 flow [2022-12-06 00:03:44,938 INFO L130 PetriNetUnfolder]: 11/88 cut-off events. [2022-12-06 00:03:44,938 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:03:44,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 88 events. 11/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-06 00:03:44,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 90 transitions, 196 flow [2022-12-06 00:03:44,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 80 transitions, 172 flow [2022-12-06 00:03:44,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:44,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-06 00:03:44,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 172 flow [2022-12-06 00:03:45,005 INFO L130 PetriNetUnfolder]: 11/80 cut-off events. [2022-12-06 00:03:45,005 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:03:45,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 11/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-06 00:03:45,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-06 00:03:45,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 00:03:47,485 INFO L203 LiptonReduction]: Total number of compositions: 65 [2022-12-06 00:03:47,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:03:47,501 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;@72b07eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:03:47,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:03:47,504 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-06 00:03:47,504 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:03:47,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:47,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:47,505 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-06 00:03:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558226, now seen corresponding path program 1 times [2022-12-06 00:03:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:47,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685130107] [2022-12-06 00:03:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:03:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685130107] [2022-12-06 00:03:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685130107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:47,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:47,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:03:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506699841] [2022-12-06 00:03:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:03:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:03:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:03:47,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 00:03:47,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 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-06 00:03:47,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:47,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 00:03:47,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:47,852 INFO L130 PetriNetUnfolder]: 29/54 cut-off events. [2022-12-06 00:03:47,852 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 00:03:47,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 54 events. 29/54 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 90. Up to 45 conditions per place. [2022-12-06 00:03:47,854 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-06 00:03:47,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 19 transitions, 91 flow [2022-12-06 00:03:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:03:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:03:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-06 00:03:47,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 00:03:47,865 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 20 transitions. [2022-12-06 00:03:47,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 19 transitions, 91 flow [2022-12-06 00:03:47,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 19 transitions, 81 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:03:47,870 INFO L231 Difference]: Finished difference. Result has 17 places, 14 transitions, 42 flow [2022-12-06 00:03:47,871 INFO L276 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=17, PETRI_TRANSITIONS=14} [2022-12-06 00:03:47,875 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-06 00:03:47,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:47,876 INFO L89 Accepts]: Start accepts. Operand has 17 places, 14 transitions, 42 flow [2022-12-06 00:03:47,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:47,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:47,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-06 00:03:47,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 14 transitions, 42 flow [2022-12-06 00:03:47,895 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 00:03:47,896 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:03:47,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 14 events. 2/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2022-12-06 00:03:47,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-06 00:03:47,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 00:03:47,897 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:47,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:03:47,899 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 14 transitions, 42 flow [2022-12-06 00:03:47,900 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-06 00:03:47,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:47,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:47,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:03:47,906 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-06 00:03:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash -824867760, now seen corresponding path program 1 times [2022-12-06 00:03:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112125333] [2022-12-06 00:03:47,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:03:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112125333] [2022-12-06 00:03:48,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112125333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:48,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:48,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:03:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876715958] [2022-12-06 00:03:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:48,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:03:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:03:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:03:48,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 00:03:48,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 14 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-06 00:03:48,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:48,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 00:03:48,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:48,082 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2022-12-06 00:03:48,082 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 00:03:48,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 73 events. 40/73 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 6 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 112. Up to 49 conditions per place. [2022-12-06 00:03:48,083 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 19 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-06 00:03:48,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 21 transitions, 106 flow [2022-12-06 00:03:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:03:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:03:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-06 00:03:48,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 00:03:48,085 INFO L175 Difference]: Start difference. First operand has 17 places, 14 transitions, 42 flow. Second operand 3 states and 20 transitions. [2022-12-06 00:03:48,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 21 transitions, 106 flow [2022-12-06 00:03:48,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:03:48,086 INFO L231 Difference]: Finished difference. Result has 19 places, 15 transitions, 52 flow [2022-12-06 00:03:48,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=19, PETRI_TRANSITIONS=15} [2022-12-06 00:03:48,087 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 00:03:48,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:48,087 INFO L89 Accepts]: Start accepts. Operand has 19 places, 15 transitions, 52 flow [2022-12-06 00:03:48,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:48,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:48,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-06 00:03:48,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 15 transitions, 52 flow [2022-12-06 00:03:48,093 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-12-06 00:03:48,094 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:03:48,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 15 events. 2/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-06 00:03:48,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-06 00:03:48,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:03:48,095 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:48,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 00:03:48,097 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 52 flow [2022-12-06 00:03:48,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-06 00:03:48,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:48,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:48,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:03:48,097 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-06 00:03:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 596881523, now seen corresponding path program 1 times [2022-12-06 00:03:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:48,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314485955] [2022-12-06 00:03:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:03:48,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:48,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314485955] [2022-12-06 00:03:48,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314485955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:03:48,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812020411] [2022-12-06 00:03:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:48,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:03:48,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:03:48,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:03:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:03:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:48,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:03:48,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:03:48,425 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-06 00:03:48,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:03:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:03:48,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812020411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:03:48,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:03:48,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 8 [2022-12-06 00:03:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713786854] [2022-12-06 00:03:48,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:03:48,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:03:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:03:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:03:48,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 00:03:48,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 52 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:48,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:48,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 00:03:48,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:48,698 INFO L130 PetriNetUnfolder]: 65/116 cut-off events. [2022-12-06 00:03:48,698 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 00:03:48,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 116 events. 65/116 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 264 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 100. Up to 41 conditions per place. [2022-12-06 00:03:48,699 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 40 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2022-12-06 00:03:48,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 58 transitions, 305 flow [2022-12-06 00:03:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:03:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:03:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-06 00:03:48,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 00:03:48,701 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 52 flow. Second operand 13 states and 65 transitions. [2022-12-06 00:03:48,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 58 transitions, 305 flow [2022-12-06 00:03:48,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:03:48,703 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 184 flow [2022-12-06 00:03:48,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=184, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 00:03:48,704 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 18 predicate places. [2022-12-06 00:03:48,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:48,704 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 184 flow [2022-12-06 00:03:48,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:48,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:48,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-06 00:03:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 184 flow [2022-12-06 00:03:48,710 INFO L130 PetriNetUnfolder]: 14/42 cut-off events. [2022-12-06 00:03:48,710 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 00:03:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 42 events. 14/42 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 125. Up to 16 conditions per place. [2022-12-06 00:03:48,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-06 00:03:48,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 00:03:49,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_In_4 256) 0) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_4} OutVars{~g2~0=v_~g2~0_In_4, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 00:03:50,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_In_4 256) 0) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_4} OutVars{~g2~0=v_~g2~0_In_4, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [347] L53-1-->L53-1: Formula: (let ((.cse7 (= (mod v_~d1~0_71 256) 0)) (.cse8 (+ v_~pos~0_85 1)) (.cse4 (= (mod v_~d1~0_70 256) 0))) (and (let ((.cse1 (= v_~g1~0_47 v_~g1~0_46)) (.cse0 (= (ite (= 0 (ite .cse4 1 0)) 0 1) v_~d1~0_69)) (.cse2 (= (mod v_~d1~0_69 256) 0)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= v_~g1~0_46 0) .cse0 (not .cse2) (not .cse3)))) (let ((.cse5 (= v_~g1~0_48 v_~g1~0_47)) (.cse6 (= v_~d1~0_70 (ite (= (ite .cse7 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_39| 256) 0) .cse5 .cse6) (and .cse4 .cse5 .cse6))) (or (and (= (+ v_~pos~0_86 1) v_~pos~0_85) (not .cse7) (= |v_thread1Thread1of1ForFork0_#t~post2_25| |v_thread1Thread1of1ForFork0_#t~post2_24|)) (and (= .cse8 v_~pos~0_86) (= |v_thread1Thread1of1ForFork0_#t~post1_25| |v_thread1Thread1of1ForFork0_#t~post1_24|) .cse7)) (let ((.cse9 (not (= (mod v_~g1~0_47 256) 0)))) (or (and (= .cse8 v_~pos~0_84) .cse9 (= |v_thread1Thread1of1ForFork0_#t~post2_24| |v_thread1Thread1of1ForFork0_#t~post2_23|) (not .cse4)) (and .cse9 .cse4 (= (+ v_~pos~0_84 1) v_~pos~0_85) (= |v_thread1Thread1of1ForFork0_#t~post1_24| |v_thread1Thread1of1ForFork0_#t~post1_23|)))))) InVars {~g1~0=v_~g1~0_48, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_39|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_25|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_25|, ~pos~0=v_~pos~0_86, ~d1~0=v_~d1~0_71} OutVars{~g1~0=v_~g1~0_46, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~pos~0=v_~pos~0_84, ~d1~0=v_~d1~0_69} AuxVars[v_~pos~0_85, v_~g1~0_47, |v_thread1Thread1of1ForFork0_#t~post1_24|, v_~d1~0_70, |v_thread1Thread1of1ForFork0_#t~nondet3_38|, |v_thread1Thread1of1ForFork0_#t~post2_24|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 00:03:51,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 00:03:51,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-06 00:03:52,891 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:03:52,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4188 [2022-12-06 00:03:52,892 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 187 flow [2022-12-06 00:03:52,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:52,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:52,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:52,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 00:03:53,092 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-06 00:03:53,093 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-06 00:03:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash -124370473, now seen corresponding path program 1 times [2022-12-06 00:03:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:53,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445046441] [2022-12-06 00:03:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:53,563 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-06 00:03:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:53,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445046441] [2022-12-06 00:03:53,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445046441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:03:53,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509482288] [2022-12-06 00:03:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:53,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:03:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:03:53,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:03:53,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:03:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:53,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 00:03:53,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:03:53,742 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-06 00:03:53,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:03:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:03:54,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509482288] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:03:54,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:03:54,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 00:03:54,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242868362] [2022-12-06 00:03:54,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:03:54,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:03:54,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:03:54,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:03:54,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:03:54,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 187 flow. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:54,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:54,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:03:54,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:54,312 INFO L130 PetriNetUnfolder]: 138/243 cut-off events. [2022-12-06 00:03:54,312 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2022-12-06 00:03:54,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 243 events. 138/243 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 803 event pairs, 0 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 515. Up to 111 conditions per place. [2022-12-06 00:03:54,315 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 48 selfloop transitions, 31 changer transitions 6/85 dead transitions. [2022-12-06 00:03:54,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 721 flow [2022-12-06 00:03:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:03:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:03:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 00:03:54,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 00:03:54,316 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 187 flow. Second operand 11 states and 80 transitions. [2022-12-06 00:03:54,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 721 flow [2022-12-06 00:03:54,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 573 flow, removed 65 selfloop flow, removed 4 redundant places. [2022-12-06 00:03:54,321 INFO L231 Difference]: Finished difference. Result has 41 places, 47 transitions, 360 flow [2022-12-06 00:03:54,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=360, PETRI_PLACES=41, PETRI_TRANSITIONS=47} [2022-12-06 00:03:54,322 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 23 predicate places. [2022-12-06 00:03:54,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:54,322 INFO L89 Accepts]: Start accepts. Operand has 41 places, 47 transitions, 360 flow [2022-12-06 00:03:54,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:54,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:54,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 47 transitions, 360 flow [2022-12-06 00:03:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 47 transitions, 360 flow [2022-12-06 00:03:54,333 INFO L130 PetriNetUnfolder]: 30/89 cut-off events. [2022-12-06 00:03:54,333 INFO L131 PetriNetUnfolder]: For 112/116 co-relation queries the response was YES. [2022-12-06 00:03:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 89 events. 30/89 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 1 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 283. Up to 36 conditions per place. [2022-12-06 00:03:54,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 47 transitions, 360 flow [2022-12-06 00:03:54,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 00:03:54,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-06 00:03:55,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [348] L75-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_76 256) 0))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0) (let ((.cse0 (= v_~g1~0_53 v_~g1~0_52)) (.cse3 (= (mod v_~d1~0_75 256) 0)) (.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_44| 256) 0)) (.cse2 (= v_~d1~0_75 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and (not .cse3) (not .cse1) (= v_~g1~0_52 0) .cse2))) (= (mod v_~g2~0_52 256) 0) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (not .cse4) (= (+ v_~pos~0_91 1) v_~pos~0_90) (= |v_thread1Thread1of1ForFork0_#t~post2_30| |v_thread1Thread1of1ForFork0_#t~post2_29|) .cse5) (and (= (+ v_~pos~0_90 1) v_~pos~0_91) (= |v_thread1Thread1of1ForFork0_#t~post1_29| |v_thread1Thread1of1ForFork0_#t~post1_30|) .cse4 .cse5))) (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) InVars {~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_30|, ~pos~0=v_~pos~0_91, ~d1~0=v_~d1~0_76} OutVars{~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_52, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_29|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_29|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~pos~0=v_~pos~0_90, ~d1~0=v_~d1~0_75} AuxVars[] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-06 00:03:56,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_In_4 256) 0) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_4} OutVars{~g2~0=v_~g2~0_In_4, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 00:03:56,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:03:56,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 00:03:56,537 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post2_80 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:03:56,540 INFO L158 Benchmark]: Toolchain (without parser) took 12357.28ms. Allocated memory was 177.2MB in the beginning and 337.6MB in the end (delta: 160.4MB). Free memory was 154.3MB in the beginning and 299.7MB in the end (delta: -145.4MB). Peak memory consumption was 197.5MB. Max. memory is 8.0GB. [2022-12-06 00:03:56,540 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory was 153.2MB in the beginning and 153.1MB in the end (delta: 102.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:03:56,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.18ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 142.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:03:56,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.94ms. Allocated memory is still 177.2MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:03:56,543 INFO L158 Benchmark]: Boogie Preprocessor took 16.46ms. Allocated memory is still 177.2MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:03:56,543 INFO L158 Benchmark]: RCFGBuilder took 384.39ms. Allocated memory is still 177.2MB. Free memory was 139.6MB in the beginning and 125.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 00:03:56,543 INFO L158 Benchmark]: TraceAbstraction took 11764.34ms. Allocated memory was 177.2MB in the beginning and 337.6MB in the end (delta: 160.4MB). Free memory was 124.9MB in the beginning and 299.7MB in the end (delta: -174.8MB). Peak memory consumption was 168.1MB. Max. memory is 8.0GB. [2022-12-06 00:03:56,544 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory was 153.2MB in the beginning and 153.1MB in the end (delta: 102.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.18ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 142.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.94ms. Allocated memory is still 177.2MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.46ms. Allocated memory is still 177.2MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 384.39ms. Allocated memory is still 177.2MB. Free memory was 139.6MB in the beginning and 125.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11764.34ms. Allocated memory was 177.2MB in the beginning and 337.6MB in the end (delta: 160.4MB). Free memory was 124.9MB in the beginning and 299.7MB in the end (delta: -174.8MB). Peak memory consumption was 168.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 76 PlacesBefore, 18 PlacesAfterwards, 80 TransitionsBefore, 13 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 65 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 592, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 592, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 499, independent: 499, independent conditional: 0, independent unconditional: 499, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 499, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 499, unknown conditional: 0, unknown unconditional: 499] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 901, Positive conditional cache size: 0, Positive unconditional cache size: 901, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 17 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 19 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 36 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 30, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post2_80 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post2_80 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:03:56,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...